2017 AMC 10A Problem 18
Amelia has a coin that lands heads with probability , and Blaine has a coin that lands on heads with probability . Amelia and Blaine alternately toss their coins until someone gets a head; the first one to get a head wins. All coin tosses are independent. Amelia goes first. The probability that Amelia wins is , where and are relatively prime positive integers. What is ?
Show solution without answering
Key insight
If both players miss in a round (chance 2/5), the game starts over. So Amelia's chance P satisfies P = 1/3 + (2/5)P.
Solution
The game could go on for many rounds, but each round starts the same way: Amelia is about to toss. Use that.
1. Name the answer. Let be the chance that Amelia wins, starting from a moment when she is about to toss.
2. Look at one round.
- Amelia gets heads right away: chance . She wins.
- Amelia gets tails (chance ), then Blaine gets heads (chance ). Amelia loses.
- Amelia gets tails (chance ), then Blaine gets tails (chance ). Nobody has won, and Amelia is about to toss again, exactly as at the start. From here her chance is again.
3. The chance that both miss is .
4. Write one equation. Amelia wins either now, or after a double miss:
5. Solve. Subtract from both sides: . Multiply by : .
6. and share no common factor, so , , and .
The answer is .
Why this works
In "keep going until someone succeeds" games, a round where nobody succeeds puts you right back at the start. That means the unknown chance appears on both sides of one equation, and you can solve it without adding up endless rounds. As a check, Blaine's chance is .
Alternative approach
Add up the rounds. Amelia wins in round with chance . She wins in round if both missed once first: . In round : , and so on. Each term is of the one before, so the total is
Concise solution
A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.
Let be the probability that Amelia wins from the start of a round (Amelia about to toss).
In the first round, Amelia wins immediately with probability . Otherwise (probability ) Blaine tosses; if he gets heads (probability ) Amelia loses, and if he gets tails (probability ) the game is back exactly where it started, so Amelia wins from there with probability again.
Therefore
Solving, , so .
Thus , , and .
The answer is .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 8: Basic Probability Techniques (§8.5)
- Introduction to Counting & Probability, Chapter 7: Introduction to Probability
- Intermediate Counting & Probability, Chapter 10: Recursion
- Intermediate Counting & Probability, Chapter 11: Conditional Probability
Similar problems
Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.