AMC 10 · 2004 · #10
Grade 7 probabilityPick an answer.
AMC 10 2004 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.
"Same number of heads" is not one event but several rolled together: both show 0, both show 1, both show 2, or both show 3. That is a signal to break the problem into cases (Tool #7) — one subproblem per shared head-count — and add the results, since the cases cannot happen at the same time. Inside each case the coins are independent, so the count of matching flip-sequences is (ways A gets that many heads) × (ways B gets that many heads). A systematic list (Tool #2) sweeping k = 0, 1, 2, 3 makes sure no case is skipped or double-counted. Working in whole counts of equally likely sequences, then dividing by the total at the end, keeps the arithmetic clean.
Count all equally likely outcomes
Coin A's 3 flips give 8 sequences and coin B's 4 give 16; independent pairing makes 128 equally likely outcomes.
When each flip is a fair coin, every full sequence is equally likely, so probability is just a count of favorable sequences over the total.
7.SP.C.7Identify SubproblemsList the head-counts that can match
Coin A tops out at 3 heads, so the counts agree only at 0, 1, 2, or 3 — coin B's fourth head can never be matched.
Two amounts can only be equal at a value both are able to reach, so the extra fourth head on coin B is automatically out.
7.SP.C.8Identify SubproblemsCount matching sequences in each case
Independence lets you multiply inside a case: C(3, k) times C(4, k) gives 1, 12, 18, and 4 matching pairs.
For independent coins the favorable pairs are found by multiplying each coin's own count of ways.
For independent coins the favourable pairs are found by multiplying each coin's own count of ways.
▸ Why?
One coin's outcome tells you nothing about the other's, so the counts multiply.
▸ Why?
The head-count cases never happen together, so their counts add at the end.
Add the cases and form the probability
The four cases cannot overlap, so add: 1 + 12 + 18 + 4 = 35 matches out of 128, that is — choice (D).
Cases that cannot happen together add up, so the favorable counts stack into one numerator over the shared total.
7.SP.C.8Identify SubproblemsWhen two coin batches must match, handle one shared head-count at a time: multiply each batch's ways within a case, add the cases, and put it over all the equally likely outcomes.
- Count all equally likely outcomes
- List the head-counts that can match
- Count matching sequences in each case
- Add the cases and form the probability