2007 AMC 12A Problem 22

Below is the professionally curated solution for Problem 22 of the 2007 AMC 12A, from LIVE by Po-Shen Loh. You can also try the full timed exam, view all 2007 AMC 12A 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:digitsmodular arithmeticbounding to limit cases

Difficulty rating: 1910

22.

For each positive integer n,n, let S(n)S(n) denote the sum of the digits of n.n. For how many values of nn is n+S(n)+S(S(n))=2007?n+S(n)+S(S(n))=2007?

11

22

33

44

55

Solution:

For n2007,n\le 2007, S(n)S(1999)=28,S(n)\le S(1999)=28, and then S(S(n))S(28)=10.S(S(n))\le S(28)=10. So any solution has n20072810=1969.n\ge 2007-28-10=1969.

Also n,n, S(n),S(n), and S(S(n))S(S(n)) are congruent modulo 9,9, and 20072007 is a multiple of 9,9, so all three must be multiples of 3.3.

Checking the multiples of 33 between 19691969 and 20072007 (many are eliminated because n+S(n)n+S(n) already exceeds 20072007) leaves 1977,1980,1983,1977,1980,1983, and 2001.2001. That is 44 values.

Thus, the correct answer is D.

Problem 22 in Other Years