SOLUTION: A horse race has 12 entries. Assuming there are no ties, how many different ways can these horses finish first, second, and third?
Algebra ->
Permutations
-> SOLUTION: A horse race has 12 entries. Assuming there are no ties, how many different ways can these horses finish first, second, and third?
Log On
Question 1027696: A horse race has 12 entries. Assuming there are no ties, how many different ways can these horses finish first, second, and third? Answer by Alan3354(69443) (Show Source):
You can put this solution on YOUR website! A horse race has 12 entries. Assuming there are no ties, how many different ways can these horses finish first, second, and third?
============
1st is 1 of 12.
Then 1 of 11, then 1 of 10
----
= 12*11*10 = 1320 ways
