Sample space: The set of all possible outcomes of an experiment. For two coin flips: {HH, HT, TH, TT}
Tree diagram: A visual representation showing all possible outcomes of sequential events.
- Start with initial node
- Draw branches for first event outcomes
- From each first-event outcome, draw branches for second event outcomes
- Continue for all stages
- List all final outcomes
First flip: Head (H) or Tail (T)
Second flip: Head (H) or Tail (T)
All possible outcomes: {HH, HT, TH, TT}
Number of outcomes: 4
Each path from start to end represents one outcome
All outcomes are equally likely with probability 1/4
The sample space for flipping a coin twice is {HH, HT, TH, TT} with 4 equally likely outcomes.
• Counting Principle: For independent events, multiply possibilities: 2 × 2 = 4 outcomes
• Tree Structure: Each level represents one stage of the experiment
• Complete Coverage: Every possible outcome is represented in the tree
Compound experiment: An experiment consisting of multiple stages. Sample space includes ordered pairs of outcomes from each stage.
First event: Roll a die (6 outcomes: 1, 2, 3, 4, 5, 6)
Second event: Flip a coin (2 outcomes: H, T)
Total outcomes = 6 × 2 = 12
{(1,H), (1,T), (2,H), (2,T), (3,H), (3,T), (4,H), (4,T), (5,H), (5,T), (6,H), (6,T)}
The sample space contains 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)}
• Counting Principle: For independent events, total outcomes = m × n
• Ordered Pairs: Each outcome is represented as (die result, coin result)
• Systematic Listing: Organize outcomes in a logical order
Spinner experiment: Each spin is independent, and each color has equal probability of 1/3.
First spin: Red (R), Blue (B), or Green (G)
Second spin: Red (R), Blue (B), or Green (G)
Using counting principle: 3 × 3 = 9 outcomes
{(R,R), (R,B), (R,G), (B,R), (B,B), (B,G), (G,R), (G,B), (G,G)}
The sample space contains 9 outcomes: {(R,R), (R,B), (R,G), (B,R), (B,B), (B,G), (G,R), (G,B), (G,G)}
• Equal Sections: Each color has equal probability of 1/3
• Independence: First spin doesn't affect second spin
• Counting Principle: Total outcomes = 3 × 3 = 9
Sample space: The set of all possible outcomes of an experiment
Tree diagram: A branching diagram showing all possible outcomes of sequential events
Counting principle: For independent events, multiply the number of outcomes
Event: A specific outcome or set of outcomes
Outcome: A possible result of an experiment
- Identify the experiment: Determine what actions are being performed
- Count possible outcomes: For each stage of the experiment
- Apply counting principle: Multiply the number of outcomes
- Construct tree diagram: Show all possible paths
- List sample space: Write all possible outcomes
• Counting Principle: Total Outcomes = n₁ × n₂ × ... × nₖ
• Tree Diagram: Each path represents one outcome
• Sample Space: Contains all possible outcomes
• For n identical stages with k outcomes: kⁿ total outcomes
Multi-stage experiment: An experiment with more than two stages. Each stage contributes to the total number of outcomes.
Stage 1: Flip coin (H or T) = 2 outcomes
Stage 2: Roll die (1, 2, 3, 4, 5, 6) = 6 outcomes
Stage 3: Flip coin (H or T) = 2 outcomes
Total outcomes = 2 × 6 × 2 = 24 outcomes
{(H,1,H), (H,1,T), (H,2,H), (H,2,T), ..., (T,6,H), (T,6,T)}
Complete set: 24 ordered triples
The sample space contains 24 outcomes: {(H,1,H), (H,1,T), (H,2,H), (H,2,T), (H,3,H), (H,3,T), (H,4,H), (H,4,T), (H,5,H), (H,5,T), (H,6,H), (H,6,T), (T,1,H), (T,1,T), (T,2,H), (T,2,T), (T,3,H), (T,3,T), (T,4,H), (T,4,T), (T,5,H), (T,5,T), (T,6,H), (T,6,T)}
• Multi-stage Counting: For independent stages, multiply outcomes: 2 × 6 × 2 = 24
• Ordered Triples: Each outcome is represented as (coin1, die, coin2)
• Systematic Approach: Work through each stage methodically
With replacement: After drawing a marble, it's put back, so probabilities remain constant for each draw.
Bag: 2 red, 1 blue (total 3)
P(red) = 2/3, P(blue) = 1/3
With replacement: probabilities stay the same
Exactly one red means: RB or BR
P(RB) = 2/3 × 1/3 = 2/9
P(BR) = 1/3 × 2/3 = 2/9
P(exactly one red) = P(RB) + P(BR) = 2/9 + 2/9 = 4/9
The probability of drawing exactly one red marble is 4/9.
• With Replacement: Probabilities remain constant
• Multiplication Rule: For paths, multiply probabilities along the path
• Addition Rule: For multiple favorable outcomes, add their probabilities
Sample space: The set of all possible outcomes of an experiment
Tree diagram: A visual tool that shows all possible outcomes of sequential events
Counting principle: For independent events, the total number of outcomes is the product of outcomes at each stage
Event: A specific outcome or collection of outcomes
Outcome: A possible result of an experiment
- Identify the experiment: Determine what actions are being performed
- Count outcomes per stage: For each stage of the experiment
- Apply counting principle: Multiply the number of outcomes at each stage
- Construct tree diagram: Start from root and branch out systematically
- List sample space: Write all possible outcomes as ordered sets
• Counting Principle: Total Outcomes = n₁ × n₂ × ... × nₖ
• Tree Diagram: Each path from root to leaf represents one outcome
• Probability Along Path: Multiply probabilities at each branch
• Probability of Multiple Paths: Add probabilities of favorable paths
• For n identical stages with k outcomes: kⁿ total outcomes
Sample Space: The set of all possible outcomes of an experiment. It's usually denoted by S or Ω. For example, flipping a coin once: S = {H, T}. For flipping a coin twice: S = {HH, HT, TH, TT}.
Tree Diagram: A visual representation that shows all possible outcomes of sequential events. Each branch represents a possible outcome, and each path from root to leaf represents a complete sequence of outcomes.
Experiment: Any process that produces an observable outcome. It can be single-stage (one action) or multi-stage (multiple actions).
Outcome: A specific result of an experiment. For example, getting "Heads" when flipping a coin is an outcome.
Event: A subset of the sample space. For example, getting at least one head when flipping two coins is an event containing {HH, HT, TH}.
Counting Principle: If one event can occur in m ways and a second event can occur independently in n ways, then the two events can occur in m × n ways. For k stages: n₁ × n₂ × ... × nₖ ways.
Tree Construction Rule: Each level of the tree corresponds to one stage of the experiment. Each branch from a node represents a possible outcome at that stage.
Path-to-Outcome Rule: Each complete path from the starting point to an endpoint represents one specific outcome in the sample space.
Probability Along Paths: To find the probability of a specific sequence, multiply the probabilities along the path.
Probability of Events: To find the probability of an event, add the probabilities of all outcomes that make up the event.
Creating a Sample Space:
- Identify all stages of the experiment
- List all possible outcomes for each stage
- Apply the counting principle to determine total number of outcomes
- Systematically list all possible combinations
- Verify completeness and correctness
Constructing a Tree Diagram:
- Start with a root node representing the beginning
- Draw branches for the first stage outcomes
- From each first-stage outcome, draw branches for second stage outcomes
- Continue for all stages
- Label endpoints with complete outcomes
Simple Example (Single Stage): Rolling a die once
Sample space: S = {1, 2, 3, 4, 5, 6}, Total outcomes: 6
Intermediate Example (Two Stages): Flipping a coin, then rolling a die
Sample space: S = {(H,1), (H,2), ..., (H,6), (T,1), ..., (T,6)}, Total outcomes: 2 × 6 = 12
Advanced Example (Three Stages): Flipping a coin, rolling a die, flipping another coin
Sample space: S = {(H,1,H), (H,1,T), ..., (T,6,T)}, Total outcomes: 2 × 6 × 2 = 24
Tips:
- Use tree diagrams for experiments with 2-3 stages to visualize all outcomes
- For more complex experiments, rely on the counting principle
- Always label tree branches with outcomes and probabilities when solving probability problems
- Systematically list outcomes to avoid missing any
- Verify that the number of outcomes matches the counting principle calculation
Common Mistakes:
- Missing outcomes in the sample space
- Double-counting outcomes
- Incorrectly applying the counting principle to dependent events
- Confusing sample space with events
- Forgetting to account for order in ordered pairs
SAMPLE SPACE = ALL POSSIBLE OUTCOMES
TREE DIAGRAM = VISIBLE PATH OF EVENTS
COUNTING PRINCIPLE = MULTIPLY AT EACH STAGEPROBABILITY = MULTIPLY ALONG PATHS, ADD ACROSS OUTCOMES
WITH REPLACEMENT = PROBABILITIES STAY CONSTANT
WITHOUT REPLACEMENT = PROBABILITIES CHANGE
Questions & Answers
Question: When should I use a tree diagram versus just listing the sample space? They seem to give the same information.
Answer: Great question! Here's when to use each:
- Tree Diagram: Best for experiments with 2-3 stages, especially when you need to visualize the process or calculate probabilities along the way
- Listing Sample Space: Best for simple experiments or when you just need the final set of outcomes
Use tree diagrams when:
- You're calculating probabilities for specific sequences
- The experiment has a clear sequential structure
- You want to visualize the process step-by-step
Use direct listing when:
- The sample space is small and simple
- You only need to know the possible outcomes
- The experiment is symmetric or follows a clear pattern
Question: How do I apply the counting principle when events aren't independent? For example, drawing marbles without replacement.
Answer: The counting principle works differently for dependent events:
- Independent Events: Same number of choices at each stage (e.g., with replacement)
- Dependent Events: Number of choices changes at each stage (e.g., without replacement)
Example - Independent (with replacement):
Bag: 3 red, 2 blue marbles. Draw 2 marbles with replacement.
Stage 1: 5 choices, Stage 2: 5 choices (still 5 because we replaced)
Total outcomes: 5 × 5 = 25
Example - Dependent (without replacement):
Same bag, draw 2 marbles without replacement.
Stage 1: 5 choices, Stage 2: 4 choices (only 4 left after first draw)
Total outcomes: 5 × 4 = 20
For dependent events, the counting principle still applies, but you adjust the number of choices at each stage based on previous outcomes.
Question: How do I use tree diagrams to calculate probabilities, not just list outcomes?
Answer: Tree diagrams are excellent for probability calculations! Here's how:
- Label each branch: Write the probability of each outcome on its branch
- Multiply along paths: To find probability of a specific sequence, multiply probabilities along that path
- Add across outcomes: To find probability of an event, add probabilities of all paths that satisfy the event
Example: Flip a coin (P(H)=1/2, P(T)=1/2), then roll a die (P(each number)=1/6).
Probability of getting (H, 3): P(H) × P(3) = 1/2 × 1/6 = 1/12
Probability of getting a head followed by an even number: P(H,2) + P(H,4) + P(H,6) = 1/12 + 1/12 + 1/12 = 3/12 = 1/4
Tree diagrams make it visual to see which paths contribute to your desired event and how to calculate their probabilities.