2009 AIME II Problems/Problem 8
Dave rolls a fair six-sided die until a six appears for the first time. Independently, Linda rolls a fair six-sided die until a six appears for the first time. Let and be relatively prime positive integers such that is the probability that the number of times Dave rolls his die is equal to or within one of the number of times Linda rolls her die. Find .
There are many almost equivalent approaches that lead to summing a geometric series. For example, we can compute the probability of the opposite event. Let be the probability that Dave will make at least two more throws than Linda. Obviously, is then also the probability that Linda will make at least two more throws than Dave, and our answer will therefore be .
How to compute ?
Suppose that Linda made exactly throws. The probability that this happens is , as she must make unsuccessful throws followed by a successful one. In this case, we need Dave to make at least throws. This happens iff his first throws are unsuccessful, hence the probability is .
Thus for a fixed the probability that Linda makes throws and Dave at least throws is .
Then, as the events for different are disjoint, is simply the sum of these probabilities over all . Hence:
Hence the probability we were supposed to compute is , and the answer is .
Let be the probability that the number of times Dave rolls his die is equal to or within one of the number of times Linda rolls her die. (We will call this event "a win", and the opposite event will be "a loss".)
Let both players roll their first die.
With probability , both throw a six and we win.
With probability exactly one of them throws a six. In this case, we win iff the remaining player throws a six in their next throw, which happens with probability .
Finally, with probability none of them throws a six. Now comes the crucial observation: At this moment, we are in exactly the same situation as in the beginning. Hence in this case we will win with probability .
We just derived the following linear equation:
Solving for , we get , hence the answer is .
|2009 AIME II (Problems • Answer Key • Resources)|
|1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15|
|All AIME Problems and Solutions|