Difference between revisions of "2018 AIME II Problems/Problem 13"

(Solution)
Line 3: Line 3:
 
Misha rolls a standard, fair six-sided die until she rolls 1-2-3 in that order on three consecutive rolls. The probability that she will roll the die an odd number of times is <math>\dfrac{m}{n}</math> where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
 
Misha rolls a standard, fair six-sided die until she rolls 1-2-3 in that order on three consecutive rolls. The probability that she will roll the die an odd number of times is <math>\dfrac{m}{n}</math> where <math>m</math> and <math>n</math> are relatively prime positive integers. Find <math>m+n</math>.
  
==Solution==
+
==Solution 1==
  
 
Call the probability you win on a certain toss <math>f_n</math>, where <math>n</math> is the toss number.
 
Call the probability you win on a certain toss <math>f_n</math>, where <math>n</math> is the toss number.
Line 15: Line 15:
 
Finally, substituting <math>x=\frac{1}{216}</math>, we find that <math>P=\frac{216}{431}</math>, giving us a final answer of <math>216 + 431 = \boxed{647}</math>.
 
Finally, substituting <math>x=\frac{1}{216}</math>, we find that <math>P=\frac{216}{431}</math>, giving us a final answer of <math>216 + 431 = \boxed{647}</math>.
 
--DanDan0101
 
--DanDan0101
 +
 +
==Solution 2 (Recursion)==
 +
Let <math>S(n)</math> be the number of strings of length <math>n</math> containing the digits <math>1</math> through <math>6</math> that do not contain the string <math>123</math>. Then we have <math>S(n) = 6 \cdot S(n-1) - S(n-3)</math> because we can add any digit to end of a string with length <math>n-1</math> but we have to subtract all the strings that end in <math>123</math>. We rewrite this as
 +
\begin{align*}
 +
