Miscellaneous · Q10: Ball moved between bags: the moved ball was black,
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.
Let : the transferred ball is red, : the transferred ball is black, and : the ball drawn from Bag II is red.
and 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 and .
If occurs, Bag II has 5 red and 5 black balls, so .
If occurs, Bag II has 4 red and 6 black balls, so .
By the theorem of total probability,
By Bayes' theorem,
The probability that the transferred ball is black is .
Want the reason behind every step, the basics and the checks?
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: .
- 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) .
- Plan
- (1) Name the events; check the partition. (2) Find , from Bag I. (3) Find the new contents of Bag II in each case, and , . (4) Total probability. (5) Bayes' theorem.
Basics you need
A ball drawn at random from a bag is red with probability . Basics: P(E) = n(E)/n(S)
The chance of drawing red from Bag II depends on what was moved: and are different. Lesson: conditional probability
and . Lesson: Bayes' theorem
First branch: colour moved; second branch: colour drawn. Basics: tree diagrams
Solution
Name the events
Let
- : the transferred ball is red;
- : the transferred ball is black;
- : the ball drawn from Bag II is red.
and 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' theoremThe first stage: which ball is moved
Bag I has balls, so
The ball is chosen at random from Bag I, so each of its 7 balls is equally likely to be moved.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 (): 5 red, 5 black, so .
- If a black ball was moved (): 4 red, 6 black, so .
The moved ball joins Bag II before the draw, so it must be counted. Forgetting it would give 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 probabilityThe chance of a red draw: total probability
Since and form a partition, by the theorem of total probability
The tree for Question 10. A red draw comes after a red ball was moved (green, ) or after a black ball was moved (rose, ). 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 diagramsBlack moved, given a red draw: Bayes' theorem
By Bayes' theorem,
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 fractionA quick sense check
The other cause gets , and . Before the draw, black was moved with probability ; the red draw lowers this to .
A red draw is less likely after a black ball is moved ( against ), so seeing red should make "black moved" less likely than before, but not by enough to fall below .for a partition. Lesson: Bayes' theorem
The probability that the transferred ball is black, given that the ball drawn from Bag II is red, is . (Textbook answer: .)
Picture 700 repeats. A red ball is moved in 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 . So red is drawn times, 160 of them after a black move: , the same as .
- Forgetting that Bag II now has 10 balls. The moved ball is in Bag II at the time of the draw.
- Answering . That is , before we know the drawn ball is red.
- Putting on top. The question asks about a black transfer, so the top is the path, .
- In two-stage problems, update the second container's contents for each case of the first stage.
- Bayes' theorem balances how likely each cause was at first (, ) against how well it explains what we saw (, ).
- 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
| Fact | Used in | Source |
|---|---|---|
| Partition of a sample space | Step 1 | Section 13.5.1 (Lesson: Bayes' theorem) |
| for a random draw | Steps 2, 3 | Class XI, Probability (Basics: classical probability) |
| Conditional probability | Step 3 | Section 13.2 (Lesson: conditional probability) |
| Theorem of total probability | Step 4 | Section 13.5.2 (Lesson: Bayes' theorem) |
| Bayes' theorem | Steps 5, 6 | Section 13.5 (Examples 15 to 21) |
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 →