Example 8: Urn: two black balls drawn without replacement
An urn contains 10 black and 5 white balls. Two balls are drawn from the urn one after the other without replacement. What is the probability that both drawn balls are black?
Let : the first ball drawn is black, and : the second ball drawn is black. We have to find .
At the first draw there are 15 balls, 10 of them black.
Given that the first ball is black (not replaced), 9 black and 5 white balls are left.
By the multiplication rule of probability,
P(both balls black) .
Want the reason behind every step, the basics and the checks?
For "this, then that", multiply the first probability by the second probability given the first. Without replacement, the first black ball changes what is left in the urn, so the second draw is a conditional probability:
- Given
- An urn with 10 black and 5 white balls (15 in all). Two balls are drawn one after the other, without replacement, each draw at random from the balls then in the urn.
- To find
- The probability that both balls are black.
- Plan
- Name (first black) and (second black); find ; find from the urn after one black ball is removed; multiply.
Basics you need
A ball drawn at random from balls of which are black is black with probability . Basics: the classical definition
is the probability of when we know that has happened (Section 13.2). Lesson: conditional probability
, provided (Section 13.3). Lesson: the multiplication rule
Multiply along a path. Basics: tree diagrams
Solution
Name the events
Let : the first ball drawn is black, and : the second ball drawn is black. "Both black" is (also written ), so we have to find .
Splitting "both black" into one event per draw lets us handle the draws one at a time.The first draw
At the first draw there are 15 balls, 10 of them black, each equally likely to be drawn.The second draw, given the first was black
If has happened, one black ball is out of the urn and is not put back. That leaves 9 black and 5 white balls, 14 in all. The probability that the second ball is black, given that the first was black, is therefore .Multiply
The tree for the two draws. Each second-stage probability is conditional on the first draw. The highlighted path, black then black, has probability ; the four paths add up to 1. The multiplication rule says that the chance of " and then " is the chance of times the chance of once is known; it comes from the definition by multiplying both sides by . Here . To simplify, : divide top and bottom by 30.Multiplication rule, Section 13.3. Lesson: the multiplication rule
P(both balls black) .
(Textbook answer: .)
By counting ordered pairs. There are ordered ways to draw two balls, all equally likely, and of them give black then black. So the probability is , the same.
The tree adds up. .
Decimals. . With replacement the answer would be , a little more: removing a black ball makes a second black slightly less likely.
- Using twice. That is the "with replacement" answer ; here the first ball is not put back.
- Changing only the black count. After one black ball is removed, the total also drops to 14: , not .
- Adding instead of multiplying. "Both" means one thing and the other, so the probabilities along the path are multiplied.
- : first stage, times second stage given the first.
- "Without replacement" changes both the count of the colour drawn and the total. The same reasoning with cards is Exercise 13.2, Question 2.
- A tree diagram shows every case; its path probabilities add up to 1.
Every fact used, and where it comes from
| Fact | Used in | Source |
|---|---|---|
| Probability of a black ball is for equally likely draws | Steps 2, 3 | Class XI, Probability (Basics: the classical definition) |
| Conditional probability | Step 3 | Definition 1, Section 13.2 (Lesson: conditional probability) |
| , | Step 4 | Multiplication rule, Section 13.3 (Lesson: the multiplication rule) |
| Tree diagram: multiply along a path, paths add to 1 | Step 4, Check | Basics: tree diagrams |
| Ordered draws: and | Check | Counting principle, Class XI (Basics: multiply the choices) |
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 →