AMC 10 Step by Step

2003 AMC 10B Problem 25

P21-25~3 minPrint

How many distinct four-digit numbers are divisible by 33 and have 2323 as their last two digits?

Log in to save your progress.
Show solution without answering

Key insight

The 90 numbers 1023, 1123, ..., 9923 go up by 100. Each step changes the remainder after dividing by 3, so every third number works.

Solution

  1. List the four-digit numbers ending in 2323: 1023,1123,1223,…,99231023, 1123, 1223, \ldots, 9923. The first two digits run from 1010 to 9999, so there are 99−10+1=9099 - 10 + 1 = 90 of them.
  2. Find the first one divisible by 33. A number is divisible by 33 when its digit sum is. 10231023 has digit sum 1+0+2+3=61 + 0 + 2 + 3 = 6, so 10231023 works.
  3. See what happens as you go up the list. Each step adds 100100, and 100=99+1100 = 99 + 1 where 9999 is a multiple of 33. So each step raises the remainder (when you divide by 33) by 11:
NumberDigit sumDivisible by 33?
1023102366yes
1123112377no
1223122388no
1323132399yes
142314231010no
  1. The pattern yes, no, no repeats all the way up the list. So exactly one out of every three numbers works.
  2. The list has 9090 numbers, which is 3030 groups of three, and each group has one number that works. That gives 3030.

The answer is (B) 30\boxed{\textbf{(B)}\ 30}.

Why this works

If you keep adding the same amount, and that amount leaves remainder 11 when divided by 33, the remainders cycle through all three possibilities in turn. So in any three numbers in a row of the list, exactly one is a multiple of 33. This turns the question into a single division, and the same idea works for any fixed ending and any divisor.

Alternative approach

Use digit sums. Call the first two digits aa and bb. The number is divisible by 33 when a+b+2+3a + b + 2 + 3 is, that is, when a+b+5a + b + 5 is a multiple of 33. The possible values of a+ba + b go from 11 (for 1010) to 1818 (for 9999), and the ones that work are 1,4,7,10,13,161, 4, 7, 10, 13, 16. Count two-digit numbers with each digit sum: 11 (just 1010), 44 (13,22,31,4013, 22, 31, 40), 77 (1616 to 7070: 77 numbers), 1010 (1919 to 9191: 99 numbers), 1313 (4949 to 9494: 66 numbers), 1616 (79,88,9779, 88, 97: 33 numbers). Total: 1+4+7+9+6+3=301 + 4 + 7 + 9 + 6 + 3 = 30.

Concise solution

A shorter write-up, the way contest solutions are usually written. It may take a different route from the solution above.

A four-digit number ending in 2323 is 100k+23100k + 23 where kk is its first two digits, 10≤k≤9910 \le k \le 99. That is 9090 candidates: 1023,1123,1223,…,99231023, 1123, 1223, \dots, 9923.

Consecutive candidates differ by 100100, and 100≡1(mod3)100 \equiv 1 \pmod 3, so as kk increases by 11 the residue of 100k+23100k + 23 mod 33 increases by 11. The residues therefore cycle r,r+1,r+2,r,…r, r+1, r+2, r, \dots, and in any three consecutive candidates exactly one is a multiple of 33. Since 9090 is a multiple of 33, exactly 903=30\frac{90}{3} = 30 candidates are divisible by 33.

Concretely, 1023=3⋅3411023 = 3 \cdot 341 is the first, and the multiples of 33 are 1023,1323,1623,…,97231023, 1323, 1623, \dots, 9723 (step 300300): 9723−1023300+1=30\frac{9723 - 1023}{300} + 1 = 30.

The answer is (B) 30\boxed{\textbf{(B)}\ 30}.

Review in the AoPS books

Similar problems

Problem © Mathematical Association of America (MAA), American Mathematics Competitions. Reproduced for non-commercial educational use. Solution and commentary are original to this site.