AMC 8 · 2013 · #8
Grade 7 probabilitycountingPick an answer.
AMC 8 2013 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.
With only 2³ = 8 outcomes, the whole sample space fits on one line — Tool #2 (Systematic List) is the cleanest move: list every 3-toss sequence in a fixed order, then circle the ones that contain HH. Tool #16 (Complement) is held in reserve as a sanity check in Review: counting the outcomes that do NOT contain HH is also short, and the two counts must add to 8.
Each toss is H or T and the three tosses are independent, so the sample space has 8 equally likely outcomes.
Setting up a uniform sample space for a compound event is exactly the Grade 7 "organized list for compound events" move.
7.SP.C.8Make A Systematic ListList every sequence in a fixed order: read each as a binary number (T = 0, H = 1) and count from 000 up to 111 so none is missed.
Tool #2's golden rule: pick an ordering and stick to it. Counting from 000 to 111 guarantees all 8 sequences appear exactly once.
7.SP.C.8Make A Systematic ListScan each string and mark it a hit if two H's sit next to each other, otherwise a miss.
Defining the event by checking each outcome against the rule is the Grade 7 "develop a probability model" idea — every outcome gets a yes/no label.
7.SP.C.7Make A Systematic ListThe hits are THH, HHT, HHH — 3 favorable out of 8 equally likely sequences, so the probability is , choice (C).
For a uniform sample space, probability is just (favorable count) / (total count) — the basic Grade 7 probability formula.
7.SP.C.7Make A Systematic ListWhen the sample space is small, just list every outcome neatly — Grade 7 probability is mostly careful counting!