Maths Olympiad Prep

Library / /686 of 740

, 2018

Combinatorics Difficulty 5.7 AIME, harder Prove it United States

Problem:

Crisp All, a basketball player, is dropping dimes and nickels on a number line. Crisp drops a dime on every positive multiple of 1010, and a nickel on every multiple of 55 that is not a multiple of 1010. Crisp then starts at 00. Every second, he has a 23\frac{2}{3} chance of jumping from his current location xx to x+3x+3, and a 13\frac{1}{3} chance of jumping from his current location xx to x+7x+7. When Crisp jumps on either a dime or a nickel, he stops jumping. What is the probability that Crisp stops on a dime?

Solution

Solution:

Let "a 3" mean a move in which Crisp moves from xx to x+3x+3, and "a 7" mean a move in which Crisp moves from xx to x+7x+7. Note that Crisp stops precisely the first time his number of 3's and number of 7's differs by a multiple of 55, and that he'll stop on a dime if they differ by 00, and stop on a nickel if they differ by 55. This fact will be used without justification.

We split into two cases:

a. Crisp begins with a 3. Rather than consider the integer Crisp is on, we'll count the difference, nn, between his number of 3's and his number of 7's. Each 3 increases nn by 11, and each 7 decreases nn by 11. Currently, nn is 11. The probability of stopping on a dime, then, is the probability nn reaches 00 before nn reaches 55, where nn starts at 11. Let aia_{i} be the probability nn reaches 00 first, given a current position of ii, for i=1,2,3,4i=1,2,3,4. We desire a1a_{1}. We have the system of linear equations
a1=23a2+131a2=23a3+13a1a3=23a4+13a2a4=230+13a3 \begin{aligned} a_{1} & =\frac{2}{3} a_{2}+\frac{1}{3} \cdot 1 \\ a_{2} & =\frac{2}{3} a_{3}+\frac{1}{3} a_{1} \\ a_{3} & =\frac{2}{3} a_{4}+\frac{1}{3} a_{2} \\ a_{4} & =\frac{2}{3} \cdot 0+\frac{1}{3} a_{3} \end{aligned}
From which we determine that a1=1531a_{1}=\frac{15}{31}.

b. Crisp begins with a 7. Now, let mm be the difference between his number of 7's and his number of 3's. Let bib_{i} denote his probability of stopping on a dime, given his current position of m=im=i. We desire b1b_{1}. We have the system of linear equations
b1=13b2+231b2=13b3+23b1b3=13b4+23b2b4=130+23b3 \begin{aligned} b_{1} & =\frac{1}{3} b_{2}+\frac{2}{3} \cdot 1 \\ b_{2} & =\frac{1}{3} b_{3}+\frac{2}{3} b_{1} \\ b_{3} & =\frac{1}{3} b_{4}+\frac{2}{3} b_{2} \\ b_{4} & =\frac{1}{3} \cdot 0+\frac{2}{3} b_{3} \end{aligned}
From which we determine that b1=3031b_{1}=\frac{30}{31}.

We conclude that the answer is 23a1+13b1=231531+133031=2031\frac{2}{3} a_{1}+\frac{1}{3} b_{1}=\frac{2}{3} \cdot \frac{15}{31}+\frac{1}{3} \cdot \frac{30}{31}=\frac{20}{31}.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.