Sample Spaces
Learn sample spaces step by step with worked examples you can follow. Then practise with 37 instant-feedback questions. Free Algebra 2 lesson from Mr Ahmed Hamouda.
Define and represent the sample space of an experiment with lists, tables, and tree diagrams, and count outcomes with the Fundamental Counting Principle.
Core Concepts
1. Experiment, Outcome, Sample Space, Event
Probability starts with four words. An experiment is anything involving chance — tossing a coin, rolling a die, spinning a spinner. One single run of that experiment produces one outcome. Collect every outcome that could possibly happen and you have the sample space. Pick out just the outcomes you care about and you have an event.
Event "even number": S(even) = {2, 4, 6} ← a subset of S
Notice that the event lives inside the sample space. Every outcome of the event must already be an outcome of the experiment — you never invent new outcomes when you build an event.
2. Finite vs. Infinite Sample Spaces
Sample spaces come in three flavours. Ask yourself two questions: Can I finish listing them? and if not, could I at least line them up in order?
| Finite | Infinite Discrete | Infinite Continuous |
|---|---|---|
Spinning a spinnerS = {red, blue, purple} |
Tossing a coin until you get two headsS = {H, TH, TTH, …} |
All of the diameters in a circle |
| You can finish the list. The outcomes are countable. | The list never ends, but the outcomes can be arranged in a sequence and counted off one by one. | The outcomes cannot be counted or listed — there are infinitely many ways to fill the space, with no "next" one. |
∅. For example, the event "roll a 7 on a standard die" gives S = ∅.3. Three Ways to Represent a Sample Space
You can represent a sample space by using an organized list, a table, or a tree diagram. All three show the same outcomes — you choose whichever one keeps you from missing any.
S = {(R, R), (R, B), (B, R), (B, B)}. Best for small experiments and when order matters.R stands for the red hat and B stands for the black hat.(R, B) and (B, R) are not the same outcome. The first entry is Saturday's hat and the second is Sunday's hat, so red-then-black is a different outcome from black-then-red. Never merge them into one.4. The Fundamental Counting Principle
For some large or complicated experiments, listing the entire sample space may not be practical or necessary. To find the number of possible outcomes, you can multiply instead of list.
Words: The number of possible outcomes in a sample space can be found by multiplying the number of possible outcomes from each stage or event.
Symbols: In a k-stage experiment, let
n1 = the number of possible outcomes for the first stage,
n2 = the number of possible outcomes for the second stage after the first stage has occurred, …
nk = the number of possible outcomes for the kth stage after the first k − 1 stages have occurred.
Why it works: every one of the n1 first-stage branches splits into n2 second-stage branches, so the tree ends with n1 groups of n2 leaves — that is n1 · n2 leaves. Repeat for each new stage.
n, n − 1, n − 2, …).Tree Diagrams & Sample-Space Tables
Click a chip under any tree to isolate one branch — everything else fades so you can read that branch's outcomes on their own. Click the same chip again to bring the whole tree back.
| Saturday ↓ / Sunday → | R | B |
|---|---|---|
| R | R, R | R, B |
| B | B, R | B, B |
The same sample space as a two-way table: 2 rows × 2 columns = 4 cells = 4 outcomes.
Two-Way Table · Rolling Two Dice
A table is the fastest picture of a two-stage sample space. Rows = first die, columns = second die, and each of the 6 × 6 = 36 cells is one outcome. Here each cell shows the sum, so an event like "the sum is 8" is just the set of bold cells — there are 5 of them.
| 1st ↓ / 2nd → | 1 | 2 | 3 | 4 | 5 | 6 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | 5 | 6 | 7 |
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 3 | 4 | 5 | 6 | 7 | 8 | 9 |
| 4 | 5 | 6 | 7 | 8 | 9 | 10 |
| 5 | 6 | 7 | 8 | 9 | 10 | 11 |
| 6 | 7 | 8 | 9 | 10 | 11 | 12 |
Worked Examples
a. What is the sample space of the experiment?
b. What is the sample space for the event of rolling a prime number?
Table
row R: R, R | R, B
row B: B, R | B, B
Tree diagram
Each splits into R, B
4 paths = 4 outcomes
(see Figure 1 above)
a. A marble is drawn from a bag containing 3 orange, 5 green, and 4 blue marbles.
b. A spinner with four equal parts of green, blue, red, and yellow is spun until it lands on yellow.
c. A ball is thrown into the air and its height is recorded in inches.
a. How many combinations are possible if there is no restriction on the number of times a number can be used?
b. How many combinations are possible if each number can be used only once?
Try It Yourself
Practice 1 · define a sample space
a. Write the sample space S. b. Write the sample space for the event of landing on a multiple of 3.
Practice 2 · two-stage sample space
Practice 3 · classify the sample space
a. A letter is chosen at random from the alphabet.
b. A die is rolled until a 6 appears.
c. The distance a rolled marble travels is measured in centimetres.
Practice 4 · Fundamental Counting Principle
Practice 5 · counting inside an event
a. How many outcomes are in the sample space? b. How many outcomes give a sum of 8? c. How many outcomes give an odd sum?
Practice 6 · without replacement
Summary
| Situation | What to do | Result |
|---|---|---|
| "What is the sample space?" | List every possible outcome inside braces | S = {1, 2, 3, 4, 5, 6} |
| "Sample space for the event …" | Keep only the outcomes of S that fit the description | S(prime) = {2, 3, 5} |
| No outcome satisfies the event | Write the empty set | S = ∅ |
| 2-stage experiment, small | Organized list or a two-way table | {(R,R), (R,B), (B,R), (B,B)} |
| 3 or more stages, or stages depend on each other | Tree diagram — one level per stage, one path per outcome | 8 leaves for 3 coin tosses |
| Only the number of outcomes is needed | Fundamental Counting Principle: multiply the stages | 6 · 5 · 9 · 4 · 6 = 6480 |
| Choices are used up (no repeats) | Drop the stage count by one each time | 10 · 9 · 8 · 7 = 5040 |
| The list ends | Call it finite and write S out | {orange, green, blue} |
| "… until …" appears | Endless but sequenceable | infinite discrete |
| A measurement is recorded | Cannot be listed at all | infinite continuous |
- Adding the stages instead of multiplying them (4 + 5 + 2 = 11 instead of 4 · 5 · 2 = 40).
- Treating
(R, B)and(B, R)as the same outcome — position tells you the stage. - Counting the number of objects instead of the number of recorded outcomes (12 marbles but only 3 colours).
- Calling "roll until a 6 appears" continuous. It is endless, but the outcomes can be counted → infinite discrete.
- Saying two dice have 11 outcomes because the sums run 2 to 12. The sample space has 36 outcomes.
- Forgetting that "without replacement" shrinks each later stage by one.
- Listing a leaf of a tree without following the whole path — each outcome is the complete path from Start.
Practice Quiz
15 questions · click an answer to check it instantly