A and B alternately throw a pair of dice. A wins if he throws a sum of before B throws a sum of , and B wins if he throws a sum of before A throws a sum of . The probability that A wins if A makes the first throw is:
- A
- B
- C
- D
A and B alternately throw a pair of dice. A wins if he throws a sum of before B throws a sum of , and B wins if he throws a sum of before A throws a sum of . The probability that A wins if A makes the first throw is:
Correct answer:B
Standard Method
Given: A and B alternately throw a pair of dice. A wins on getting sum and B wins on getting sum . A starts first.
Find: The probability that A wins.
For one throw of two dice, the total number of outcomes is
The number of outcomes giving sum is , so
The number of outcomes giving sum is , so
If A does not win on his turn and B also does not win on his turn, the game returns to the same starting situation. Thus,
where is the probability that A wins when A starts first.
Now simplify:
So,
Therefore, the probability that A wins is . The correct option is B.
The first approach shown in the working contains an inconsistent intermediate equation, but the stated final answer and the second approach both give .
Geometric Series Method
Given: A wins by throwing sum , and B wins by throwing sum .
Find: Probability that A wins when he throws first.
Let
For A to win, either he wins on the first throw, or both fail once and the process repeats.
Hence,
This is a geometric series with first term and common ratio
Therefore,
Therefore, the probability that A wins is .
Using as the probability that both players fail in one round is incorrect. A failing to get sum has probability , and B failing to get sum has probability . Multiply these to reset the game state correctly.
Adding the probabilities of A getting and B getting in the same throw structure is wrong because they occur on different turns, not in a single combined experiment. Treat the game as alternating stages, not one simultaneous event.
Stopping at is incomplete. If both players fail in the first cycle, the game starts again under the same conditions, so a recursive equation or infinite geometric series is necessary.
Get unlimited AI-adaptive practice, mastery tracking, and an AI tutor that explains every step — free to start.