AMC 8 · 2004 · #4

Grade 3 counting
combinations-basicsystematic-enumeration systematic-enumerationcomplementary-counting ↑ Prerequisites: systematic-enumeration
📏 Short solution 💡 1 insight
📘 View easy version →
Problem
From the four players Lance, Sally, Joy, and Fred, three are picked to start. In how many different ways can the three starters be chosen?

Pick an answer.

(A)
2
(B)
4
(C)
6
(D)
8
(E)
10

AMC 8 2004 problem © Mathematical Association of America (MAA AMC). Reproduced for educational use.

How to solve
Strategy Make a Systematic List

With only 4 players and groups of 3, the whole answer fits on one short list. Tool #2 (Make a Systematic List) is the kid-friendly way to count: pick a fixed order for the players, then write each possible trio once. This avoids Tool #13 (Algebra) and the C(4, 3) formula — neither is needed when the entire answer space has at most a handful of outcomes. A clean shortcut also drops out of the list: choosing 3 to keep is the same as choosing 1 to leave out, so the count must equal the number of players, 4.

1STEP 1

Fix an order for the four players and give them short labels: L (Lance), S (Sally), J (Joy), F (Fred).

players = {L, S, J, F}
2STEP 2

For each player, leave that one out and group the other three: {S,J,F}, {L,J,F}, {L,S,F}, {L,S,J}.

{S, J, F}, {L, J, F}, {L, S, F}, {L, S, J}
3STEP 3

Four groups appear, one per player left out — that matches choice (B).

4 trios → (B)
Answer
4
The answer must be at least 1 (one valid trio exists) and at most 4 × 3 × 2 = 24 (the count if order mattered). Since each unordered trio of 3 players can be written in 3 × 2 × 1 = 6 ordered ways, the unordered count is 24 ÷ 6 = 4, matching (B). The trap choice (C) 6 comes from counting ordered pairs from 4 players (4 × 3 ÷ 2) instead of unordered triples; (D) 8 doubles the answer as if order mattered for 2 of the slots; (E) 10 is C(5, 3), the right formula with the wrong number of players.
💡Key takeaway

When there are only a few players, writing out every possible group beats any formula — and noticing that picking 3 to play is the same as picking 1 to sit makes the count obvious. With that shift, this AMC 8 problem becomes a Grade 3 systematic-counting exercise.