1994 AIME Problems/Problem 9
Contents
Problem
A solitaire game is played as follows. Six distinct pairs of matched tiles are placed in a bag. The player randomly draws tiles one at a time from the bag and retains them, except that matching tiles are put aside as soon as they appear in the player's hand. The game ends if the player ever holds three tiles, no two of which match; otherwise the drawing continues until the bag is empty. The probability that the bag will be emptied is where and are relatively prime positive integers. Find
Solution
Let be the probability of emptying the bag when it has pairs in it. Let's consider the possible draws for the first three cards:
- Case 1. We draw a pair on the first two cards. The second card is the same as the first with probability , then we have pairs left. So this contributes probability .
- Case 2. We draw a pair on the first and third cards. The second card is different from the first with probability and the third is the same as the first with probability . We are left with pairs but one card already drawn. However, having drawn one card doesn't affect the game, so this also contributes probability .
- Case 3. We draw a pair on the second and third cards. This is pretty much the same as case 2, so we get .
Therefore, we obtain the recursion . Iterating this for (obviously ), we get , and .
Solution 2
Call the case that we begin with [ABCDEF]. It doesn't matter what letter we choose at first, so WLOG assume we choose A. Now there is BCDEFABCDEF remaining in the bag. We have two cases to consider here.
1. We pick the other A. There's a chance for this to happen. We remain with the case [BCDEF] if this is the case.
2. We pick any other letter that is not an A. There's a chance for this to happen. WLOG, assume we pick the letter B. Now in order for us to continue the game, we must choose either the other A or B. There's a chance for this to happen. WLOG, assume we choose A. Now we have BCDEFCDEF left.
Notice however that in the first case, the probability of emptying the bag with [BCDEF] is the same thing as with BCDEFCDEF, as the only difference is you've removed one of the letters (and it doesn't matter which you chose).
Hence for this case, there is a * [BCDEF] chance to empty the bag.
Continuing this process, we get that:
[BCDEF] = * [CDEF]
[CDEF] = * [DEF]
[DEF] = * [EF]
[EF] = 1 (clearly, since if we are only left with EFEF then we are going to empty the bag).
And hence [ABCDEF] = so our answer is
See also
1994 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 8 |
Followed by Problem 10 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.