AMC 10 · 2011 · #16

Grade 7 counting
graph-coloringrecursive-sequencepermutations-basic complementary-countingcasework ↑ Prerequisites: permutations-basic
📏 Long solution 💡 3 insights
Problem
Only the diagonal-joined corners of a five-sided figure must differ in colour. Count the colourings.

Pick an answer.

(A)
2520
(B)
2880
(C)
3120
(D)
3250
(E)
3750
How to solve
Strategy Draw a Diagram

The words "ends of each diagonal differ" hide a clean shape, so Tool #1 (Draw a Diagram) is the first move: draw only the diagonals and follow them. They form a five-pointed star, and walking the star visits all five vertices and returns to the start — it is one closed loop (a ring) of 5. That turns the problem into "color a ring of 5 so neighbors differ, using 6 colors." Tool #2 (Make a Systematic List) counts the easy open-chain version with the multiplication counting principle. Tool #7 (Identify Subproblems) and Tool #16 (Count the Complement) then repair the one link the chain ignored by subtracting the bad cases, which shrinks the ring by one and gives a short recursion.

1STEP 1

Turn the diagonals into a ring

The diagonals redraw as a single ring.

ring order: A - C - E - B - D - (A)
2STEP 2

Count the open chain first

An open chain counts easily.

6 · 5⁴ = 3750
3STEP 3

Spot the one broken rule

Only the closing pair can break the rule.

(ring of 5) = 3750 - (chains with A = D)
4STEP 4

Glue the ends: a smaller ring

Gluing the ends leaves a smaller ring.

R₅ = 6 · 5⁴ - R₄
5STEP 5

Work down to the 4-ring

That smaller ring counts to 630.

R₄ = 6 · 5³ - 120 = 750 - 120 = 630
6STEP 6

Finish the 5-ring

Subtracting gives 3120, choice (C).

R₅ = 3750 - 630 = 3120 → (C)
Answer
3120
The open-chain count 3750 (choice E) is a clean upper bound, because it obeys four of the five diagonal rules and ignores only the closing one; the real answer must be a little smaller, and 3120 < 3750 by a sensible 630. Choice E is exactly the trap for anyone who forgets the last diagonal. Independent check with the cycle-coloring formula (k-1)ⁿ + (-1)ⁿ (k-1) for n = 5, k = 6: 5⁵ - 5 = 3125 - 5 = 3120. Both routes agree, confirming (C).
💡Key takeaway

Hidden inside the pentagon, the diagonals form one five-point ring, so the puzzle is just "color a loop of 5 with 6 colors so neighbors differ": count the easy open chain (6 · 5⁴ = 3750), then subtract the 630 that break the last link to land on 3120.

  • Turn the diagonals into a ring
  • Count the open chain first
  • Spot the one broken rule
  • Glue the ends: a smaller ring
  • Work down to the 4-ring
  • Finish the 5-ring