Turning the Definition Around
The conditional-probability definition answers "what is the conditional?" — but rearranged, it answers the more common question "what is the probability that both events occur?":
(each form valid when the conditioning event has nonzero probability). This is the multiplication rule of probability. The event is often written simply .
Reading it as a story
reads: probability the first thing happens, times the probability the second happens given the first already has. This is exactly how sequential experiments unfold — draw a ball, the urn changes, draw again. The rule formalises "update the odds after each step, then multiply along the chain."
Extension to three or more events
and similarly for longer chains — each factor conditions on everything drawn so far.
Key Point (without vs with replacement): the multiplication rule earns its keep in without-replacement problems, where each draw changes the pool: both counts (favourable and total) shrink as you go. With replacement, the pool resets and the factors are all equal — a preview of independence, next section. The single most common error is forgetting to update BOTH the numerator and the denominator after each draw.
Solved Examples
Example 1: Two blacks, no replacement
An urn contains black and white balls. Two balls are drawn one after the other without replacement. Find the probability that both are black.
Solution:
- First draw: .
- Second draw, updated urn ( black among ): .
- Multiply: .
Answer: .
Example 2: King, king, ace
Three cards are drawn successively without replacement from a well-shuffled pack. Find the probability that the first two are kings and the third is an ace.
Solution:
- Chain of three: ; (three kings left in ); (all four aces still there, cards left).
- Multiply: .
Answer: — note the third factor's numerator did NOT shrink: no aces had been removed.
Example 3: Both aces
Two cards are drawn without replacement. Find the probability that both are aces.
Solution:
- Chain: .
- Simplify: .
Answer: . (With replacement the answer would be — replacement always makes repeats more likely… than without? Compare: : yes, resetting the pool keeps all four aces available.)
Example 4: All three good
A box holds oranges of which are good. Three oranges are drawn without replacement. Find the probability that all three are good.
Solution:
- Chain: .
- Compute: .
Answer: — both numbers fall by one at each step: good oranges and total oranges.
Example 5: Order matters in the chain
An urn has red and black balls. Two are drawn without replacement. Find the probability that the first is red and the second is black.
Solution:
- Chain in the stated order: ; (all three blacks remain, seven balls left).
- Multiply: .
Answer: — the chain follows the stated sequence; "one red and one black in any order" would add the reverse chain as well.
Example 6: None defective
Of bulbs, are defective. Three bulbs are drawn without replacement. Find the probability that none is defective.
Solution:
- Chain through the good bulbs: .
- Compute: .
Answer: .