2005 AIME II Problems/Problem 2
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
Use construction. We need only calculate the probability the first and second person all get a roll of each type, since then the rolls for the third person are determined.
- Person 1:
- Person 2:
- Person 3: One roll of each type is left, so the probability here is .
Our answer is thus , and .
Call the three different types of rolls as A, B, and C. We need to arrange 3As, 3Bs, and 3Cs in a string such that A, B, and C appear in the first three, second three, and the third three like ABCABCABC or BCABACCAB. This can occur in different manners. The total number of possible strings is . The solution is therefore , and .
The denominator of m/n is equal to the total amount of possible roll configurations given to the three people. This is equal to as the amount of ways to select three rolls out of 9 to give to the first person is , and three rolls out of 6 is . After that, the three remaining rolls have no more configurations.
The numerator is the amount of ways to give one roll of each type to each of the three people, which can be done by defining the three types of rolls as x flavored, y flavored, and z flavored.
xxx, yyy, zzz
So you have to choose one x, one y, and one z to give to the first person. There are 3 xs, 3 ys, and 3 zs to select from, giving combinations. Multiply that by the combinations of xs, ys, and zs for the second person, which is evidently since there are two of each letter left.
simplifies down to our fraction m/n, which is . Adding them up gives .
|2005 AIME II (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15|
|All AIME Problems and Solutions|