AMC 8 · 2017 · #12

Grade 4 number-theory
modular-arithmeticlcmmultiplesdivisibility-rules easier-related-problemsystematic-enumeration ↑ Prerequisites: multiplesdivisibility-rules
📏 Medium solution 💡 3 insights
📘 View easy version →
Problem
Find the smallest positive integer N > 1 such that dividing N by 4, by 5, and by 6 each leaves a remainder of 1. Then say which of the given ranges contains N.

Pick an answer.

(A)
$2\text{ and }19$
(B)
$20\text{ and }39$
(C)
$40\text{ and }59$
(D)
$60\text{ and }79$
(E)
$80\text{ and }124$

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

How to solve
Strategy Solve an Easier Related Problem

Three simultaneous remainder conditions feel intimidating, but Tool #9 transforms the problem into something much easier: "N has remainder 1 when divided by d" is the same as saying "N - 1 is a multiple of d." So instead of hunting for N directly, we hunt for N - 1, which must be a common multiple of 4, 5, and 6 — pure 4th-grade multiples thinking. Tool #2 (Systematic List) then sweeps multiples of the largest divisor (6) in order and checks each against the other two conditions, which is faster than computing a formal LCM. Tool #3 (Eliminate) closes the problem by matching N against the five labeled ranges.

1STEP 1

Remainder 1 when divided by d means N - 1 is divisible by d, so we seek the smallest N - 1 that is a common multiple of 4, 5, and 6.

N - 1 is a multiple of 4, 5, and 6
2STEP 2

Sweep multiples of 6 — 6, 12, 18, ..., 60 — the first also divisible by 4 and 5 is 60, the smallest common multiple of 4, 5, 6.

6, 12, 18, 24, 30, 36, 42, 48, 54, 60 — 60 = 4 × 15 = 5 × 12 = 6 × 10
3STEP 3

Add 1 to undo the shift: N = 60 + 1 = 61. The next common multiple, 120, gives N = 121 — far bigger — so 61 is the smallest.

N = 60 + 1 = 61
4STEP 4

Test 61 against the ranges: it misses [2,19], [20,39], [40,59], and is below 80, so it lands in [60, 79] — choice (D).

60 < 61 < 79 → (D)
Answer
60 and 79
Quick check: 61 ÷ 4 = 15 remainder 1, 61 ÷ 5 = 12 remainder 1, 61 ÷ 6 = 10 remainder 1. All three remainder conditions hold. And 61 is greater than 1, so the "greater than 1" clause is satisfied. The only smaller candidate would come from a common multiple of 4, 5, 6 that is smaller than 60 — but our systematic list confirmed none exist. So N = 61 is genuinely the smallest, and it sits in the 60–79 range, matching (D).
💡Key takeaway

This AMC 8 problem only needs Grade 4 multiples and remainders you already know — "remainder 1" just means "one more than a multiple"!