Difference between revisions of "Mock AIME 2 2006-2007 Problems/Problem 13"

Latest revision as of 09:59, 11 June 2024

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 1

Let the aces divide the 48 other cards into 5 "urns", with a, b, c, d, and e non-aces between each of these 4 dividers, 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}$

Solution 2 (sums)

Let the third ace be located in a certain deck position $m$ . Then there are ${m-1\choose2}$ ways to place the first and second aces behind the third ace and $52-m$ ways to place the fourth ace after the third ace. We can use a summation to express this concisely: $\sum_{k=3}^{51}{k-1\choose2}(k)(52-k)$ . This sum directly gives us the sum of all placements of all third aces between placements $3$ and $51$ , inclusive. Note that we cannot place a third ace in places $1,2,52$ , thus giving us the beginning and ending numbers for the summation. (The summation disregards suits and considers all aces to be the same. If we had regarded suits, we would have divided $4!$ by $4!$ at the end of the problem, so it would not have affected the end result.)

$\sum_{k=3}^{51}{k-1\choose2}(k)(52-k)=52\sum_{k=3}^{51}k{k-1\choose2}-\sum_{k=3}^{51}k^2{k-1\choose2}$

$=156\sum_{k=3}^{51}{k\choose3}-\sum_{k=3}^{51}\left((k+1)(k){k-1\choose2}-(k){k-1\choose2}\right)$

$=156\sum_{k=3}^{51}{k\choose3}-\sum_{k=3}^{51}(k+1)(k){k-1\choose2}+\sum_{k=3}^{51}(k){k-1\choose2}$

$=156\sum_{k=3}^{51}{k\choose3}-12\sum_{k=3}^{51}{k+1\choose4}+3\sum_{k=3}^{51}{k\choose3}$

$=159\sum_{k=3}^{51}{k\choose3}-12\sum_{k=3}^{51}{k+1\choose4}$

By the Hockey-Stick Identity, this simplifies nicely to $159{52\choose4}-12{53\choose5}$ .

The total number of ways to place the four aces (again, disregarding suits) is ${52\choose4}$ , so dividing the total sum by the total number of placements gives the answer.

$\frac{159{52\choose4}-12{53\choose5}}{{52\choose4}}=159-12\left(\frac{{53\choose5}}{{52\choose4}}\right)$

$=159-12\left(\frac{53!48!4!}{52!48!5!}\right)$

$=159-12\left(\frac{53}{5}\right)$

$=159-12\left(10\frac{3}{5}\right)$

$=159-12\cdot10-12\cdot\frac{3}{5}$

$=39-\frac{36}{5}$

$=31\frac{4}{5}$

$=\frac{159}{5}$ .

Thus the answer is $159+5=\boxed{164}$ .

~eevee9406

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?)

@@ Line 1: / Line 1: @@
 == Problem ==
-In his spare time, Richard Rusczyk shuffles a standard deck of <math>\displaystyle 52</math> 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 <math>\displaystyle \frac{m}{n},</math> where <math>m</math> and <math>n</math> are relatively prime positive integers, find <math>\displaystyle m+n.</math>
+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 <math>m/n,</math> where <math>m</math> and <math>n</math> are relatively prime positive integers, find <math>m+n.</math>
+==Solution 1==
+Let the aces divide the 48 other cards into 5 "urns", with a, b, c, d, and e non-aces between each of these 4 dividers, respectively.
+The position of the third ace is equal to <math>a+b+c+3</math>, and thus the expected value of its position is <math>E[a+b+c+3]</math>.
+By linearity of expectation, this is <math>E[a]+E[b]+E[c]+3</math>.
+Because the setup is symmetric between the five "urns", <math>E[a]=\ldots = E[e]</math>.
+Since these must add to <math>E[a+b+c+d+e]=48</math>, <math>E[a]=\ldots=E[e]= \frac{48}{5}</math>.
+The result is <math>3 \cdot \frac{48}{5} + 3 = \frac{159}{5} \implies \boxed{164}</math>
+==Solution 2 (sums)==
+Let the third ace be located in a certain deck position <math>m</math>. Then there are <math>{m-1\choose2}</math> ways to place the first and second aces behind the third ace and <math>52-m</math> ways to place the fourth ace after the third ace. We can use a [[summation]] to express this concisely: <math>\sum_{k=3}^{51}{k-1\choose2}(k)(52-k)</math>. This sum directly gives us the sum of all placements of all third aces between placements <math>3</math> and <math>51</math>, inclusive. Note that we cannot place a third ace in places <math>1,2,52</math>, thus giving us the beginning and ending numbers for the summation. (The summation disregards suits and considers all aces to be the same. If we had regarded suits, we would have divided <math>4!</math> by <math>4!</math> at the end of the problem, so it would not have affected the end result.)
+<math>\sum_{k=3}^{51}{k-1\choose2}(k)(52-k)=52\sum_{k=3}^{51}k{k-1\choose2}-\sum_{k=3}^{51}k^2{k-1\choose2}</math>
+<math>=156\sum_{k=3}^{51}{k\choose3}-\sum_{k=3}^{51}\left((k+1)(k){k-1\choose2}-(k){k-1\choose2}\right)</math>
+<math>=156\sum_{k=3}^{51}{k\choose3}-\sum_{k=3}^{51}(k+1)(k){k-1\choose2}+\sum_{k=3}^{51}(k){k-1\choose2}</math>
+<math>=156\sum_{k=3}^{51}{k\choose3}-12\sum_{k=3}^{51}{k+1\choose4}+3\sum_{k=3}^{51}{k\choose3}</math>
+<math>=159\sum_{k=3}^{51}{k\choose3}-12\sum_{k=3}^{51}{k+1\choose4}</math>
+By the [[Hockey-Stick Identity]], this simplifies nicely to <math>159{52\choose4}-12{53\choose5}</math>.
+The total number of ways to place the four aces (again, disregarding suits) is <math>{52\choose4}</math>, so dividing the total sum by the total number of placements gives the answer.
+<math>\frac{159{52\choose4}-12{53\choose5}}{{52\choose4}}=159-12\left(\frac{{53\choose5}}{{52\choose4}}\right)</math>
+<math>=159-12\left(\frac{53!48!4!}{52!48!5!}\right)</math>
+<math>=159-12\left(\frac{53}{5}\right)</math>
+<math>=159-12\left(10\frac{3}{5}\right)</math>
+<math>=159-12\cdot10-12\cdot\frac{3}{5}</math>
+<math>=39-\frac{36}{5}</math>
+<math>=31\frac{4}{5}</math>
+<math>=\frac{159}{5}</math>.
+Thus the answer is <math>159+5=\boxed{164}</math>.
+~eevee9406
+==See Also==
+{{Mock AIME box|year=2006-2007|n=2|num-b=12|num-a=14}}
 == Problem Source ==
-everwise enjoys playing and watching card games. In fact, he thought of this problem when watching Round 4 of the Professional Poker Tour. (Guy caught an Ace on the river.)
+everwise thought of this problem when watching Round 4 of the Professional Poker Tour. (What else can one do during the commercial breaks?) [[Image:Razz.gif]]

Mock AIME 2 2006-2007 (Problems, Source)
Preceded by Problem 12	Followed by Problem 14
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15

Page

Toolbox

Search