SECTION 1
Historical Context & Motivation
Humans have been gambling — and wondering about the odds — for thousands of years. Ancient dice made from animal bones have been found in archaeological sites dating back over 5,000 years, but for most of that history, people relied on gut feelings rather than mathematics when estimating their chances of winning. The formal study of probability only began when curious thinkers started asking a deceptively simple question: if I combine two random events — such as rolling two dice — how many total outcomes are possible, and how many of them are favorable?
1564 • Cardano's Book on Games of Chance
1654 • Pascal & Fermat Correspondence
1713 • Bernoulli's Ars Conjectandi
1900s • Modern Applications
The central question these mathematicians tackled — and the one this lesson addresses — is straightforward: when two or more chance events occur together, how do you systematically count every possible outcome and determine the probability of the ones you care about? The answer lies in organized lists, tables, and tree diagrams that turn a potentially overwhelming task into a manageable, step-by-step process.
SECTION 2
Core Principles & Definitions
Before diving into calculations, you need a clear vocabulary. A simple event involves a single action with random results — flipping one coin, rolling one die, or drawing one card. A compound event combines two or more simple events: flipping a coin and rolling a die, or rolling two dice one after the other. The key to computing compound probabilities is first understanding how to count the total number of equally likely outcomes — the sample space.
Sample Space
Fundamental Counting Principle
Organized Lists & Tables
Tree Diagrams
Probability Formula
KEY TAKEAWAY
SECTION 3
Visual Explanation — Tree Diagram for Coin + Die
One of the most powerful tools for visualizing compound events is a tree diagram. Let's consider a classic compound event: flipping a coin and then rolling a standard six-sided die. The first stage (the coin) has two branches — Heads (H) and Tails (T). From each of those branches, the second stage (the die) sprouts six more branches — one for each face 1 through 6. The result is 2 × 6 = 12 total endpoints, each representing one equally likely outcome.
Notice how the tree diagram guarantees completeness: because every branch at the first stage connects to every option at the second stage, you cannot accidentally skip an outcome or count one twice. If you wanted the probability of getting Heads and an even number, you would identify the favorable outcomes — (H, 2), (H, 4), and (H, 6) — giving you 3 favorable out of 12 total, so P = 3/12 = 1/4.
SECTION 4
Mathematical Framework
The formulas behind compound event probabilities are refreshingly direct. Everything starts with accurate counting, and two key equations do most of the heavy lifting.
FUNDAMENTAL COUNTING PRINCIPLE
Where m is the number of outcomes for the first event and n is the number of outcomes for the second event. This extends to three or more events: m × n × p × …
PROBABILITY OF A COMPOUND EVENT
Count the outcomes that match your desired condition (favorable), then divide by the total number of equally likely outcomes in the sample space.
MULTIPLICATION RULE (INDEPENDENT EVENTS)
When events A and B do not influence each other (they are independent), the probability of both occurring equals the product of their individual probabilities. For example, P(Heads) × P(roll a 4) = 1/2 × 1/6 = 1/12.
The multiplication rule is essentially a shortcut that avoids listing every outcome. However, when you are first learning compound probability, building the organized list or table is strongly recommended because it helps you verify your reasoning. Once you're confident the events are independent and you've counted correctly, the multiplication rule lets you compute the answer quickly.
SECTION 5
Organized Lists & Two-Way Tables
While tree diagrams work beautifully, a two-way table (also called a grid or matrix) is often faster for compound events with two stages. You place the outcomes of one event along the rows and the outcomes of the other along the columns. Every cell in the table represents one unique combined outcome.
The two-way table makes patterns immediately visible. The diagonal of amber cells shows that there are exactly 6 outcomes that sum to 7 out of 36 total outcomes, yielding a probability of 6/36 or 1/6 — approximately 16.7%. You can also quickly see that sums of 2 and 12 each have only one outcome, making them the least likely totals. This kind of at-a-glance analysis is what makes organized tables so powerful for compound events.
When to Use Each Method
SECTION 6
Worked Example
Let's work through a complete problem from start to finish. Suppose you spin a spinner with three equal sections — labeled Red (R), Blue (B), and Green (G) — and then flip a coin. What is the probability that you land on Blue and get Tails?
Spinner + Coin Flip
- 1
Step 1 — Identify the Events
Event 1: Spin a spinner with 3 equally likely outcomes → {R, B, G}. Event 2: Flip a coin with 2 equally likely outcomes → {H, T}. These two events are independent because the result of the spin does not affect the coin flip. - 2
Step 2 — Count Total Outcomes (Fundamental Counting Principle)
Total outcomes = 3 × 2 = 6. You can verify this by listing them all.Total outcomes = 6 - 3
Step 3 — Build an Organized List
Listing every outcome systematically: (R, H), (R, T), (B, H), (B, T), (G, H), (G, T). That confirms 6 outcomes. Being systematic means going through each spinner result and pairing it with every coin result before moving to the next. - 4
Step 4 — Identify Favorable Outcomes
We want Blue AND Tails. Scanning the list, only one outcome matches: (B, T).Favorable outcomes = 1 - 5
Step 5 — Compute the Probability
P(Blue and Tails) = favorable ÷ total = 1 ÷ 6.P(Blue and Tails) = 1/6 ≈ 0.167 or about 16.7% - 6
Step 6 — Verify with the Multiplication Rule
Since the events are independent, P(Blue) × P(Tails) = 1/3 × 1/2 = 1/6. ✓ This matches our answer from the organized list, confirming our work.Verification: 1/3 × 1/2 = 1/6 ✓
SECTION 7
Strengths & Limitations of Each Method
You now have three tools for finding compound probabilities: organized lists, two-way tables, and the multiplication rule. Each has situations where it shines and situations where it's less practical.
| Method | Strengths | Limitations |
|---|---|---|
| Organized List | Simple and intuitive; works for any small sample space; easy to check completeness by counting. | Becomes tedious for more than ~20 outcomes; easy to accidentally skip pairs if you aren't systematic. |
| Tree Diagram | Visually shows the sequential nature of events; extends naturally to three or more stages; great for communicating reasoning. | Gets unwieldy for events with many outcomes (e.g., two dice → 36 endpoints); takes time to draw neatly. |
| Two-Way Table | Compact; makes patterns (like diagonals) visible; excellent for exactly two events. | Only works cleanly for two events; a third event requires a separate table or nesting. |
| Multiplication Rule | Fast computation; scales to many events; no need to list every outcome. | Only valid when events are independent; easy to apply incorrectly if you haven't verified independence. |
Comparison of counting and probability methods
KEY TAKEAWAY
SECTION 8
Connection to Advanced Probability
The counting techniques you've learned here are the building blocks for more advanced probability topics you'll encounter later in high school and beyond. Understanding how a sample space grows when you combine events prepares you for concepts like permutations, combinations, conditional probability, and eventually the powerful tools of statistics.
| What You Know Now | Where It Leads |
|---|---|
| Fundamental Counting Principle (m × n) | Permutations (n!) and combinations (nCr) for counting without listing. |
| Organized lists to enumerate outcomes | Sample space notation and set theory for defining events precisely. |
| P(A and B) = P(A) × P(B) for independent events | Conditional probability P(A|B) and Bayes' theorem for dependent events. |
| Two-way tables for two events | Two-way frequency tables in statistics and chi-squared tests for association. |
From compound events to advanced probability
The key insight to carry forward is that probability is fundamentally about careful counting. Whether you're dealing with two dice or a complex real-world scenario, the discipline of systematically identifying every possible outcome — and then isolating the ones that matter — is the same skill, just applied at increasing levels of sophistication.
SECTION 9
Practice Problems
Question 1: CONCEPTUAL
Show answer
Question 2: BASIC CALCULATION
Show answer
Question 3: INTERMEDIATE
Show answer
Question 4: APPLIED
Show answer
Question 5: CRITICAL THINKING
Show answer
SUMMARY
Lesson Summary
Summary
A compound event combines two or more simple events, creating a larger sample space of combined outcomes. The Fundamental Counting Principle tells you that if event A has m outcomes and event B has n outcomes, the compound event has m × n total outcomes. You can systematically enumerate these outcomes using organized lists, tree diagrams, or two-way tables to ensure no outcome is missed or double-counted.
Once you have the complete sample space, the probability of any compound event equals the number of favorable outcomes divided by the total number of outcomes. For independent events — those whose results don't affect each other — the multiplication rule provides a quick shortcut: P(A and B) = P(A) × P(B). These counting skills form the foundation for more advanced topics like permutations, combinations, and conditional probability.