AMC 10 · 2020 · #16
Grade 7 probabilityPick an answer.
Tool #2 (Systematic List): the 4-draw history is a length-4 string of R/B; only the C(4, 2) = 6 strings with exactly two R and two B reach the 3R-3B endpoint. List them in lex order and compute each probability. Tool #5 (Pattern): once we compute one or two strings, the numerator is always 1 · 2 · 1 · 2 = 4 and the denominator is always 2 · 3 · 4 · 5 = 120 — every string has probability 4/120 = 1/30. Tool #9 (Easier Problem): trying the very small RRBB case first reveals the pattern that makes Tool #5 work.
Check the denominators
The urn grows by one, fixing the denominators.
After k steps the urn grows by exactly k balls — the totals are fixed.
5.NF.B.4Solve An Easier Related ProblemCount the orderings
Count orderings with two of each.
Choose which 2 of the 4 slots are R.
7.SP.C.8Make A Systematic ListCompute one ordering
Compute one ordering's probability.
Multiply along the path — the four conditional probabilities.
7.SP.C.8Make A Systematic ListCompute another ordering
Try a different ordering too.
Different ordering but same numerator product — pattern alert.
5.NF.B.4Look For A PatternSee they all agree
The numerator is order-independent.
Each color's first pick uses '1 in urn', the second uses '2 in urn' — colors don't interfere.
Each colour's first pick meets the same small urn and its second meets the same larger one, so the colours do not interfere.
▸ Why?
Every ordering multiplies the same numbers in a different order, so all of them give the same value.
▸ Why?
The orderings are separate choices from the same pool, so counting them is a plain combination.
Add them up
Multiplying and adding gives one fifth.
Add the 6 equal pieces.
7.SP.C.8Make A Systematic ListThis AMC 12 problem only needs Grade 7 list-the-cases probability you already know — every ordering of 2 R picks and 2 B picks has probability (1 · 2 · 1 · 2)/(2 · 3 · 4 · 5) = 1/30. There are 6 orderings, so the answer is 6 · 1/30 = 1/5, choice (B).