Class 12 Maths, Worked in Full Past papersGet updates
Chapter 13 · Probability

Miscellaneous · Q10: Ball moved between bags: the moved ball was black, P=1631P = \frac{16}{31}

Miscellaneous ExerciseBayes' theorem · Section 13.5
The question

Bag I contains 3 red and 4 black balls and Bag II contains 4 red and 5 black balls. One ball is transferred from Bag I to Bag II and then a ball is drawn from Bag II. The ball so drawn is found to be red in colour. Find the probability that the transferred ball is black.

Exam answer

Let E1E_1⁠: the transferred ball is red, E2E_2⁠: the transferred ball is black, and AA⁠: the ball drawn from Bag II is red.

E1E_1 and E2E_2 form a partition of the sample space (the transferred ball is either red or black).

Bag I has 3 red and 4 black balls, so P(E1)=37P(E_1) = \frac37 and P(E2)=47P(E_2) = \frac47⁠.

If E1E_1 occurs, Bag II has 5 red and 5 black balls, so P(A∣E1)=510P(A|E_1) = \frac{5}{10}⁠.

If E2E_2 occurs, Bag II has 4 red and 6 black balls, so P(A∣E2)=410P(A|E_2) = \frac{4}{10}⁠.

By the theorem of total probability,

P(A)=P(E1)P(A∣E1)+P(E2)P(A∣E2)=37⋅510+47⋅410=1570+1670=3170\begin{aligned} P(A) &= P(E_1)P(A|E_1) \\ &\quad + P(E_2)P(A|E_2) \\ &= \frac37\cdot\frac{5}{10} + \frac47\cdot\frac{4}{10} \\ &= \frac{15}{70} + \frac{16}{70} = \frac{31}{70} \end{aligned}

By Bayes' theorem,

P(E2∣A)=P(E2)P(A∣E2)P(A)=1670÷3170=1670×7031\begin{aligned} P(E_2|A) &= \frac{P(E_2)P(A|E_2)}{P(A)} \\ &= \frac{16}{70} \div \frac{31}{70} \\ &= \frac{16}{70} \times \frac{70}{31} \end{aligned}

∴\therefore The probability that the transferred ball is black is 1631\dfrac{16}{31}⁠.

Want the reason behind every step, the basics and the checks?

The one idea this problem is built on

The colour of the moved ball is hidden, but it changes Bag II: a red ball moved makes a red draw more likely (5 in 10), a black ball moved makes it less likely (4 in 10). Black is more likely to be moved in the first place (4 in 7). Bayes' theorem weighs these two effects against each other, and black still comes out slightly ahead: 1631\frac{16}{31}⁠.

Given, to find, and the plan
Given
Bag I: 3 red, 4 black. Bag II: 4 red, 5 black. One ball is moved at random from Bag I to Bag II; then a ball is drawn at random from Bag II, and it is red.
To find
P(the transferred ball is black | the drawn ball is red) =P(E2∣A)= P(E_2|A)⁠.
Plan
(1) Name the events; check the partition. (2) Find P(E1)P(E_1)⁠, P(E2)P(E_2) from Bag I. (3) Find the new contents of Bag II in each case, and P(A∣E1)P(A|E_1)⁠, P(A∣E2)P(A|E_2)⁠. (4) Total probability. (5) Bayes' theorem.

Basics you need

1Classical probability

A ball drawn at random from a bag is red with probability red ballsall balls\frac{\text{red balls}}{\text{all balls}}⁠. Basics: P(E) = n(E)/n(S)

2Conditional probability (Section 13.2)

The chance of drawing red from Bag II depends on what was moved: P(A∣E1)P(A|E_1) and P(A∣E2)P(A|E_2) are different. Lesson: conditional probability

3Total probability and Bayes' theorem (Section 13.5)

P(A)=∑P(Ei)P(A∣Ei)P(A) = \sum P(E_i)P(A|E_i) and P(E2∣A)=P(E2)P(A∣E2)P(A)P(E_2|A) = \frac{P(E_2)P(A|E_2)}{P(A)}⁠. Lesson: Bayes' theorem

4Tree diagrams

First branch: colour moved; second branch: colour drawn. Basics: tree diagrams

Solution

  1. Name the events

    Let

    • E1E_1⁠: the transferred ball is red;
    • E2E_2⁠: the transferred ball is black;
    • AA⁠: the ball drawn from Bag II is red.

    E1E_1 and E2E_2 form a partition of the sample space: Bag I holds only red and black balls, so the moved ball is exactly one of the two colours.

    The colour moved is the hidden cause; the red draw is what we see. The question asks for the cause given what we see, so this is a Bayes' theorem problem.
    Partition of a sample space (Section 13.5.1). Lesson: Bayes' theorem
  2. The first stage: which ball is moved

    Bag I has 3+4=73 + 4 = 7 balls, so

    P(E1)=37,P(E2)=47.\begin{aligned} P(E_1) &= \frac37, \\ P(E_2) &= \frac47. \end{aligned}
    The ball is chosen at random from Bag I, so each of its 7 balls is equally likely to be moved.
    P(E)=n(E)n(S)P(E) = \frac{n(E)}{n(S)}⁠. Basics: classical probability
  3. The second stage: Bag II after the move

    Bag II had 4 red and 5 black balls, 9 in all; after the move it has 10.

    • If a red ball was moved (E1E_1⁠): 5 red, 5 black, so P(A∣E1)=510P(A|E_1) = \frac{5}{10}⁠.
    • If a black ball was moved (E2E_2⁠): 4 red, 6 black, so P(A∣E2)=410P(A|E_2) = \frac{4}{10}⁠.
    The moved ball joins Bag II before the draw, so it must be counted. Forgetting it would give 49\frac49 in both cases, and then the draw would tell us nothing about the moved ball.
    Conditional probability: the bag's contents are known in each case. Lesson: conditional probability
  4. The chance of a red draw: total probability

    Since E1E_1 and E2E_2 form a partition, by the theorem of total probability

    P(A)=P(E1)P(A∣E1)+P(E2)P(A∣E2)=37⋅510+47⋅410=1570+1670=3170.\begin{aligned} P(A) &= P(E_1)P(A|E_1) \\ &\quad + P(E_2)P(A|E_2) \\ &= \frac37\cdot\frac{5}{10} + \frac47\cdot\frac{4}{10} \\ &= \frac{15}{70} + \frac{16}{70} = \frac{31}{70}. \end{aligned}
    start ball moved from Bag II multiply along the path Bag I E₁: red moved A: red 3/7 × 5/10 = 15/70 A′: black 3/7 × 5/10 E₂: black moved A: red 4/7 × 4/10 = 16/70 A′: black 4/7 × 6/10 3/7 5/10 5/10 4/7 4/10 6/10
    The tree for Question 10. A red draw comes after a red ball was moved (green, 1570\frac{15}{70}⁠) or after a black ball was moved (rose, 1670\frac{16}{70}⁠).
    A red draw follows exactly one of the two moves, so the two path probabilities add.
    Multiply along a path, add the paths. Basics: tree diagrams
  5. Black moved, given a red draw: Bayes' theorem

    By Bayes' theorem,

    P(E2∣A)=P(E2)P(A∣E2)P(A)=1670÷3170=1670×7031=1631.\begin{aligned} P(E_2|A) &= \frac{P(E_2)P(A|E_2)}{P(A)} \\ &= \frac{16}{70} \div \frac{31}{70} \\ &= \frac{16}{70} \times \frac{70}{31} = \frac{16}{31}. \end{aligned}
    The top is the "black moved, then red drawn" path; the bottom is both paths to a red draw. 31 is prime and does not divide 16, so the fraction is in lowest terms.
    Dividing by a fraction is multiplying by its flip. Basics: dividing by a fraction
  6. A quick sense check

    The other cause gets P(E1∣A)=1570÷3170=1531P(E_1|A) = \frac{15}{70} \div \frac{31}{70} = \frac{15}{31}⁠, and 1631+1531=1\frac{16}{31} + \frac{15}{31} = 1⁠. Before the draw, black was moved with probability 47≈0.571\frac47 \approx 0.571⁠; the red draw lowers this to 1631≈0.516\frac{16}{31} \approx 0.516⁠.

    A red draw is less likely after a black ball is moved (410\frac{4}{10} against 510\frac{5}{10}⁠), so seeing red should make "black moved" less likely than before, but not by enough to fall below 12\frac12⁠.
    P(E1∣A)+P(E2∣A)=1P(E_1|A) + P(E_2|A) = 1 for a partition. Lesson: Bayes' theorem
Result

The probability that the transferred ball is black, given that the ball drawn from Bag II is red, is 1631\frac{16}{31}⁠. (Textbook answer: 1631\frac{16}{31}⁠.)

Check it with numbers

Picture 700 repeats. A red ball is moved in 37×700=300\frac37 \times 700 = 300 of them, and a red ball is then drawn in half of these, 150. A black ball is moved in 400, and red is drawn in 410×400=160\frac{4}{10} \times 400 = 160⁠. So red is drawn 150+160=310150 + 160 = 310 times, 160 of them after a black move: 160310≈0.5161\frac{160}{310} \approx 0.5161⁠, the same as 1631≈0.5161\frac{16}{31} \approx 0.5161⁠.

Common mistakes
  1. Forgetting that Bag II now has 10 balls. The moved ball is in Bag II at the time of the draw.
  2. Answering 47\frac47⁠. That is P(E2)P(E_2)⁠, before we know the drawn ball is red.
  3. Putting P(E1)P(A∣E1)P(E_1)P(A|E_1) on top. The question asks about a black transfer, so the top is the E2E_2 path, 1670\frac{16}{70}⁠.
What to take away
  1. In two-stage problems, update the second container's contents for each case of the first stage.
  2. Bayes' theorem balances how likely each cause was at first (37\frac37⁠, 47\frac47⁠) against how well it explains what we saw (510\frac{5}{10}⁠, 410\frac{4}{10}⁠).
  3. Book Example 16 uses the same two bags idea, but there the bag is chosen, not a ball moved.

Every fact used, and where it comes from

FactUsed inSource
Partition of a sample spaceStep 1Section 13.5.1 (Lesson: Bayes' theorem)
P(E)=n(E)n(S)P(E) = \frac{n(E)}{n(S)} for a random drawSteps 2, 3Class XI, Probability (Basics: classical probability)
Conditional probability P(A∣E)P(A|E)Step 3Section 13.2 (Lesson: conditional probability)
Theorem of total probabilityStep 4Section 13.5.2 (Lesson: Bayes' theorem)
Bayes' theoremSteps 5, 6Section 13.5 (Examples 15 to 21)
Found an error, or want more?

Tell us if something on this page is wrong or unclear, or if you would like a fuller explanation, another method or a new feature. Send feedback on this problem →