Answer:
1320 ways
Step-by-step explanation:
To solve we need to use permutations and factorials. If we wanted to find where they would all place 1-12, we would do 12!
12! is the same as 12x11x10x9x8... etc
But in this problem, we are only looking for the top 3.
We can set up a formula
[tex]\frac{n!}{(n-r)!}[/tex]
N is the number of options that are available and r represents the amount we are choosing
In this case, we have 12 teams so n=12
We are looking for the top 3 so r=3
[tex]\frac{12!}{(12-3)!}[/tex]
[tex]\frac{12!}{9!}[/tex]
We expand the equation and cancel out
[tex]\frac{12x11x10x9x8x7x6x5x4x3x2}{9x8x7x6x5x4x3x2}[/tex]
Notice how both sides can cancel out every number 9 and below
That leaves us with 12x11x10
1320 ways
