Answer:
No, it' snot a solution
Step-by-step explanation:
x − 2 ≥ −1.6
x - 2 + 2 ≥ -1.6 + 2
x ≥ 0.4
Answer:
3/4
Step-by-step explanation:
Answer:
C (11.3) = 165
P (3,3) = 6
Step-by-step explanation:
We want to select 3 players out of 11 regardless of the order. That is, there is no difference between selecting the players {2,5,7} or {7,2,5}
Then we use the formula of combinations:
![C(n, r) = \frac{n!}{r!(n-r)!}\\\\C(11, 3) = \frac{n!}{r!(n-r)!}\\\\C(11, 3) = 165](https://tex.z-dn.net/?f=C%28n%2C%20r%29%20%3D%20%5Cfrac%7Bn%21%7D%7Br%21%28n-r%29%21%7D%5C%5C%5C%5CC%2811%2C%203%29%20%3D%20%5Cfrac%7Bn%21%7D%7Br%21%28n-r%29%21%7D%5C%5C%5C%5CC%2811%2C%203%29%20%3D%20165)
There are 165 ways to choose 3 players out of 11.
Now we want to know how many ways you can designate those 3 players as first, second and third. Now if we care about the order of selection. Then we use permutations.
![P(n, r) = \frac{n!}{(n-r)!}\\\\P(3,3) = \frac{3!}{(3-3)!}\\\\P(3,3) = 6](https://tex.z-dn.net/?f=P%28n%2C%20r%29%20%3D%20%5Cfrac%7Bn%21%7D%7B%28n-r%29%21%7D%5C%5C%5C%5CP%283%2C3%29%20%3D%20%5Cfrac%7B3%21%7D%7B%283-3%29%21%7D%5C%5C%5C%5CP%283%2C3%29%20%3D%206)
They can be designated in 6 different ways
80000000000000000p0000000000
Answer:
can u please provide us with the graph so that we can help u
Step-by-step explanation: