You need to determine the number of ways in which 30 competitors from 50 can qualify. First, you have to realize that the order is irrelevant, that is: it is the same competitor_1, competitor _2, competitor _3 than competitor_3, competitor_2, competitor_1, or any combination of those three competitors.
So, the number of ways is which 30 competitors from 50 can qualify is given by the formula of combinations, which is:
C (m,n) = m! / (n! * (m -n)! )
=> C (50,30) = 50! / (30! (50 - 30)! ) = (50!) / [30! (50 - 30)!] = 50! / [30! 20!] =
= 47,129,212,243,960 different ways the qualifiying round of 30 competitors can be selected from the 50 competitors.
Answer:
-90
Step-by-step explanation:
10+5×5×(-2)
10+25×(-2)
10+(-100)
10-100
-90
Answer:
x=-2
Step-by-step explanation:
Answer:
i am sorry but i am in 7th
Step-by-step explanation:
Answer:
f(x) = 0.25(5.25)ˣ
Step-by-step explanation:
In order to show exponential growth, the numbers must be positive and the base of the exponent must be larger than 1.
Think of it as a percentage. The base of the exponent will be the percentage of the original amount taken each time; if it is less than 1.00 then it would shrink. Larger than 1.00 will grow. The only one with positive numbers and a growth factor of greater than 1 is f(x) = 0.25(5.25)ˣ.