AMC 8 · 2006 · #23

Grade 6 number-theory
modular-arithmeticlcmdivisibility-rulessystematic-enumeration systematic-enumerationpattern-recognition ↑ Prerequisites: modular-arithmeticlcmdivisibility-rules
📏 Short solution 💡 3 insights
Problem
Find the smallest positive whole number N that leaves remainder 4 when divided by 6 and remainder 3 when divided by 5. Then report the remainder when that N is divided by 7.

Pick an answer.

(A)
0
(B)
1
(C)
2
(D)
3
(E)
5

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

How to solve
Strategy Make a Systematic List

Each remainder condition pins N to a clear arithmetic sequence — "start at 4, step by 6" for the first, "start at 3, step by 5" for the second — so Tool #2 (Systematic List) writes both sequences cleanly and the first shared value is the smallest N. Tool #5 (Look for a Pattern) sharpens the search: the gap to the next multiple of 6 is 2, and the gap to the next multiple of 5 is also 2, so N + 2 must be a common multiple of 5 and 6. That pattern means we only need the smallest common multiple of 5 and 6, which is 30, and then N = 30 - 2 = 28. Both tools land on the same N, after which the final remainder by 7 is one division.

1STEP 1

The numbers leaving remainder 4 when divided by 6 start at 4 and grow by 6.

4, 10, 16, 22, 28, 34, 40, …
2STEP 2

The numbers leaving remainder 3 when divided by 5 start at 3 and grow by 5.

3, 8, 13, 18, 23, 28, 33, …
3STEP 3

Scanning both lists in order, the first shared value is 28, so that is the smallest N.

{4, 10, 16, 22, 28, …} ∩ {3, 8, 13, 18, 23, 28, …} ∋ 28
4STEP 4

Dividing 28 by 7 gives exactly 4 with remainder 0.

28 ÷ 7 = 4 remainder 0 → (A)
Answer
0
Verify both original conditions on N = 28. Dividing by 6: 28 = 6 × 4 + 4, remainder 4 — matches. Dividing by 5: 28 = 5 × 5 + 3, remainder 3 — matches. So 28 really is a valid coin count, and no smaller positive integer appears in both lists, so it is the smallest. Dividing by 7 gives 28 = 7 × 4, remainder 0, so answer (A) is consistent.
💡Key takeaway

When a count leaves two awkward remainders, two short arithmetic lists usually meet within a few terms — and spotting that both shortfalls are the same number turns the search into a quick LCM.