AMC 10 · 2023 · #12

Grade 4 number-theory
divisibility-rulesdigit-decompositionsystematic-enumerationmodular-arithmetic caseworksystematic-enumerationidentify-subproblems ↑ Prerequisites: divisibility-rulesdigit-decomposition
📏 Long solution 💡 3 insights
📘 View easy version →
Problem
Count the three-digit integers N that satisfy two conditions simultaneously: N itself is a multiple of 7, and when you reverse N's digits the resulting number is a multiple of 5.

Pick an answer.

(A)
13
(B)
14
(C)
15
(D)
16
(E)
17

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

How to solve
Strategy Identify Subproblems

Two conditions act on different digits, so Tool #7 (Identify Subproblems) splits the work: first use the reversal-divisibility-by-5 rule to pin down the hundreds digit of N, then use divisibility by 7 to count how many of the resulting three-digit numbers survive. The divisibility-by-5 subproblem collapses to a single hundreds digit because a ≠ 0. Tool #2 (Systematic List) underpins step two — listing multiples of 7 in the locked-down range, then using Tool #3 (Eliminate) to cross-check the final count against the choices.

1STEP 1

Write N as abc; reversed it's cba, whose units digit is a. Divisible by 5 forces that digit to 0 or 5, so a ∈ {0, 5}.

a ∈ {0, 5}
2STEP 2

A three-digit number's hundreds digit can't be 0, so a must be 5 — every valid N lies in 500 to 599.

a = 5 → 500 ≤ N ≤ 599
3STEP 3

Divide to find the first multiple of 7 at or above 500: 500 ÷ 7 = 71 r 3, so it's 7 × 72 = 504.

5007\frac{500}{7} ⌉ = 72, 7 × 72 = 504
4STEP 4

Same for the top end: 599 ÷ 7 = 85 r 4, so the largest multiple of 7 at or below 599 is 7 × 85 = 595.

5997\frac{599}{7} ⌋ = 85, 7 × 85 = 595
5STEP 5

List the survivors in order: 7 × 72, 7 × 73, …, 7 × 85 — an arithmetic run indexed by 72 to 85.

504, 511, 518, 525, 532, 539, 546, 553, 560, 567, 574, 581, 588, 595
6STEP 6

Count consecutive integers from 72 to 85: 85 - 72 + 1 = 14.

85 - 72 + 1 = 14
7STEP 7

Cross-check 504: reversal 405 ends in 5 (÷5 ✓) and 504 = 7 × 72 (÷7 ✓) — both hold, matching choice (B).

504 → 405 = 5 × 81; 504 = 7 × 72 → (B)
Answer
14
Sanity check on the count: between 500 and 599 the multiples of 7 should number roughly 1007\frac{100}{7} ≈ 14.3, so 14 is the right magnitude. End-point check: 504 reverses to 405 = 5 × 81 and 595 reverses to 595 itself (palindrome multiple of 5 · 7 = 35, since 595 = 17 × 35), both pass. The first and last entries of the list are real, no boundary error.
💡Key takeaway

Two divisibility conditions split into two small steps: the "reversed is a multiple of 5" rule pins down the leading digit (it has to be 5), and then you just count the multiples of 7 between 500 and 599 — fourteen of them. Grade 4 divisibility rules carry the whole problem.