AMC 8 · 2003 · #16
Grade 4 countingPick an answer.
AMC 8 2003 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.
One seat has a special rule (driver) and the other three are unrestricted. Tool #7 (Identify Subproblems) says: handle the constrained seat first, then handle the rest as a separate, simpler subproblem. With the driver picked, the remaining seats become "arrange 3 people in 3 labeled seats," which Tool #13 (Count Smartly) finishes with the multiplication principle: multiply the number of choices at each step. Filling the most-restricted slot first is the standard counting move because it prevents over-counting later.
Subproblem 1 — the driver: only Bonnie or Carlo may drive, so the driver seat has exactly 2 choices.
Always start with the slot that has the fewest options — it locks in the hardest piece first.
4.OA.A.3Identify SubproblemsSubproblem 2 — the front passenger: 3 people remain and anyone may sit there, giving 3 choices.
With no rule blocking anyone, the count is simply "how many people are left."
4.OA.A.3Convert To AlgebraSubproblem 3 — the back-left seat: 2 people are left and either may sit, so 2 choices.
Each filled seat shrinks the leftover pool by one — the choices shrink in lockstep.
4.OA.A.3Convert To AlgebraSubproblem 4 — the back-right seat: just 1 person is left, so the seat is forced — 1 choice.
The last seat is forced once the other three are filled.
4.OA.A.3Convert To AlgebraCombine — the four picks are independent, so multiply the choices: 2 × 3 × 2 × 1 = 12 → (D).
The multiplication principle: when a task splits into independent steps, total arrangements = product of choices at each step.
4.OA.A.3Convert To AlgebraFill the strictest seat first, then multiply the leftover choices — that simple Grade 4 plan turns this AMC 8 counting problem into 2 × 3 × 2 × 1 = 12.