Teresa the bunny has a fair 8-sided die. Seven of its sides have fixed labels , and the label on the eighth side can be changed and begins as . She rolls it several times, until each of appears at least once. After each roll, if is the smallest positive integer that she has not rolled so far, she relabels the eighth side with . The probability that is the last number she rolls is , where and are relatively prime positive integers. Compute .
Problem 1087
Official solution
Solution:
Let and .
Let be the probability that is the last number rolled, if numbers less than have already been rolled. We want and we know .
We have the relation
This rearranges to
This means that the expression on the LHS does not depend on , so
Solution 2:
For a given sequence of Teresa's rolls, let be the th distinct number rolled. We want to compute the probability that .
For a given index , we say that is correct if is the least positive integer not in . Note that the probability of a given sequence depends only on the number of correct , since the probability of rolling the correct number on a given roll is higher by a factor of .
Now, suppose . Consider for , and . Note that this operation on sequences pairs sequences ending in with sequences starting with . Additionally, we have that and are both correct, and that is correct if and only if is correct. Thus and have the same probability.
So, we conclude that the probability of is the same as the probability of . But this is just .