AMC 8 · 2016 · #5

Grade 4 number-theory
modular-arithmeticdivisibility-rulesplace-value systematic-enumerationdigit-constraints ↑ Prerequisites: place-valuedivisibility-rules
📏 Medium solution 💡 3 insights
📘 View easy version →
Problem
N is a two-digit number. Dividing N by 9 leaves remainder 1, and dividing N by 10 leaves remainder 3. What is the remainder when N is divided by 11?

Pick an answer.

(A)
0
(B)
2
(C)
4
(D)
5
(E)
7

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

How to solve
Strategy Make a Systematic List

The "divide by 10, remainder 3" clue is very tight: it forces the units digit to be 3, so only nine candidates exist (13, 23, 33, …, 93). Tool #2 (Systematic List) writes them out in order. Tool #3 (Eliminate) then applies the second condition — divide by 9, remainder 1 — to throw out the candidates that fail. To check divisibility-by-9 quickly, we use Tool #5 (Look for a Pattern): a number's remainder mod 9 equals the digit-sum's remainder mod 9, so we just need the digit sum to leave remainder 1. One candidate survives. Then a single division by 11 finishes the problem — no algebra needed.

1STEP 1

Remainder 3 when divided by 10 forces the units digit to be 3, so N is one of the nine two-digit numbers ending in 3.

N ∈ {13, 23, 33, 43, 53, 63, 73, 83, 93}
2STEP 2

Use the digit-sum rule: any number's remainder mod 9 equals its digit sum taken mod 9, so just add the digits and look for remainder 1.

N mod 9 = (sum of digits of N) mod 9
3STEP 3

Add the digits of each candidate: only 73 gives digit sum 10, which leaves remainder 1 when divided by 9, so N = 73.

N & digit sum & mod 9 ; 13 & 4 & 4 ; 23 & 5 & 5 ; 33 & 6 & 6 ; 43 & 7 & 7 ; 53 & 8 & 8 ; 63 & 9 & 0 ; 73 & 10 & 1 ; 83 & 11 & 2 ; 93 & 12 & 3
4STEP 4

Divide N = 73 by 11: since 11 × 6 = 66 and 11 × 7 exceeds 73, the remainder is 73 - 66 = 7.

73 = 11 × 6 + 7 → 73 mod 11 = 7 → (E)
Answer
7
Verify N = 73 against both original conditions: 73 = 9 × 8 + 1 ✓ (remainder 1 when divided by 9), and 73 = 10 × 7 + 3 ✓ (remainder 3 when divided by 10). Both check, so N = 73 is correct, and 73 ÷ 11 = 6 remainder 7 matches answer choice (E). The remainder 7 is in {0, 1, …, 10} as a mod-11 remainder must be — magnitude is sensible.
💡Key takeaway

This AMC 8 problem only needs Grade 4 ideas — units-digit place value, the digit-sum rule for 9, and basic division with remainders — that you already know!