Answer:
1771 possible ways
Step-by-step explanation:
In this case, we need to know first how many candidates are in total:
10 + 3 + 10 = 23 candidates in total.
Now, we need to choose 3 of them to receive an award. In this case, we have several scenarios, but as it's an award we can also assume that the order in which the candidates are chosen do not matter, so, the formula to use is the following:
C = m! / n! (m - n)!
Where m is the total candidates and n, is the number of candidates to be chosen. Replacing this data we have:
C = 23! / 3! (23 - 3)!
C = 2.59x10^22 / 6(2.43x10^18)
C = 1771
So we have 1771 ways of choose the candidates.
First simplify <span>t^2-t-12, which becomes (t-4)(t+3)
now you can rewrite the expression as one term; (t-4)(t+3)(t+1)/(t+1)(t+3)
cancel out (t+3) and (t+1) which leaves the answer as (t-4)</span>
Ahh, i can see youre doing some programming. In C++ this output is -10
So -10
Answer:
1/81
Step-by-step explanation:
