AMC 10 · 2004 · #8

Grade 4 arithmetic
invariant-monovariant pattern-recognitionsystematic-enumeration ↑ Prerequisites: multi-digit-arithmetic
📏 Medium solution 💡 2 insights
📘 View easy version →
Problem
Players A, B, and C start with 15, 14, and 13 tokens, respectively. Each round, whoever currently has the most tokens gives one token to each of the other two players and throws one token into a discard pile. The game stops the moment any player has no tokens left. How many rounds are played?

Pick an answer.

(A)
36
(B)
37
(C)
38
(D)
39
(E)
40

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

How to solve
Strategy Look for a Pattern

Simulating 37 rounds one by one would work but is slow and error-prone. Instead, play just the first few rounds carefully as a systematic list (Tool #2) and watch what happens over one full turn of leadership. The three starting totals 15,14,13 take turns being the leader, and after three rounds every player has lost exactly 1 token while the ordering resets. That repeating three-round cycle is the pattern (Tool #5): every 3 rounds the whole board slides down by 1. Once you see it, you jump straight to the near-empty state instead of listing 37 lines, then play out only the final round by hand.

1STEP 1

Play the first three rounds

Track (A,B,C): each round the leader loses 3 and the other two gain 1. (15,14,13)→(12,15,14)→(13,12,15)→(14,13,12).

(15,14,13)→(12,15,14)→(13,12,15)→(14,13,12)
2STEP 2

Spot the three-round cycle

Three rounds on, every pile is 1 smaller and A leads again, so after 3k rounds the totals are (15-k, 14-k, 13-k).

after 3k rounds: (15-k, 14-k, 13-k)
3STEP 3

Jump to the nearly-empty state

Smallest pile C hits 1 when 13-k=1, so k=12. After 3×12=36 rounds the totals are (3,2,1) — nobody is empty yet.

13-k=1→ k=12, 3×12=36 rounds→(3,2,1)
4STEP 4

Play the final round

At (3,2,1) leader A holds exactly 3, gives all of them away and lands on 0, so the game ends at 36+1=37 rounds, choice (B).

(3,2,1) → (0,3,2)→ 36+1=37 → (B)
Answer
37
Every round removes exactly 1 token from the game (-3 for the leader, +1 each for the other two). The players start with 15+14+13=42 tokens total. After 37 rounds, 37 tokens are gone, leaving 42-37=5 tokens — and indeed the final state (0,3,2) has 0+3+2=5 tokens. The bookkeeping matches, and 37 is choice (B).
💡Key takeaway

When a process repeats in a cycle, find how much changes each cycle and multiply — then you only have to play out the last little bit by hand.

  • Play the first three rounds
  • Spot the three-round cycle
  • Jump to the nearly-empty state
  • Play the final round