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.Com
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
RELATED QUESTIONS
A horse race has 12 entries and one person owns 3 of those horses. Assuming that there... (answered by robertb)
A horse race has 12 entries. Assuming that there are no ties, what is the probability... (answered by ikleyn)
A horse race has 11
entries and one person owns 3
of those horses. Assuming that... (answered by Boreal)
Please do show me how did you solve it
Find the Number of Ways of Selecting 4... (answered by Alan3354,Theo)
A horse race has 12 entries and one person owns 5 of those horses. Assuming that there... (answered by richwmiller)
A horse race has 11 entries and one person owns 4 of those horses. Assuming that there... (answered by Theo)
A horse race has 11 entries and one person owns 4 of those horses. Assuming that there... (answered by robertb,ikleyn)
A horse race has 10 entries and one person owns 3 of those horses assuming their are no... (answered by stanbon)
Could you please tell me what I did wrong with this problem?
A horse race has 12... (answered by josmiceli)