AMC 10 · 2021 · #16

Grade 4 number-theory
digit-constraintsdivisibility-rulesdigit-sumsystematic-enumeration systematic-enumerationcasework ↑ Prerequisites: divisibility-rulesdigit-sum
📏 Medium solution 💡 3 insights
📘 View easy version →
Problem
An "uphill integer" is a positive integer whose digits strictly increase from left to right (like 1357 or 89). Count how many uphill integers are divisible by 15.

Pick an answer.

(A)
~4
(B)
~5
(C)
~6
(D)
~7
(E)
~8

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

How to solve
Strategy Make a Systematic List

Tool #9 (Easier Problem) — first cut the candidate pool by using the divisibility rules. "Divisible by 5" forces the last digit to be 0 or 5, but 0 as the last digit of an uphill integer would require negative previous digits — impossible. So the last digit must be 5, and every other digit comes from {1, 2, 3, 4}. That shrinks the universe from "all uphill integers" to "subsets of {1, 2, 3, 4} followed by 5." Tool #2 (Systematic List) then enumerates every such subset in order of size (empty, singletons, pairs, triples, the full set) and Tool #5 (Pattern — divisibility-by-3 rule) filters: keep only the ones whose digit sum is a multiple of 3. Count what survives.

1STEP 1

15 = 3 × 5, so divisible by 15 means divisible by both 3 and 5. An uphill integer can't end in 0, so its last digit must be 5.

15 = 3 × 5, gcd(3,5)=1; last digit = 5
2STEP 2

Ending in 5 with increasing digits, the earlier ones form a subset of {1, 2, 3, 4} in order — pick a subset, then append 5.

Choose a subset T ⊆ {1,2,3,4}; the integer is the digits of T in order, then 5
3STEP 3

Size 0 (just "5"): digit sum = 5. Not a multiple of 3. Skip.

5 → 5≢ 0 (mod 3)
4STEP 4

Size 1 (one digit before 5): 15, 25, 35, 45 have sums 6, 7, 8, 9; multiples of 3 are 15 and 45 — 2 found.

15{:} 1+5=6✓, 25{:} 7, 35{:} 8, 45{:} 4+5=9✓
5STEP 5

Size 2 (two digits before 5): the 6 subsets give sums 8, 9, 10, 10, 11, 12; only 135 and 345 clear 3 — 2 found.

135{:} 9✓, 345{:} 12✓ (others fail ÷ 3)
6STEP 6

Size 3 (three digits before 5): 1235, 1245, 1345, 2345 have sums 11, 12, 13, 14; only 1245 works — 1 found.

1245{:} 1+2+4+5=12✓
7STEP 7

Size 4 (all of 1, 2, 3, 4): 12345 has digit sum 15, divisible by 3 — 1 more. Total 2 + 2 + 1 + 1 = 6, choice (C).

12345{:} 15✓; total =2+2+1+1=6 → (C)
Answer
~6
Sanity check: the list 15, 45, 135, 345, 1245, 12345 all visibly end in 5 (so divisible by 5) and all have digit sums 6, 9, 9, 12, 12, 15 which are multiples of 3 — so they really are multiples of 15. We never missed a case because the total number of subsets of {1,2,3,4} is 2⁴ = 16, and we checked each subset's digit-sum mod 3. Six surviving subsets matches choice (C).
💡Key takeaway

This AMC 10 problem only needs Grade 4 divisibility rules and a careful list you already know! Divisible by 15 means divisible by 3 AND divisible by 5, so the last digit is 5, the other digits come from {1,2,3,4}, and the digit sum must be a multiple of 3. Listing every subset of {1,2,3,4} gives exactly 6 uphill multiples of 15.