2009 AMC 12A Problem 12

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

Difficulty rating: 1730

12.

How many positive integers less than 10001000 are 66 times the sum of their digits?

00

11

22

44

1212

Solution:

If N=6(digit sum),N = 6\cdot(\text{digit sum}), then since the digit sum of a number below 10001000 is at most 27,27, we have N162.N \le 162.

For a two-digit number 10t+u=6(t+u)10t + u = 6(t + u) gives 4t=5u,4t = 5u, forcing t=5t = 5 and u=4,u = 4, so N=54.N = 54. A one-digit number would need 6u=u,6u = u, impossible for u>0.u \gt 0. A three-digit number 100h+10t+u=6(h+t+u)100h + 10t + u = 6(h + t + u) gives 94h+4t=5u,94h + 4t = 5u, whose left side is at least 9494 while the right side is at most 45,45, so there is no solution.

Hence exactly one number, 54,54, works.

Thus, the correct answer is B.

Problem 12 in Other Years