Difference between revisions of "2005 AIME II Problems/Problem 2"
Ragnarok23 (talk | contribs) |
(→Problem) |
||
| Line 1: | Line 1: | ||
== Problem == | == Problem == | ||
| − | + | A hotel packed breakfast for each of three guests. Each breakfast should have consisted of three types of rolls, one each of nut, cheese, and fruit rolls. The preparer wrapped each of the nine rolls and once wrapped, the rolls were indistinguishable from one another. She then randomly put three rolls in a bag for each of the guests. Given that the probability each guest got one roll of each type is <math> \frac mn, </math> where <math> m </math> and <math> n </math> are relatively prime integers, find <math> m+n. </math> | |
| + | |||
== Solution == | == Solution == | ||
== See Also == | == See Also == | ||
*[[2005 AIME II Problems]] | *[[2005 AIME II Problems]] | ||
Revision as of 22:17, 8 July 2006
Problem
A hotel packed breakfast for each of three guests. Each breakfast should have consisted of three types of rolls, one each of nut, cheese, and fruit rolls. The preparer wrapped each of the nine rolls and once wrapped, the rolls were indistinguishable from one another. She then randomly put three rolls in a bag for each of the guests. Given that the probability each guest got one roll of each type is 
where 
and 
are relatively prime integers, find 
