Sample space: The set of all possible outcomes of a probability experiment.
- Identify all possible outcomes for each stage
- List outcomes systematically to avoid duplicates
- Count the total number of outcomes
- Verify all possibilities are included
First flip: H (heads) or T (tails)
Second flip: H (heads) or T (tails)
HH (heads, heads)
HT (heads, tails)
TH (tails, heads)
TT (tails, tails)
Sample space S = {HH, HT, TH, TT}
Number of outcomes = 4
The sample space is {HH, HT, TH, TT} with 4 possible outcomes.
• 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
Tree diagram: A visual representation showing all possible outcomes of a sequence of events.
Rolling a die: 6 possible outcomes (1, 2, 3, 4, 5, 6)
From each die outcome, branch to 2 coin outcomes (H, T)
(1,H), (1,T), (2,H), (2,T), (3,H), (3,T), (4,H), (4,T), (5,H), (5,T), (6,H), (6,T)
Using fundamental counting principle: 6 × 2 = 12 outcomes
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).
• 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)
Repeated experiment: Performing the same experiment multiple times, creating a sequence of outcomes.
Single spin: A, B, or C
Three spins: 3 × 3 × 3 = 27 total outcomes
AAA, AAB, AAC, ABA, ABB, ABC, ACA, ACB, ACC, BAA, BAB, BAC, ...
For n repetitions of an experiment with k outcomes: k^n total outcomes
Here: 3^3 = 27 outcomes
There are 27 possible outcomes when spinning the spinner 3 times. The sample space includes all combinations of 3 letters from {A, B, C}.
• 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
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.
- Listing method: Write out all possible outcomes systematically
- Tree diagram: Visual representation showing all possible paths
- Grid method: Use tables for experiments with two stages
- Counting principle: Calculate total outcomes without listing all
• 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)
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.
- Start with root: Begin the diagram with initial state
- Branch outcomes: Draw branches for each possible outcome of first event
- Continue branching: From each outcome, branch for next event's outcomes
- Label outcomes: Mark each branch with the corresponding outcome
- Count paths: Each path from root to terminal node represents a possible outcome
• 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
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.