AMC 10 · 2023 · #16

Grade 6 number-theory
modular-arithmeticgcdsystematic-enumerationdigit-sum modular-arithmeticsystematic-enumerationextreme-principle ↑ Prerequisites: modular-arithmeticmultiples
📏 Long solution 💡 4 insights
Problem
In one country the coins are worth 6, 10, and 15 cents. Any number of each may be used, and no change is given. Some prices can be paid exactly and some cannot. Find the sum of the digits of the most expensive price that cannot be paid exactly.

Pick an answer.

(A)
8
(B)
10
(C)
7
(D)
11
(E)
9
How to solve
Strategy Organize Information in More Ways

The famous two-coin formula ab - a - b is not available: it needs exactly two coprime values, and here every pair shares a factor (gcd(6,10) = 2, gcd(6,15) = 3, gcd(10,15) = 5). With three coins there is no formula at all, so the answer has to be built. Tool #15 (Organize Information in More Ways) is the whole solve: instead of listing prices 1, 2, 3, … in size order, sort every price by its remainder on division by 6, giving six lanes. Adding one 6-cent coin moves a price up its own lane and never leaves it, so each lane is unpayable up to some threshold and payable forever after. Tool #13 (Convert to Algebra) writes payability as N = 6a + 10b + 15c; tool #2 (Make a Systematic List) finds the cheapest payable price in each of the six lanes; tool #14 (Extreme Principle) picks the largest of the six per-lane gaps; tool #6 (Guess and Check) confirms 29 itself fails while 30 through 35 all succeed; tool #3 (Eliminate Possibilities) reads the digit sum against the five choices.

1STEP 1

Write payability as an equation

Write payability as an equation.

N = 6a + 10b + 15c, a, b, c ∈ {0, 1, 2, 3, …}
2STEP 2

The six-cent coin is a one-way step

Once payable, it stays payable.

N payable → N + 6, N + 12, N + 18, … all payable
3STEP 3

Which coins change lanes

The remainder splits values into lanes.

6a + 10b + 15c ≡ 10b + 15c (mod 6)
4STEP 4

Cheapest entry per lane

Find each lane's cheapest entry.

0 → lane 0, 10 → lane 4, 15 → lane 3, 20 → lane 2, 25 → lane 1, 35 → lane 5
5STEP 5

Each lane's last gap

The last gap sits six below the entry.

x = max{4, 9, 14, 19, 29} = 29
6STEP 6

Check the boundary

Confirm everything above works.

30 = 15 · 2, 31 = 6 + 10 + 15, 32 = 6 · 2 + 10 · 2, 33 = 6 · 3 + 15, 34 = 6 · 4 + 10, 35 = 10 · 2 + 15
7STEP 7

Add the digits

Adding the digits gives 11.

x = 29 → 2 + 9 = 11 → (D)
Answer
11
Sweep the small prices by hand and the picture matches. The unpayable prices are 1, 2, 3, 4, 5, 7, 8, 9, 11, 13, 14, 17, 19, 23, 29 — fifteen of them, and 29 really is the last. Above it, 30 through 35 are all payable, and every larger price is one of those plus 6-cent coins, so the list of holes stops there for good. The six lane thresholds 0, 10, 15, 20, 25, 35 also pass a smell test: they are exactly the amounts you can build from 10s and 15s, and each one is the first of its remainder to appear. The answer choices are clustered at 7, 8, 9, 10, 11, which is the range of digit sums for two-digit numbers near 29, and each rival encodes a specific slip: 10 for stopping at 19 (forgetting lane 5), 8 for reporting 35 instead of 35 - 6, 7 for stopping at 25. Reporting 11 means the last lane was found and the 6-step back was taken.
💡Key takeaway

Because one coin is worth 6, sort every price into six lanes by its remainder after dividing by 6. A lane opens at its cheapest payable price and stays open forever, so the very last unpayable price sits 6 below the door of the lane that opens last: 35 - 6 = 29, and 2 + 9 = 11.

  • Write payability as an equation
  • A 6-coin is a one-way step
  • Only 10s and 15s change lanes
  • Cheapest entry in each lane
  • Each lane's last gap is 6 below
  • Check 29 fails and 30 up works
  • Add the digits