We know that
• The total is nine starters.
,• The coach wants to choose three.
Given that the player cannot include repetition, we solve this problem as a combination because the order does not matter.
Where n = 9, and r = 3. Let's replace these values.
Answer:
Step-by-step explanation:
This is permutation, since order matters. The formula for us is
₁₈P₅ = which simplifies to
₁₈P₅ =
The factorial of 13 cancels out on the top and bottom leaving you with
₁₈P₅ = 18 × 17 × 16 × 15 × 14
which comes to 1,028,160 ways
Another way to look at it is: the first 5 people of 18 finish and the others you don't care about. Once the first place person is first, there are only 4 of the 18 left to finish in second place. Then there are only 3 left to finish in third place, etc. So if we use that reasoning, we don't even need to use the formula, we can just say
18 * 17 * 16 * 15 * 14 and those are the first 5 people of 18 to finish.