Maths Olympiad Prep

Library / /59 of 397

Number theory Difficulty 5.1 AIME, harder Prove it Taiwan

It is known that nn is a three-digit odd number, and the sum of the last digits of all its divisors (including 1 and nn) is 33. Find the value of nn.

Solution

Answer: n=272=729n = 27^2 = 729.
Since nn is odd, each of its divisors is odd. Clearly, the units digit of each divisor is odd.
Also, since the sum of the last digits of all the divisors is 33, which is an odd number, nn has an odd number of divisors. Hence, nn is a perfect square.
Since a prime number has only 2 divisors, and after squaring it has only 3 divisors, whose sum of last digits is less than 27, the three-digit numbers satisfying the condition can only be squares of composite numbers, of which there are four in total:
272,252,212,152. 27^2, 25^2, 21^2, 15^2.
Checking them one by one, we find that 272=72927^2 = 729 is the desired answer.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement translated into English from zh; metadata (topic, difficulty) added by this project.