AMC 10 · 2017 · #25

Grade 4 counting
divisibility-rulespermutations-basicdigit-constraints caseworksystematic-enumerationcomplementary-counting ↑ Prerequisites: divisibility-rules
📏 Long solution 💡 4 insights
📘 View easy version →
Problem
Count the three-digit numbers from 100 to 999 whose digits can be rearranged to form a three-digit multiple of 11 (also between 100 and 999). A number qualifies if at least one arrangement of its digits is such a multiple; for instance 121 and 211 both qualify because 121 is a multiple of 11.

Pick an answer.

(A)
226
(B)
243
(C)
270
(D)
469
(E)
486

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

How to solve
Strategy Make a Systematic List

Checking all 900 numbers one by one is hopeless, so use Tool #16 (Change Focus): instead of testing each number, start from the multiples of 11 and count outward to every number that shares a multiple's digits. There are only 81 such multiples. Tool #2 (Make a Systematic List) then counts, for each multiple, how many valid three-digit rearrangements its digits produce. Tool #7 (Identify Subproblems) sorts the 81 multiples by how many of their digits repeat, because repeats and zeros change the permutation count, and it flags the double-counting from the reversal rule.

1STEP 1

Count the multiples of 11

The three-digit multiples of 11 run 110 to 990, giving 81 targets; a number qualifies exactly when its digits shuffle into one of them.

(990-110)/11+1 = 81 multiples of 11
2STEP 2

A reversal rule that doubles up

Divisibility by 11 tests A-B+C, unchanged when ABC flips to CBA, so a multiple of 11 reversed is still a multiple of 11, sharing its digits.

A-B+C ≡ 0 (mod 11) → C-B+A ≡ 0 (mod 11)
3STEP 3

Sort the 81 by repeated digits

Sort the 81 by repeats: all-equal is impossible (111 isn't a multiple of 11), leaving 17 with a repeated digit and 64 all different.

81 = (Group I) + (Group II) + (Group III) = 0 + 17 + 64
4STEP 4

Group II — a repeated digit, no zero

The no-zero repeats are the 8 palindromes aba (121, 242, …, 979); each spells 3!/2!=3 valid numbers and is its own reverse, giving 24.

8 × 3!/2! = 8 × 3 = 24
5STEP 5

Group II — a repeated digit with a zero

The 9 sets {a,a,0} (110, 220, …, 990) order as aa0, a0a, 0aa, but 0aa is illegal, leaving 2 each for 18.

9 × 2 = 18
6STEP 6

Group III — all digits different, with a zero

The 8 all-different multiples with a 0 (209, 308, …, 902) give 3!=6 orders minus 2 zero-led = 4 each, halved for reversal pairs: 16.

(8 × 4)/2 = 32/2 = 16
7STEP 7

Group III — all digits different, no zero

The remaining 56 multiples have three different nonzero digits, each spelling 3!=6 valid numbers, halved for reversal pairs: 168.

(56 × 6)/2 = 336/2 = 168
8STEP 8

Add the groups

Every qualifying number lands in exactly one disjoint case, so add: 24+18+16+168 = 226, choice (A).

24+18+16+168 = 226 → (A)
Answer
226
The count 226 is below the 81×3=243 you would get by naively giving every multiple three rearrangements, which makes sense because zeros and reversal pairing only remove numbers, never add them. Of the choices, 226 is the only one under 243, and every larger choice would require more numbers than the multiples can possibly generate, so (A) is the sole feasible answer. The groups (all-same, one-repeat, all-different) cover the 81 multiples with no overlap, and within each group the zero and reversal adjustments are accounted for, so nothing is missed or double-counted.
💡Key takeaway

When few numbers fit a rule, start from those and count outward, adjusting for leading zeros and for shuffles you count twice.

  • Count the multiples of 11
  • A reversal rule that doubles up
  • Sort the 81 by repeated digits
  • Group II — a repeated digit, no zero
  • Group II — a repeated digit with a zero
  • Group III — all digits different, with a zero
  • Group III — all digits different, no zero
  • Add the groups