Sample Space (S): The set of all possible outcomes of an experiment.
Simple Event: An event consisting of a single outcome.
Compound Event: An event consisting of multiple outcomes.
Tree Diagram: A visual representation showing all possible outcomes of a sequence of events.
Listing Method: Writing out all possible outcomes systematically.
- Identify the Experiment: Determine what action(s) are being performed.
- List Possible Outcomes: For each stage, list all possible results.
- Construct Sample Space: Use listing or tree diagram to organize outcomes.
- Count Total Outcomes: Count all possible outcomes in the sample space.
- Identify Events: Determine which outcomes belong to specific events.
• Fundamental Counting Principle: If one event has m outcomes and another has n outcomes, together they have m×n outcomes.
• Sample Space Size: For independent events, multiply individual outcome counts.
• Order Matters: (H,T) ≠ (T,H) unless specified otherwise.
Simple Event: One coin flip has outcomes {H, T}
Compound Event: Two coin flips have outcomes {HH, HT, TH, TT}
- Identify outcomes for single event: H or T
- For compound event, consider all combinations
- Use ordered pairs to represent sequences
Possible outcomes: Head (H) or Tail (T)
Sample Space: S = {H, T}
First flip: H or T
Second flip: H or T
Combine systematically: HH, HT, TH, TT
Start with first flip → H → Second flip: H or T → HH, HT
Start with first flip → T → Second flip: H or T → TH, TT
Two coins: S = {HH, HT, TH, TT} (4 outcomes)
One coin: {H, T}, Two coins: {HH, HT, TH, TT}
• Fundamental Counting Principle: 2 × 2 = 4 total outcomes
• Order matters: HT ≠ TH
• Systematic listing prevents missing outcomes
Single Die: Outcomes {1, 2, 3, 4, 5, 6}
Two Dice: Ordered pairs representing both dice
Die shows faces numbered 1 through 6
Sample Space: S = {1, 2, 3, 4, 5, 6}
First die: 1, 2, 3, 4, 5, 6
Second die: 1, 2, 3, 4, 5, 6
Total outcomes: 6 × 6 = 36
{(1,1), (1,2), (1,3), (1,4), (1,5), (1,6),
(2,1), (2,2), ..., (2,6),
...,
(6,1), (6,2), ..., (6,6)}
Two dice: 36 ordered pairs
One die: {1, 2, 3, 4, 5, 6}, Two dice: 36 outcomes
• Fundamental Counting Principle: 6 × 6 = 36
• Each die is independent of the other
• (1,2) ≠ (2,1) - order matters
Spinner: {Red, Blue, Green, Yellow}
Coin: {H, T}
Combined: All possible pairs
Spinner: R, B, G, Y (4 outcomes)
Coin: H, T (2 outcomes)
Total outcomes = 4 × 2 = 8 outcomes
Red and H, Red and T
Blue and H, Blue and T
Green and H, Green and T
Yellow and H, Yellow and T
S = {(R,H), (R,T), (B,H), (B,T), (G,H), (G,T), (Y,H), (Y,T)}
• Fundamental Counting Principle: 4 × 2 = 8
• Independent events: spinner result doesn't affect coin
• Use ordered pairs to represent combined outcomes
Level 1: First flip (H or T)
Level 2: Second flip (H or T)
Level 3: Third flip (H or T)
- Start with initial state
- Draw branches for each possible outcome at each stage
- Follow paths to get final outcomes
Start → H or T (2 branches)
H → H or T (2 more branches)
T → H or T (2 more branches)
Each of 4 positions splits into 2 more branches
Total terminal outcomes: 2³ = 8
HHH, HHT, HTH, HTT, THH, THT, TTH, TTT
8 outcomes: {HHH, HHT, HTH, HTT, THH, THT, TTH, TTT}
• Power rule: n independent binary events → 2ⁿ outcomes
• Tree diagrams visualize all possible paths
• Systematic construction prevents omissions
Each Question: True (T) or False (F)
Three Questions: Sequence of 3 T/F choices
Each question: T or F (2 outcomes per question)
Question 1: 2 choices
Question 2: 2 choices
Question 3: 2 choices
Total: 2 × 2 × 2 = 2³ = 8 outcomes
Start with all T: TTT
Change last to F: TTF
Change second to F: TFT, TFF
Change first to F: FTT, FTF, FFT, FFF
Count: 8 outcomes listed
Expected: 2³ = 8 ✓
All possible answer combinations: {TTT, TTF, TFT, TFF, FTT, FTF, FFT, FFF}
• For n binary questions: 2ⁿ possible answer sets
• Systematic enumeration ensures completeness
• Each position represents one question