AMC 8 · 2000 · #21
Grade 7 probabilitycountingPick an answer.
AMC 8 2000 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.
There are only 8 equally likely outcomes for the three coins combined, so Tool #2 (Make a Systematic List) lets us write them all down and count the matches directly. Tool #7 (Identify Subproblems) gives the cleaner path: split by Keiko's result (her 0 heads vs. her 1 head), and for each case count how many of Ephraim's 4 outcomes match. Two small counts beat one big enumeration.
Three independent fair tosses give 2 × 2 × 2 = 8 equally likely H/T sequences, each of probability .
Listing outcomes for a compound event is the Grade 7 standard for counting independent trials.
7.SP.C.8Make A Systematic ListSplit by Keiko's outcome: matching means Ephraim gets 0 heads when she does, or 1 head when she does — two disjoint cases.
Breaking the event into Keiko's two possible outcomes turns one hard count into two easy ones.
7.SP.C.8Identify SubproblemsCase 1 — both get 0 heads: Keiko 1 way (T), Ephraim 1 way (TT), giving 1 · 1 = 1 sequence (TTT).
With 0 heads forced everywhere, only the all-tails sequence works.
7.SP.C.8Make A Systematic ListCase 2 — both get 1 head: Keiko 1 way (H), Ephraim's head in either slot (HT, TH), so 1 · 2 = 2 sequences (HHT, HTH).
Choosing which of Ephraim's 2 positions is the head is the same systematic-list move as C(2, 1) = 2.
7.SP.C.8Make A Systematic ListAdd the case counts and divide by the sample space: 1 + 2 = 3 favorable out of 8 equally likely sequences.
Probability = favorable outcomes ÷ total equally likely outcomes — the Grade 7 uniform-model formula.
7.SP.C.7Make A Systematic ListWith only 8 outcomes for 3 coins, split by Keiko's result and count Ephraim's matches in each case — 1 + 2 = 3 matches out of 8 gives .