Maths Olympiad Prep

Library / /6 of 17

, 2021

Combinatorics Difficulty 5.0 AIME, harder Find the answer United States

Problem:

Teresa the bunny has a fair 8-sided die. Seven of its sides have fixed labels 1,2,,71, 2, \ldots, 7, and the label on the eighth side can be changed and begins as 11. She rolls it several times, until each of 1,2,,71, 2, \ldots, 7 appears at least once. After each roll, if kk is the smallest positive integer that she has not rolled so far, she relabels the eighth side with kk. The probability that 77 is the last number she rolls is ab\frac{a}{b}, where aa and bb are relatively prime positive integers. Compute 100a+b100a + b.

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

Solution:

Let n=7n = 7 and p=14p = \frac{1}{4}.
Let qkq_{k} be the probability that nn is the last number rolled, if kk numbers less than nn have already been rolled. We want q0q_{0} and we know qn1=1q_{n-1} = 1.
We have the relation
qk=(1p)kn1qk+[1(1p)k+1n1]qk+1 q_{k} = (1-p) \frac{k}{n-1} q_{k} + \left[1 - (1-p) \frac{k+1}{n-1}\right] q_{k+1}
This rearranges to
[1(1p)kn1]qk=[1(1p)k+1n1]qk+1 \left[1 - (1-p) \frac{k}{n-1}\right] q_{k} = \left[1 - (1-p) \frac{k+1}{n-1}\right] q_{k+1}
This means that the expression on the LHS does not depend on kk, so
[10]q0=[1(1p)]qn1=p [1-0] \cdot q_{0} = [1-(1-p)] \cdot q_{n-1} = p

Solution 2:

For a given sequence of Teresa's rolls, let xix_{i} be the iith distinct number rolled. We want to compute the probability that x7=7x_{7} = 7.
For a given index ii, we say that xix_{i} is correct if xix_{i} is the least positive integer not in {x1,,xi1}\{x_{1}, \ldots, x_{i-1}\}. Note that the probability of a given sequence x1,,x7x_{1}, \ldots, x_{7} depends only on the number of correct xix_{i}, since the probability of rolling the correct number on a given roll is higher by a factor of 22.
Now, suppose x7=7x_{7} = 7. Consider xi=xi1+1x_{i}' = x_{i-1} + 1 for 1<i71 < i \leq 7, and x1=1x_{1}' = 1. Note that this operation on sequences x1,,x7x_{1}, \ldots, x_{7} pairs sequences ending in 77 with sequences starting with 11. Additionally, we have that x7x_{7} and x1x_{1}' are both correct, and that xix_{i}' is correct if and only if xi1x_{i-1} is correct. Thus x1,,x7x_{1}, \ldots, x_{7} and x1,,x7x_{1}', \ldots, x_{7}' have the same probability.
So, we conclude that the probability of x7=7x_{7} = 7 is the same as the probability of x1=1x_{1} = 1. But this is just 14\frac{1}{4}.

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.