S(n) &= 6 \cdot S(n-1) - S(n-3) \ &= 6 \cdot (6 \cdot S(n-2) - S(n-4)) - (6 \cdot (S(n-4) - S(n-6)) \ &= 36 \cdot S(n-2) - 12 \cdot S(n-4) + S(n-6)
 +
\end{align*}wish to compute <math>P=\sum_{n=0}^\infty \frac{S(2n)}{6^{2n+3}}</math> since the last three rolls are <math>123</math> for the game to end. Summing over the recursion, we obtain
 +
<cmath>\sum_{n=0}^\infty \frac{S(2n)}{6^{2n+3}} =36 \cdot \sum_{n=0}^\infty \frac{S(2n-2)}{6^{2n+3}} - 12 \cdot  \sum_{n=0}^\infty \frac{S(2n-4)}{6^{2n+3}}+ \sum_{n=0}^\infty \frac{S(2n-6)}{6^{2n+3}}  </cmath>Now shift the indices so that the inside term is the same:
 +
\begin{align*}
 +
\sum_{n=3}^\infty  \frac{S(2n)}{6^{2n+3}} &= \frac{36}{6^2} \cdot \sum_{n=2}^\infty \frac{S(2n)}{6^{2n+3}} - \frac{12}{6^4} \cdot \sum_{n=1}^\infty \frac{S(2n)}{6^{2n+3}} + \frac{1}{6^6} \cdot \sum_{n=0}^\infty \frac{S(2n)}{6^{2n+3}}  \  \left(P - \frac{S(0)}{6^3} -  \frac{S(2)}{6^5} -\frac{S(4)}{6^7}  \right) &= \frac{36}{6^2} \cdot \left( P -  \frac{S(0)}{6^3} -  \frac{S(2)}{6^5}\right) - \frac{12}{6^4} \cdot \left(  P - \frac{S(0)}{6^3} \right) + \frac{1}{6^6} \cdot P
 +
\end{align*}Note that <math>S(0) = 1, S(2) = 26</math> and <math>S(4) = 6^4 - 2 \cdot 6 = 1284</math>. Therefore,
 +
\begin{align*}
 +
\left(P - \frac{1}{6^3} -  \frac{36}{6^5} -\frac{1284}{6^7}  \right) = \frac{36}{6^2} \cdot \left( P -  \frac{1}{6^3} -  \frac{36}{6^5}\right) - \frac{12}{6^4} \cdot \left(  P - \frac{1}{6^3} \right) + \frac{1}{6^6} \cdot P 
 +
\end{align*}Solving for <math>P</math>, we obtain <math>P = \frac{216}{431} \implies m+n = \boxed{647}</math>. -Vfire
 +
 +
  
 
{{AIME box|year=2018|n=II|num-b=12|num-a=14}}
 
{{AIME box|year=2018|n=II|num-b=12|num-a=14}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 07:29, 26 March 2018

Problem

Misha rolls a standard, fair six-sided die until she rolls 1-2-3 in that order on three consecutive rolls. The probability that she will roll the die an odd number of times is $\dfrac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Solution 1

Call the probability you win on a certain toss $f_n$, where $n$ is the toss number. Obviously, since the sequence has length 3, $f_1=0$ and $f_2=0$. Additionally, $f_3=\left(\frac{1}{6}\right)^3$. We can call this value $x$, to keep our further equations looking clean. We can now write our general form for $f$ as $f_n=x(1-\sum_{i=1}^{n-3}f_i)$. This factors the probability of the last 3 rolls being 1-2-3, and the important probability that the sequence has not been rolled in the past (because then the game would already be over). Note that $\sum_{i=1}^{\infty}f_i=1$ since you'll win at some point. An intermediate step here is figuring out $f_n-f_{n+1}$. This is equal to $x(1-\sum_{i=1}^{n-3}f_i)-x(1-\sum_{i=1}^{n-2}f_i)=x(\sum_{i=1}^{n-2}f_i-\sum_{i=1}^{n-3}f_i)=xf_{n-2}$. Adding up all the differences, i.e. $\sum_{i=2}^{\infty}(f_{2n-1}-f_{2n})$ will give us the amount by which the odds probability exceeds the even probability. Since they sum to 1, that means the odds probability will be half of the difference above one-half. Subbing in our earlier result from the intermediate step, the odd probability is equal to $\frac{1}{2}+\frac{1}{2}x\sum_{i=2}^{\infty}f_{2n-3}$. Another way to find the odd probability is simply summing it up, which turns out to be $\sum_{i=1}^{\infty}f_{2n-1}$. Note the infinite sums in both expressions are equal; let's call it $P$. Equating them gives $\frac{1}{2}+\frac{1}{2}xP=P$, or $P=\frac{1}{2-x}$. Finally, substituting $x=\frac{1}{216}$, we find that $P=\frac{216}{431}$, giving us a final answer of $216 + 431 = \boxed{647}$. --DanDan0101

Solution 2 (Recursion)

Let $S(n)$ be the number of strings of length $n$ containing the digits $1$ through $6$ that do not contain the string $123$. Then we have $S(n) = 6 \cdot S(n-1) - S(n-3)$ because we can add any digit to end of a string with length $n-1$ but we have to subtract all the strings that end in $123$. We rewrite this as S(n)=6S(n1)S(n3)=6(6S(n2)S(n4))(6(S(n4)S(n6))=36S(n2)12S(n4)+S(n6)wish to compute $P=\sum_{n=0}^\infty \frac{S(2n)}{6^{2n+3}}$ since the last three rolls are $123$ for the game to end. Summing over the recursion, we obtain \[\sum_{n=0}^\infty \frac{S(2n)}{6^{2n+3}} =36 \cdot \sum_{n=0}^\infty \frac{S(2n-2)}{6^{2n+3}} - 12 \cdot  \sum_{n=0}^\infty \frac{S(2n-4)}{6^{2n+3}}+ \sum_{n=0}^\infty \frac{S(2n-6)}{6^{2n+3}}\]Now shift the indices so that the inside term is the same: n=3S(2n)62n+3=3662n=2S(2n)62n+31264n=1S(2n)62n+3+166n=0S(2n)62n+3(PS(0)63S(2)65S(4)67)=3662(PS(0)63S(2)65)1264(PS(0)63)+166PNote that $S(0) = 1, S(2) = 26$ and $S(4) = 6^4 - 2 \cdot 6 = 1284$. Therefore, (P1633665128467)=3662(P1633665)1264(P163)+166PSolving for $P$, we obtain $P = \frac{216}{431} \implies m+n = \boxed{647}$. -Vfire


2018 AIME II (ProblemsAnswer KeyResources)
Preceded by
Problem 12
Followed by
Problem 14
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