Sample Spaces and Repeated Experiments

Master sample spaces and repeated experiments with step-by-step exercises and comprehensive explanations for 8th grade math students.

Sample Space and Repeated Experiment Problems
1 Sample Space Listing
Exercise 1
List the sample space for flipping a coin twice. How many outcomes are possible?
Definition:

Sample space: The set of all possible outcomes of a probability experiment.

Solution Method:
  1. Identify all possible outcomes for each stage
  2. List outcomes systematically to avoid duplicates
  3. Count the total number of outcomes
  4. Verify all possibilities are included
Step 1: Identify outcomes for each flip

First flip: H (heads) or T (tails)

Second flip: H (heads) or T (tails)

Step 2: List all combinations systematically

HH (heads, heads)

HT (heads, tails)

TH (tails, heads)

TT (tails, tails)

Step 3: Write the sample space

Sample space S = {HH, HT, TH, TT}

Step 4: Count the outcomes

Number of outcomes = 4

Sample space: {HH, HT, TH, TT}, Count: 4
Final answer:

The sample space is {HH, HT, TH, TT} with 4 possible outcomes.

Applied rules:

• Systematic listing: Organize outcomes to avoid missing any

• Fundamental counting principle: 2 outcomes × 2 outcomes = 4 total outcomes

• Order matters: HT and TH are different outcomes

2 Tree Diagram Method
Exercise 2
Use a tree diagram to find the sample space for rolling a die and then flipping a coin. How many outcomes are possible?
Definition:

Tree diagram: A visual representation showing all possible outcomes of a sequence of events.

Step 1: Draw the first stage

Rolling a die: 6 possible outcomes (1, 2, 3, 4, 5, 6)

Step 2: Draw branches for the second stage

From each die outcome, branch to 2 coin outcomes (H, T)

Step 3: List all final outcomes

(1,H), (1,T), (2,H), (2,T), (3,H), (3,T), (4,H), (4,T), (5,H), (5,T), (6,H), (6,T)

Step 4: Count the outcomes

Using fundamental counting principle: 6 × 2 = 12 outcomes

Sample space: {(1,H), (1,T), ..., (6,T)}, Count: 12
Final answer:

The sample space has 12 outcomes: (1,H), (1,T), (2,H), (2,T), (3,H), (3,T), (4,H), (4,T), (5,H), (5,T), (6,H), (6,T).

Applied rules:

• Tree diagram: Shows all possible sequences of outcomes

• Fundamental counting principle: m × n outcomes for m first-stage and n second-stage outcomes

• Ordered pairs: Represent outcomes as (first event, second event)

3 Repeated Experiment
Exercise 3
A spinner has 3 equal sections labeled A, B, and C. If the spinner is spun 3 times, how many outcomes are possible? List the first few outcomes.
Definition:

Repeated experiment: Performing the same experiment multiple times, creating a sequence of outcomes.

Step 1: Identify outcomes for one spin

Single spin: A, B, or C

Step 2: Apply fundamental counting principle

Three spins: 3 × 3 × 3 = 27 total outcomes

Step 3: List first few outcomes systematically

AAA, AAB, AAC, ABA, ABB, ABC, ACA, ACB, ACC, BAA, BAB, BAC, ...

Step 4: Verify the count

For n repetitions of an experiment with k outcomes: k^n total outcomes

Here: 3^3 = 27 outcomes

Total outcomes: 27, First few: AAA, AAB, AAC...
Final answer:

There are 27 possible outcomes when spinning the spinner 3 times. The sample space includes all combinations of 3 letters from {A, B, C}.

Applied rules:

• Fundamental counting principle: For repeated experiments, multiply the number of outcomes at each stage

• Power rule: n repetitions of k outcomes each gives k^n total outcomes

• Systematic listing: Order outcomes to avoid missing any

Comprehensive Summary: Sample Spaces and Repeated Experiments
\(\text{Total Outcomes} = n_1 \times n_2 \times n_3 \times \ldots \times n_k\)
Fundamental Counting Principle
\(\text{Repeated Experiment Outcomes} = k^n\)
Repeated Experiment Formula
Key Definitions:

Sample space: The set of all possible outcomes of a probability experiment, usually denoted by S or Ω.

Outcome: A single possible result of an experiment.

Event: A subset of the sample space.

Fundamental counting principle: If one event can occur in m ways and a second event can occur in n ways, then both events can occur in m × n ways.

Repeated experiment: Performing the same experiment multiple times independently.

Sample Space Construction Methods:
  1. Listing method: Write out all possible outcomes systematically
  2. Tree diagram: Visual representation showing all possible paths
  3. Grid method: Use tables for experiments with two stages
  4. Counting principle: Calculate total outcomes without listing all
