Browse · harp
Printsmc
counting and probability senior
Problem
How many positive integers less than are times the sum of their digits?
(A)
(B)
(C)
(D)
Solution
The sum of the digits is at most . Therefore the number is at most . Out of the numbers to the one with the largest sum of digits is , and the sum is . Hence the sum of digits will be at most . Also, each number with this property is divisible by , therefore it is divisible by , and thus also its sum of digits is divisible by . Thus, the number is divisible by . We only have six possibilities left for the sum of the digits: , , , , , and , but since the number is divisible by , the digits can only add to or . This leads to the integers , , , , , and being possibilities. We can check to see that solution: the number is the only solution that satisfies the conditions in the problem.
Final answer
B