SOLUTION: In a race in which twelve automobiles are entered and there are no​ ties, in how many ways can the first three finishers come​ in?
Algebra ->
Permutations
-> SOLUTION: In a race in which twelve automobiles are entered and there are no​ ties, in how many ways can the first three finishers come​ in?
Log On
You can put this solution on YOUR website! Order matters here because 1-3-6 is different
from 1-6-3
That means you use permutations and not combinations
P( 12,3 ) = different ways
