Tree Diagrams & Combined Events
Interactive curriculum lessons, worked examples, and geometric problem-solving techniques designed to help Kenyan students master CBC, KPSEA, KCSE, and IGCSE mathematics.
First Principles
Objective: Master tree diagrams to calculate probabilities of combined independent and dependent events (with and without replacement).
The Big Idea: Probability problems with multiple stages can quickly become confusing. A tree diagram maps out every possible sequence of events step-by-step. Each "branch" represents a choice or outcome, and each "path" from root to leaf represents one complete combined outcome.
Core Rules of Tree Diagrams
- Rule 1 (Along a Branch): Multiply probabilities along a path to find the probability of that specific combined outcome: \(P(A \text{ and } B) = P(A) \times P(B \mid A)\).
- Rule 2 (Across Outcomes): Add the probabilities of all distinct paths that fulfill the required condition: \(P(\text{Event}) = \sum P(\text{Favourable Paths})\).
- Rule 3 (Branch Totals): The sum of probabilities branching out from any single node must always equal 1.
With vs. Without Replacement:
- With replacement (Independent): Items are returned. Probabilities stay constant on the 2nd draw (denominator does not change).
- Without replacement (Dependent): Items are kept. Total items decrease by 1, and the count of the chosen colour decreases by 1 (denominator shrinks to \(n-1\)).
Interactive Tree Diagram Simulator
Simulate picking 2 beads from a pouch with 3 Red and 2 Blue beads. Toggle replacement mode to see how probabilities change!
Key Formulas
Worked Examples
Example 1 (Easy): Two draws without replacement — matching pair
A pouch contains 4 green and 2 yellow marbles. Two marbles are drawn one after another without replacement. Find the probability that both are green.
Step 1: Identify the probability of the first marble being green.
\[P(G_1) = \frac{4}{6} = \frac{2}{3}\]Step 2: Calculate the conditional probability of the second marble being green (1 green removed, total decreases by 1).
\[P(G_2 \mid G_1) = \frac{3}{5}\]Step 3: Multiply along the path:
\[P(G_1 \cap G_2) = \frac{4}{6} \times \frac{3}{5} = \frac{12}{30} = \frac{2}{5}\]Example 2 (Medium): Mixed outcomes — "One of each colour"
A vendor in Kisumu has a crate with 7 sweet mangoes and 3 sour mangoes. A buyer picks two mangoes at random without replacement. What is the probability that the buyer gets one sweet and one sour mango?
Step 1: Identify all possible paths that satisfy the condition.
- Path 1: Sweet then Sour \((S_1, R_2)\)
- Path 2: Sour then Sweet \((R_1, S_2)\)
Step 2: Calculate the probability for each path.
\[P(S_1 \cap R_2) = \frac{7}{10} \times \frac{3}{9} = \frac{21}{90}\] \[P(R_1 \cap S_2) = \frac{3}{10} \times \frac{7}{9} = \frac{21}{90}\]Step 3: Add the mutually exclusive paths together:
\[P(\text{One of each}) = \frac{21}{90} + \frac{21}{90} = \frac{42}{90} = \frac{7}{15}\]Example 3 (Hard): Multi-stage with Complement ("At Least One")
A bag contains 5 functional USB drives and 3 corrupted USB drives. A technician selects 3 drives at random without replacement. Find the probability that at least one functional drive is selected.
Strategy: Using the direct method requires summing \(P(1), P(2),\) and \(P(3)\) functional drives (7 different paths!). Instead, use the complement rule: \(P(\text{at least 1 functional}) = 1 - P(\text{all 3 corrupted})\).
Step 1: Calculate \(P(\text{all corrupted}) = P(C_1 \cap C_2 \cap C_3)\):
\[P(C_1 \cap C_2 \cap C_3) = \frac{3}{8} \times \frac{2}{7} \times \frac{1}{6} = \frac{6}{336} = \frac{1}{56}\]Step 2: Subtract from 1:
\[P(\text{at least one functional}) = 1 - \frac{1}{56} = \frac{55}{56}\]Common Mistakes
Incorrect: Calculating \(P(R_1 \cap R_2) = \frac{3}{5} \times \frac{2}{5}\).
Incorrect: Answering \(P(\text{Red and Blue}) = \frac{3}{5} \times \frac{2}{4} = \frac{3}{10}\).
Incorrect: \(P(A \text{ then } B) = P(A) + P(B)\).
Real World
Practice