2004 AIME I Problem 1

Below is the professionally curated solution for Problem 1 of the 2004 AIME I, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2004 AIME I solutions, or check the answer key.

All of the real AMC 8, AMC 10, AMC 12, and AIME problems in our complete solution collection are used with official legal permission of the Mathematical Association of America (MAA).

Concepts:place valuemodular arithmetic

Difficulty rating: 1890

1.

The digits of a positive integer nn are four consecutive integers in decreasing order when read from left to right. What is the sum of the possible remainders when nn is divided by 37?37?

Solution:

If the leading digit is a,a, the digits are a,a, a1,a - 1, a2,a - 2, a3a - 3 with a=3,4,,9,a = 3, 4, \ldots, 9, so n=1000a+100(a1)+10(a2)+(a3)=1111a123.n = 1000a + 100(a-1) + 10(a-2) + (a-3) = 1111a - 123.

Since 1111=3037+11111 = 30 \cdot 37 + 1 and 123=337+12,123 = 3 \cdot 37 + 12, we get na12a+25(mod37).n \equiv a - 12 \equiv a + 25 \pmod{37}. For a=3,,9a = 3, \ldots, 9 the values a+25a + 25 run through 28,29,,34,28, 29, \ldots, 34, each already less than 37,37, so these are exactly the seven possible remainders.

Their sum is 28+29++34=731=217.28 + 29 + \cdots + 34 = 7 \cdot 31 = 217.

Full ExamProblem 2

Problem 1 in Other Years