Sample Spaces

Algebra 2Module 12: ProbabilityProblem-Solving and Data Analysis

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.

Experiment — a situation involving chance.
Outcome — the result of a single performance, or trial, of an experiment.
Sample space — the set of all possible outcomes of an experiment.
Event — a subset of the sample space.
Finite sample space — a sample space that contains a countable number of outcomes.
Infinite sample space — a sample space with outcomes that cannot be counted.
Roll one die:   S = {1, 2, 3, 4, 5, 6}   ← sample space
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?

FiniteInfinite DiscreteInfinite Continuous
Spinning a spinner
S = {red, blue, purple}
Tossing a coin until you get two heads
S = {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.
1
Finite → the list ends. Count it and write S out in full.
2
Infinite discrete → the list goes on forever but you can still write the first few and put "…". A give-away word is until (spin until it lands on yellow, roll until you get a 6).
3
Infinite continuous → a measurement (height, distance, time, length). Between any two values there is always another value, so no list is possible.
Study Tip — Empty Set: An empty set is a set containing no elements. In probability, if there are no possible outcomes that satisfy an event, then the sample space is described using the empty set ∅. 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.

Organized list — pair each outcome of stage 1 with every outcome of stage 2 and write them as ordered pairs: S = {(R, R), (R, B), (B, R), (B, B)}. Best for small experiments and when order matters.
Table — stage 1 down the side, stage 2 across the top; each cell is one outcome. Best for exactly two stages (a table has only two directions).
Tree diagram — one level of branching per stage; each complete path from the start to a leaf is one outcome. Best for three or more stages, and the only one of the three that handles a stage whose choices depend on the previous stage.
Study Tip — Tree Diagram Notation: Choose notation for outcomes in your tree diagrams that will eliminate confusion. In the hat example below, R stands for the red hat and B stands for the black hat.
Watch Out — order matters: (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.

Key Concept · Fundamental Counting Principle

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.

Total possible outcomes = n1 · n2 · n3 · … · nk

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.

Study Tip — Multiplication Rule: The Fundamental Counting Principle is sometimes called the Multiplication Rule for Counting or the Counting Principle.
Watch Out — multiply, don't add: If you choose one item from each category, multiply. You only add when you choose one item from one category or another. Also watch the phrase without replacement: the stage counts then drop by one each time (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.

Two-Stage Tree · One Hat Each Day
Saturday Sunday Outcome Start R R B (R, R) (R, B) B R B (B, R) (B, B)
2 choices · 2 choices = 4 outcomes. Each complete path from Start to a leaf is one outcome, written as an ordered pair (Saturday, Sunday).
Saturday ↓  /  Sunday →RB
RR, RR, B
BB, RB, B

The same sample space as a two-way table: 2 rows × 2 columns = 4 cells = 4 outcomes.

Three-Stage Tree · Tossing a Coin Three Times
Toss 1 Toss 2 Toss 3 Outcome Start H H T H T H T HHH HHT HTH HTT T H T H T H T THH THT TTH TTT
2 · 2 · 2 = 8 outcomes. Isolating "First toss = H" shows the 4 outcomes that begin with H — exactly half the sample space, because the remaining two stages still give 2 · 2 = 4 paths.
Unequal Stages · Spinner (A, B, C) then a Coin
Spinner Coin Outcome Start A H T (A, H) (A, T) B H T (B, H) (B, T) C H T (C, H) (C, T)
3 · 2 = 6 outcomes. The two stages need not have the same number of branches — each spinner branch simply splits into the same 2 coin branches.

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 →123456
1234567
2345678
3456789
45678910
567891011
6789101112
Watch Out: the sample space here has 36 outcomes, not 11. The sums 2 through 12 are only 11 values; they are not equally likely because different numbers of cells produce them.

Worked Examples

A fair die is tossed once.
a. What is the sample space of the experiment?
b. What is the sample space for the event of rolling a prime number?
1S includes all possible outcomes of rolling a diedefinition of sample space
2S = {1, 2, 3, 4, 5, 6}list every face
3S(prime number on a die) includes all primes less than 6an event is a subset of S
42, 3, 5 are prime; 1 is not prime; 4 and 6 are compositetest each outcome
a. S = {1, 2, 3, 4, 5, 6}    b. S(prime) = {2, 3, 5}
Check: every element of {2, 3, 5} appears in {1, 2, 3, 4, 5, 6} ✓ — the event really is a subset.
Watch Out: 1 is not prime (it has only one factor), and 6 is not prime even though it is bigger than 5. Test each face separately instead of guessing a pattern.
Kembe has a black hat and a red hat. He chooses one hat for each day, Saturday and Sunday. Represent the sample space for this experiment by making an organized list, a table, and a tree diagram.
1For each day there are two possibilities: red (R) or black (B)identify the stages
2Pair each Saturday choice with each Sunday choiceorganized list
3S = {(R, R), (R, B), (B, B), (B, R)}4 ordered pairs

Table

Saturday down the side, Sunday across the top:
row R: R, R  |  R, B
row B: B, R  |  B, B

Tree diagram

Stage 1: R, B
Each splits into R, B
4 paths = 4 outcomes
(see Figure 1 above)
S = {(R, R), (R, B), (B, R), (B, B)}  —  4 outcomes
Talk About It — why are (R, B) and (B, R) different? The position tells you the day. (R, B) means red on Saturday and black on Sunday; (B, R) means black on Saturday and red on Sunday. Different days get different hats, so they are different outcomes.
Classify each sample space as finite or infinite. If it is finite, write the sample space. If it is infinite, classify whether it is discrete or continuous.
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.
1a. Only 3 possible outcomes: orange, green, or bluecolour is what is recorded, not which marble
2a. S = {orange, green, blue} → finitethe list ends
3b. The spin could take 1, 2, 3, … tries → infinite number of outcomesthe word "until"
4b. S = {Y, NY, NNY, …} can be sequenced → infinite discretecountable, but never ends
5c. Heights can be recorded indefinitely (12 in., 12.4 in., 12.41 in., …)a measurement
6c. No list is possible → infinite continuousbetween any two heights lies another
a. finite, S = {orange, green, blue}    b. infinite discrete    c. infinite continuous
Watch Out: in part (a) the bag holds 12 marbles, but the experiment records the colour, so the sample space has 3 outcomes — not 12. Always ask what is being recorded.
Santiago lists the number of sections available for the courses he will take in his first semester at college: Art History 6, French 5, Mathematics 9, Art 4, English 6. How many different schedules could Santiago create for this semester?
1Estimate: about 10 sections of Mathematics, about 5 sections of each of the other four coursesround to friendly numbers
210 · 5 · 5 · 5 · 5 = 6250 schedules (estimate)Fundamental Counting Principle
3n1 · n2 · n3 · n4 · n5 = 6 · 5 · 9 · 4 · 65-stage experiment
46 · 5 = 30,   30 · 9 = 270,   270 · 4 = 1080,   1080 · 6 = 6480multiply left to right
6 · 5 · 9 · 4 · 6 = 6480 different schedules
Check: 6480 is close to the estimate of 6250, so the answer is reasonable. A tree diagram here would need 6480 leaves — this is exactly when the Counting Principle beats a drawing.
A lock uses a 4-number combination, each number from 0 to 9.
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?
1a. Each of the 4 stages has 10 choicesdigits may repeat
2a. 10 · 10 · 10 · 10 = 104 = 10,000Counting Principle
3b. After a digit is used it is gone: 10, then 9, then 8, then 7no repeats → each stage loses one choice
4b. 10 · 9 · 8 · 7 = 5040multiply
a. 10,000 combinations    b. 5040 combinations
Check: 5040 < 10,000 ✓ — forbidding repeats can only remove possibilities, never add any.
Watch Out: "no repeats" does not mean subtract. The stage counts drop by one each time because the earlier choice is no longer available: n, n − 1, n − 2, …

Try It Yourself

Practice 1 · define a sample space

A numbered spinner with eight equal parts, labelled 1 through 8, is spun once.
a. Write the sample space S.   b. Write the sample space for the event of landing on a multiple of 3.
1S = {1, 2, 3, 4, 5, 6, 7, 8}every equal part is one outcome
2Multiples of 3 that are 8 or less: 3 and 69 is not on the spinner
a. S = {1, 2, 3, 4, 5, 6, 7, 8}    b. S(multiple of 3) = {3, 6}

Practice 2 · two-stage sample space

A spinner with three equal parts A, B, C is spun once and then a coin is tossed. List the sample space and state how many outcomes it contains.
1Stage 1: 3 outcomes. Stage 2: 2 outcomes.read the stages
2S = {(A, H), (A, T), (B, H), (B, T), (C, H), (C, T)}pair every spinner part with every coin face
33 · 2 = 6Counting Principle confirms the list
6 outcomes (see Figure 3 above)

Practice 3 · classify the sample space

Classify each as finite, infinite discrete, or infinite continuous.
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.
1a. 26 outcomes, S = {A, B, C, …, Z}the list ends → finite
2b. Could take 1, 2, 3, … rolls — countable but endless"until" → infinite discrete
3c. A measurement with no smallest stepinfinite continuous
a. finite    b. infinite discrete    c. infinite continuous

Practice 4 · Fundamental Counting Principle

A code consists of 2 letters (A–Z) followed by 3 digits (0–9), and repeats are allowed. How many different codes are possible?
1Stages: 26, 26, 10, 10, 105-stage experiment, repeats allowed
226 · 26 = 676   and   10 · 10 · 10 = 1000group the like stages
3676 · 1000 = 676,000multiply
676,000 codes

Practice 5 · counting inside an event

Two fair dice are rolled once.
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?
1a. 6 · 6 = 36Counting Principle
2b. (2,6), (3,5), (4,4), (5,3), (6,2)read the bold cells of the table
3b. 5 outcomescount them
4c. odd sum = (even, odd) or (odd, even) = 3 · 3 + 3 · 3odd + even is odd
5c. 9 + 9 = 18add the two disjoint cases
a. 36    b. 5    c. 18

Practice 6 · without replacement

A box contains 6 different objects. Three objects are removed one at a time, without putting an object back. How many possible outcomes are there?
1Stage 1: 6 choicesall objects available
2Stage 2: 5 choices; Stage 3: 4 choicesone fewer each time
36 · 5 · 4 = 120Counting Principle
120 outcomes

Summary

SituationWhat to doResult
"What is the sample space?"List every possible outcome inside bracesS = {1, 2, 3, 4, 5, 6}
"Sample space for the event …"Keep only the outcomes of S that fit the descriptionS(prime) = {2, 3, 5}
No outcome satisfies the eventWrite the empty setS = ∅
2-stage experiment, smallOrganized list or a two-way table{(R,R), (R,B), (B,R), (B,B)}
3 or more stages, or stages depend on each otherTree diagram — one level per stage, one path per outcome8 leaves for 3 coin tosses
Only the number of outcomes is neededFundamental Counting Principle: multiply the stages6 · 5 · 9 · 4 · 6 = 6480
Choices are used up (no repeats)Drop the stage count by one each time10 · 9 · 8 · 7 = 5040
The list endsCall it finite and write S out{orange, green, blue}
"… until …" appearsEndless but sequenceableinfinite discrete
A measurement is recordedCannot be listed at allinfinite continuous
S = {all outcomes} event ⊆ S n1 · n2 · … · nk k stages of n each: nk no repeats: n(n−1)(n−2)… 2 dice: 6 · 6 = 36 c coins: 2c empty event: ∅
Common mistakes to avoid:
  • 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

0/15

๐Ÿ“ Test your understanding