find the probability of a compound event by listing outcomes in an organized list or a tree diagram.
Phase 4: Build
Do Now. Match the Coins: a player flips two coins and wins if they match. Some people think there are only three outcomes: two heads, two tails, or one of each.
What is the probability that two coins match?
The reading opens over the lesson; close it to come back to exactly where you were.
Compound events. A compound event is made of two or more simple events, such as flipping two coins or spinning a spinner and then flipping a coin. To find its probability, we first need the whole sample space. If we miss outcomes, our probability will be wrong.
Organized lists and tree diagrams. An organized list writes outcomes in a pattern so none are missed. A tree diagram draws a branch for each outcome of the first event, then splits each branch for the second event. Each path from start to end is one outcome.
Worked example 1: Malik checks Match the Coins. Coin 1 has two branches, H and T. Each branch splits into H and T for coin 2. The paths are HH, HT, TH and TT, so there are 2 × 2 = 4 outcomes. The matches are HH and TT, so P(match) = 2/4 = 1/2. The booth is fair between “match” and “no match.”
Worked example 2: Elena checks Spin and Flip. The sample spinner has 4 equal sections: red, blue, green and yellow. Then the player flips a coin. Elena’s organized list: RH, RT, BH, BT, GH, GT, YH, YT. That is 4 × 2 = 8 equally likely outcomes. A player wins only with red and heads, so P(win) = 1/8 = 0.125 = 12.5%. P(not win) = 7/8.
A multiplication pattern. When the events do not affect each other, the number of outcomes is the product of the counts, and the probability of both happening is the product of the probabilities: P(red and heads) = 1/4 × 1/2 = 1/8. The tree shows why: half of the red branch is heads.
Random bits. Each bit from the NIST beacon is a 0 or a 1, like a coin. Three bits make 2 × 2 × 2 = 8 outcomes, from 000 to 111, so P(111) = 1/8.
Draw a tree or write an organized list for every question.
Put a tree or list on your booth card.
Draw the tree diagram or organized list for your team's booth. Circle the winning outcomes and write P(win) and P(not win). (Lucky Seven teams: draw only the first two branches today; we finish with a table in 2.20.)
Use the reading. Write the organized list of all outcomes for 3 random bits. What is the probability that all three bits are the same? Explain why a public beacon must give each bit the same chance of being 0 or 1.
Count every path, and the probability takes care of itself.
Exit ticket: Noah says that at Spin and Flip, P(red and heads) = 1/4 + 1/2 = 3/4. Explain his mistake using the tree, and give the correct probability.
Pacing: warm-up 5 minutes, reading 6, mini lecture 10, guided practice 13 (PhET included), independent 4, closure 2.
Likely misconceptions: treating HT and TH as one outcome (the warm-up); adding probabilities for “and” instead of multiplying; missing branches in a tree.
Supports: pre-drawn tree templates; two real coins of different kinds (a penny and a nickel) so students see that HT and TH differ. Stretch: a tree for 4 coins and P(exactly 2 heads) = 6/16 = 3/8.
Answer guide: 8; 3/8; 12; true; 7/8. PhET with 2 rows: LL (left bin) 1/4, LR or RL (middle) 1/2, RR (right) 1/4; results should be close after 100 balls. Explain: HT and TH are two outcomes, HH is one, so P(one of each) = 2/4 and P(two heads) = 1/4. Reading: 000, 001, 010, 011, 100, 101, 110, 111; P(all the same) = 2/8 = 1/4; if a bit favored 0 or 1, the numbers would not be fair for choosing or auditing. Exit ticket: “and” means one path on the tree, 1 of 8, so 1/4 × 1/2 = 1/8; adding gives more than either event alone, which cannot be right.
National Institute of Standards and Technology, Interoperable Randomness Beacons project page · U.S. government work, public domain
The National Institute of Standards and Technology (NIST) is a U.S. government science agency. Since 2011, NIST has run a project called the Randomness Beacon. A beacon is a public service that sends out fresh random numbers on a schedule, for example once a minute.
Each pulse from the beacon holds a new 512-bit random string. A bit is a single digit that is either 0 or 1. NIST builds each string by combining randomness from at least two separate random number generators. Every pulse is numbered, time-stamped and signed, and any past pulse can be looked up by anyone.
Why would anyone need public random numbers? The page says they help with auditability and transparency. Those words mean that people can check a process for themselves. One early supporter, the computer scientist Ron Rivest, pointed out that public randomness could help when auditing voting machines.
NIST also warns users never to use beacon values as secret passwords or keys, because everyone can see them. A random number that everyone can see is good for fair choosing, not for keeping secrets.
Source: National Institute of Standards and Technology, Interoperable Randomness Beacons project page (nist.gov)