Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "1994 AIME Problems/Problem 9"

(→‎Problem)
Line 15: Line 15:
  
 
[[Category:Intermediate Combinatorics Problems]]
 
[[Category:Intermediate Combinatorics Problems]]
 +
{{MAA Notice}}

Revision as of 18:28, 4 July 2013

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 $p/q,\,$ where $p\,$ and $q\,$ are relatively prime positive integers. Find $p+q.\,$

Solution

Let $P_k$ be the probability of emptying the bag when it has $k$ 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 $\frac {1}{2k - 1}$, then we have $k - 1$ pairs left. So this contributes probability $\frac {P_{k - 1}}{2k - 1}$.
  • Case 2. We draw a pair on the first and third cards. The second card is different from the first with probability $\frac {2k - 2}{2k - 1}$ and the third is the same as the first with probability $\frac {1}{2k - 2}$. We are left with $k - 1$ pairs but one card already drawn. However, having drawn one card doesn't affect the game, so this also contributes probability $\frac {P_{k - 1}}{2k - 1}$.
  • Case 3. We draw a pair on the second and third cards. This is pretty much the same as case 2, so we get $\frac {P_{k - 1}}{2k - 1}$.

Therefore, we obtain the recursion $P_k = \frac {3}{2k - 1}P_{k - 1}$. Iterating this for $k = 6,5,4,3,2$ (obviously $P_1 = 1$), we get $\frac {3^5}{11*9*7*5*3} = \frac {9}{385}$, and $p+q=\boxed{394}$.

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=1994_AIME_Problems/Problem_9&oldid=55018"