Problem 12
Question
\(A\) and \(B\) throw a pair of dice. \(A\) wins if he throws 6 before \(B\) throws 7 and \(B\) wins if hethrows 7 before \(A\) throws 6 . If \(A\) begins, what is his chance of winning? (a) \(30 / 61\) [MNR 1995] (c) \(61 / 30\) (1) olution (a) Let \(E_{1}\) denote the event of \(A\) 's throwing 6 and \(E_{2}\) the event of \(B\) 's throwing 7 with a pair of dice. Then \(\bar{E}_{1}, \bar{E}_{2}\) are the complementary events. There are five ways of obtaining 6, namely, \((1,5),(2,4),(3,3),(4,2),(5,1)\) and similarly there are six ways of getting 7 , namely, \((1,6)\), \((2,5),(3,4),(4,3),(5,2),(6,1)\) $$ \therefore P\left(E_{1}\right)=\frac{5}{36} $$ and \(P\left(\bar{E}_{1}\right)=1-\frac{5}{36}=\frac{31}{36}\) $$ P\left(E_{2}\right)=\frac{6}{36}=\frac{1}{6} $$ and \(P\left(\bar{E}_{2}\right)=1-\frac{1}{6}=\frac{5}{6}\) It is given that \(A\) starts the game and he will win in the following mutually exclusive ways. (i) \(E_{1}\) happens, i.e., \(A\) wins at the first draw. (ii) \(\vec{E}_{1} \cap \bar{E}_{2} \cap E_{1}\) happens, i.e., \(A\) wins at the third draw when both \(A\) and \(B\) fail at \(1^{s t}\) and \(2^{\text {nd }}\) draw. (iii) \(\bar{E}_{1} \cap \bar{E}_{2} \cap \bar{E}_{1} \cap \bar{E}_{2} \cap E_{1}\) happens, i.e., \(A\) wins at the \(5^{\text {th }}\) draw when both \(A\) and \(B\) fail at \(1^{\text {st }}, 2^{\text {nd }}, 3^{\text {rd }}\) and \(4^{\text {th }}\) draw and so on \(\ldots\) Hence the required probability of \(A\) winning say \(P(A)\) is given by \(P(A)=P(\mathrm{i})+P(\mathrm{ii})+P(\mathrm{iii})\) \(+\ldots\)throws 7 before \(A\) throws 6 . If \(A\) begins, what is his chance of winning? (a) \(30 / 61\) [MNR 1995] (c) \(61 / 30\) (1) olution (a) Let \(E_{1}\) denote the event of \(A\) 's throwing 6 and \(E_{2}\) the event of \(B\) 's throwing 7 with a pair of dice. Then \(\bar{E}_{1}, \bar{E}_{2}\) are the complementary events. There are five ways of obtaining 6, namely, \((1,5),(2,4),(3,3),(4,2),(5,1)\) and similarly there are six ways of getting 7 , namely, \((1,6)\), \((2,5),(3,4),(4,3),(5,2),(6,1)\) $$ \therefore P\left(E_{1}\right)=\frac{5}{36} $$ and \(P\left(\bar{E}_{1}\right)=1-\frac{5}{36}=\frac{31}{36}\) $$ P\left(E_{2}\right)=\frac{6}{36}=\frac{1}{6} $$ and \(P\left(\bar{E}_{2}\right)=1-\frac{1}{6}=\frac{5}{6}\) It is given that \(A\) starts the game and he will win in the following mutually exclusive ways. (i) \(E_{1}\) happens, i.e., \(A\) wins at the first draw. (ii) \(\vec{E}_{1} \cap \bar{E}_{2} \cap E_{1}\) happens, i.e., \(A\) wins at the third draw when both \(A\) and \(B\) fail at \(1^{s t}\) and \(2^{\text {nd }}\) draw. (iii) \(\bar{E}_{1} \cap \bar{E}_{2} \cap \bar{E}_{1} \cap \bar{E}_{2} \cap E_{1}\) happens, i.e., \(A\) wins at the \(5^{\text {th }}\) draw when both \(A\) and \(B\) fail at \(1^{\text {st }}, 2^{\text {nd }}, 3^{\text {rd }}\) and \(4^{\text {th }}\) draw and so on \(\ldots\) Hence the required probability of \(A\) winning say \(P(A)\) is given by \(P(A)=P(\mathrm{i})+P(\mathrm{ii})+P(\mathrm{iii})\) \(+\ldots\)
Step-by-Step Solution
VerifiedKey Concepts
Geometric Series
For example, if you have a first term "a" and a common ratio "r", the sum of an infinite geometric series can be calculated using the formula: \( S = \frac{a}{1 - r} \). This formula applies when \(|r| < 1\), ensuring that the series converges to a finite sum.
In our problem, player A’s probability of winning involves repeating cycles of events (A failing, B failing, then A succeeding eventually). The common ratio, "r", encapsulates the cycle of failures before a success. As you can see, breaking probabilities into a sequence of geometric patterns helps simplify complex infinite outcomes.
Mutually Exclusive Events
In probabilistic terms, if events A and B are mutually exclusive, then \( P(A \cap B) = 0 \). For instance, in the problem with players A and B, the scenarios where A wins are mutually exclusive paths, such as winning immediately on the first roll or after one cycle of misses.
Each scenario is independent of the others, allowing us to add their probabilities directly to find the total probability of A winning. Understanding mutually exclusive events helps us isolate and calculate distinct paths leading to success in these probability games.
Combinatorics
In our dice-throwing scenario, we use combinatorics to determine the number of ways to achieve specific sums on a pair of dice. For example, there are 5 ways to sum to 6: \((1,5), (2,4), (3,3), (4,2), (5,1)\), and 6 ways to sum to 7: \((1,6), (2,5), (3,4), (4,3), (5,2), (6,1)\).
By calculating these combinations, we can derive the probabilities necessary for each event, providing a foundational tool for solving probability problems.
Probability of Complementary Events
The probability of complementary events helps fill in gaps when calculating complex probabilities by making use of the rule: \( P(\bar{E}) = 1 - P(E) \).
In our dice game, if \(E_1\) represents A throwing a 6, then \(\bar{E}_1\) is the event where A does not throw a 6. This complementary probability allows us to factor in misses and repeated turns until success, which is integral in setting up the geometric series for A’s continued play logic.