Tip 1: Always organize outcomes systematically to avoid missing any or counting duplicates.
Tip 2: For experiments with many stages, use the counting principle instead of listing all outcomes.
Tip 3: Order matters in sample spaces unless specified otherwise.
Tip 4: Tree diagrams are especially helpful for sequential experiments with multiple stages.
Common Applications: Games of chance, decision making, risk assessment, statistical analysis, quality control.
Key Skills: Systematic counting, pattern recognition, visualization, logical reasoning, organization.
Counting Principles:

• Addition principle: For mutually exclusive events, add the number of outcomes

• Multiplication principle: For sequential events, multiply the number of outcomes

• Permutations: Order matters (arrangements)

• Combinations: Order doesn't matter (selections)

Advanced Concepts & Tree Diagrams
\(\text{Permutations} = \frac{n!}{(n-r)!}\)
Permutation Formula
\(\text{Combinations} = \frac{n!}{r!(n-r)!}\)
Combination Formula
Advanced Concepts:

Ordered outcomes: Sequences where the order of elements matters (e.g., HT ≠ TH).

Unordered outcomes: Sets where the order doesn't matter (e.g., {H,T} = {T,H}).

With replacement: Items are returned after selection, keeping probabilities constant.

Without replacement: Items are not returned, changing the sample space for subsequent selections.

Conditional sample spaces: Sample spaces that change based on previous outcomes.

TREE DIAGRAM
Visual
Sequential
COUNTING PRINCIPLE
Formula
Efficient
SYSTEMATIC LIST
Complete
Detailed
Tree Diagram Construction:
  1. Start with root: Begin the diagram with initial state
  2. Branch outcomes: Draw branches for each possible outcome of first event
  3. Continue branching: From each outcome, branch for next event's outcomes
  4. Label outcomes: Mark each branch with the corresponding outcome
  5. Count paths: Each path from root to terminal node represents a possible outcome
Tip 1: For complex experiments, break them into simpler stages and build the tree step by step.
Tip 2: When outcomes have different probabilities, include those probabilities on the branches.
Tip 3: For experiments with many outcomes, use the counting principle to verify your tree diagram.
Tip 4: Use abbreviations or symbols to keep tree diagrams manageable.
Common Mistakes: Missing outcomes in systematic lists, miscounting in tree diagrams, not accounting for replacement conditions, confusing ordered vs unordered outcomes.
Advanced Topics: Permutations and combinations, probability distributions, expected value, binomial experiments, geometric probability.
Decision Rules:

• When to list: Small sample spaces where visualization helps understanding

• When to use tree diagrams: Sequential experiments with clear stages

• When to use counting principle: Large sample spaces where listing is impractical

• Order consideration: Determine if arrangements (permutations) or selections (combinations) are needed

Frequently Asked Questions & Expert Answers

Questions & Answers

Question: How do I know when to use a tree diagram versus just multiplying numbers?

Answer: Choose your method based on the complexity and purpose:

Use tree diagrams when:

  • You need to visualize all possible outcomes

Use multiplication (counting principle) when:

  • The sample space is large
  • You only need to know the total number of outcomes
  • The pattern is straightforward (like repeated experiments)

Tree diagrams are excellent for understanding the process, while multiplication is more efficient for calculations.

Question: What's the difference between sample space and event?

Answer: Think of sample space and event in terms of sets:

Sample space: The complete set of ALL possible outcomes of an experiment.

  • Flipping a coin: S = {H, T}
  • Rolling a die: S = {1, 2, 3, 4, 5, 6}
  • Rolling two dice: S = {(1,1), (1,2), ..., (6,6)}

Event: A specific subset of the sample space that we're interested in.

  • Getting heads: E = {H}
  • Rolling an even number: E = {2, 4, 6}
  • Rolling a sum of 7 with two dice: E = {(1,6), (2,5), (3,4), (4,3), (5,2), (6,1)}

Every event is a subset of the sample space, but the sample space itself contains all possible outcomes.

Question: How do I handle sample spaces when items are not replaced?

Answer: Without replacement, the sample space changes after each selection:

Example: Drawing 2 cards from a deck without replacement

  • First draw: 52 possible outcomes (any of 52 cards)
  • Second draw: 51 possible outcomes (since 1 card is removed)
  • Total outcomes: 52 × 51 = 2,652

Key considerations:

  • The number of possible outcomes decreases with each selection
  • Probabilities change for subsequent events
  • Events become dependent (the outcome of the first affects the second)

With replacement, the sample space remains constant: drawing 2 cards with replacement gives 52 × 52 = 2,704 outcomes.