1994 AIME Problem 9

Attempt Problem 9 of the 1994 AIME below, then check your answer against the professionally curated solution from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 1994 AIME solutions, or check the answer key.

All problems are used with official legal permission of the Mathematical Association of America (MAA).

9.

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 pq,\frac{p}{q}, where pp and qq are relatively prime positive integers. Find p+q.p+q.

Answer: 394
Concepts:recursive probabilitysampling without replacementprocess simulation
Difficulty rating: 2460
Small Hint:

Track the number rr of unseen pairs and the number hh of unmatched tiles currently held

Big Hint:

From state (r,h)(r,h), the next tile either matches one of the hh held tiles or opens one of the rr unseen pairs

Solution:

Let F(r,h)F(r,h) be the chance of success with rr unseen pairs and h2h\leq2 unmatched tiles held. Among 2r+h2r+h remaining tiles, hh close an open pair and 2r2r open a new pair; the latter move fails when h=2.h=2. Thus F(r,h)=hF(r,h1)2r+h+2rF(r1,h+1)2r+h,\begin{aligned}F(r,h)&=\frac{hF(r,h-1)}{2r+h}\\&\quad+\frac{2rF(r-1,h+1)}{2r+h},\end{aligned} omitting the second term when h=2,h=2, with F(0,h)=1.F(0,h)=1. Evaluating this three-state recursion gives F(r,0):1, 1, 35, 935,335, 9385\begin{aligned}F(r,0):\quad&1,\ 1,\ \frac35,\ \frac9{35},\\&\frac3{35},\ \frac9{385}\end{aligned} for r=1,2,,6.r=1,2,\ldots,6. Hence pq=9385\frac{p}{q}=\frac{9}{385} and p+q=394.p+q=394.

← Problem 8#8
Full Exam

Problem 9 in Other Years