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.
So that equation was definitely correct...
When you expand the equation in the bracket you'll find out that you'll get a^6 + 4a^4 + !6a^2 - 4a^4 - 16a^2 -64. then your final result will be a^6 - 64
<span />
The largest possible value of b is 10, since for some x = x₀ it could be the case that f(x₀) = -5 and g(x₀) = -2; then f(x₀) g(x₀) = -5 × -2 = 10.
I think this is it,please try and looking it up also for a better explanation
75% I think.
because if you do 560 - 420 you get 140.
140 / 560 x 100 = 25
which means there is a 25% decrease, so they took 75%.
