Mock AIME 2 2006-2007 Problems/Problem 13

Problem

In his spare time, Richard Rusczyk shuffles a standard deck of 52 playing cards. He then turns the cards up one by one from the top of the deck until the third ace appears. If the expected (average) number of cards Richard will turn up is $m/n,$ where $m$ and $n$ are relatively prime positive integers, find $m+n.$

Solution

Let the aces divide the 48 other cards into 5 "urns", with a, b, c, d, and e aces in them, respectively.

The position of the third ace is equal to a+b+c+3, and thus the expected value of its position is $E[a+b+c+3]$.

By linearity of expectation, this is $E[a]+E[b]+E[c]+3$.

Because the setup is symmetric between the five "urns", $E[a]=\ldots = E[e]$.

Since these must add to $E[a+b+c+d+e]=48$, $E[a]=\ldots=E[e]= \frac{48}{5}$.

The result is $3 \cdot \frac{48}{5} + 3 = \frac{159}{5} \implies \boxed{164}$

Problem Source

4everwise thought of this problem when watching Round 4 of the Professional Poker Tour. (What else can one do during the commercial breaks?)
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 10, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}