AMC 10 · 2003 · #25

Grade 6 number-theory
modular-arithmeticdivisibility-rulesplace-value convert-to-algebraeasier-related-problem ↑ Prerequisites: modular-arithmetic
📏 Long solution 💡 3 insights
Problem
A number n has 5 digits. Divide n by 100: call the quotient q and the remainder r. Count how many of the 5-digit numbers n make the sum q+r a multiple of 11.

Pick an answer.

(A)
8180
(B)
8181
(C)
8182
(D)
9000
(E)
9090

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

How to solve
Strategy Introduce a Variable

The clean way in is to name the pieces: Tool #4 (Introduce a Variable) writes the split as n = 100q + r, turning the word 'quotient and remainder' into one equation. The magic is what that equation reveals: rewrite 100q + r as 99q + (q + r). Since 99 is a multiple of 11, the messy target q + r and the number n itself always leave the same remainder when divided by 11 (Tool #5, Look for a Pattern — the pattern is that 100 is just 1 more than a multiple of 11). So asking '11 divides q+r' is exactly the same as asking '11 divides n.' That swap is Tool #9 (Solve an Easier Related Problem): instead of chasing two variables, we just count the 5-digit multiples of 11, which is a short, direct count.

1STEP 1

Write the division as one equation

Dividing n by 100 means n = 100q + r with 0 ≤ r ≤ 99: q is the first three digits (100 to 999), r the last two (0 to 99).

n = 100q + r, 0 ≤ r ≤ 99
2STEP 2

Rewrite so q+r appears

We want q + r, but the equation shows 100q + r. Split 100q into 99q + q, and the sum we want appears: n = 99q + (q + r).

n = 100q + r = 99q + (q + r)
3STEP 3

See that q+r and n share divisibility by 11

Since 99 = 9 × 11, the term 99q is always a multiple of 11, so q + r is divisible by 11 exactly when n itself is.

99q ≡ 0 (mod 11) → 11 ∣ (q+r) ⇔ 11 ∣ n
4STEP 4

Turn it into counting multiples of 11

So count the 5-digit multiples of 11: the smallest is 11 × 910 = 10010 and the largest is 11 × 9090 = 99990.

11 × 910 = 10010, 11 × 9090 = 99990
5STEP 5

Count the list

Counting 11 × 910 through 11 × 9090 is just counting 910 to 9090: 9090 - 910 + 1 = 8181, choice (B).

9090 - 910 + 1 = 8181
Answer
8181
Sanity-check the size. There are 99999 - 10000 + 1 = 90000 five-digit numbers, and about one in every 11 is a multiple of 11: 90000 ÷ 11 ≈ 8181.8. The exact count 8181 sits right at that estimate, so it is the right order of magnitude and it rules out the far-off choices 9000 and 9090. It also lands next to 8182, so the careful endpoint count matters: the smallest qualifying n is 10010 (not 10000) and the largest is 99990, and 9090 - 910 + 1 = 8181 confirms (B) over (C). A spot check of the logic: take n = 10010, then q = 100, r = 10, and q + r = 110 = 11 × 10 is indeed divisible by 11.
💡Key takeaway

Since 100 is one more than a multiple of 11, the number n and the sum q+r always leave the same remainder when divided by 11, so the question is just 'how many 5-digit multiples of 11 are there?' — and that count is 8181.

  • Write the division as one equation
  • Rewrite so q+r appears
  • See that q+r and n share divisibility by 11
  • Turn it into counting multiples of 11
  • Count the list