Answer:
○ 
Step-by-step explanation:
This system of inequalities has a shared portion at the origin, so we can easily jump to using the zero-interval test [test point (0, 0)] to verify the inequalities as false or true:
![\displaystyle 5[0] ≥ -4[0] - 10 → 0 ≥ -10](https://tex.z-dn.net/?f=%5Cdisplaystyle%205%5B0%5D%20%E2%89%A5%20-4%5B0%5D%20-%2010%20%E2%86%92%200%20%E2%89%A5%20-10)
☑
☑
Plus, the top inequality has a <em>dashed </em><em>line</em><em> </em>["<" or ">"], and the bottom inequality has a solid line, so this must have an equivalence line underneath each inequality symbol ["≤" or "≥"].
** Hold on though! Although it looks obvious about what the second inequality is, we need to double-check and make sure anyway, just to be on the safe side ☺:
From the y-intercept of ![\displaystyle [0, -2],](https://tex.z-dn.net/?f=%5Cdisplaystyle%20%5B0%2C%20-2%5D%2C)
we do 
by either moving four blocks <em>north</em><em> </em>over five blocks <em>west</em><em> </em>or four blocks <em>south</em><em> </em>over five blocks <em>east</em><em> </em>[<em>west</em> and <em>south</em> are negatives]. This IS what our solid graph looks like, so we are correct!
So, from all what was explained, you have your answer.
I am joyous to assist you anytime.
Answer:
a)125970
b)95040
c)35640
Step-by-step explanation:
a) selecting 12 player from 20 players can be one in 
= 
= 
= 
b) since each position has an identity permutations can be used so
Number of ways = 
= 
= 
= 
c) coach permutes 4 players for position other than centers in 
ways and selects center in 3 ways
so, number of ways = 
=
=
Hopes this helps:
Answer: 9
1. Simplify 1 + 2 to 3.
6 divided by 2 times 3
2. Simplify 6 divided by 2 to 3.
3 times 3
3. Simplify.
9
Answer:
root estimate = 1.75
error bound = 0.25
Step-by-step explanation:
f is a polynomial, so it is continuous in R (real numbers). Then you can use Bolzano's theorem.
f(0) = -3.1 < 0
f(2) = 4 - 3.1 = 0.9 > 0
Then there exists c in [0, 2], for which f(c) = 0
In the bisection method you generate a sequence 
of approximations of a root. If you have a bracketing interval [a, b], such that
f(a) and f(b) have opposite signs, then you use approximate the root as 
In this case:
Then:
The error bound is half the width of the interval [1.5, 2]
