Skip to main content
OlympiadHQ

Browse · MATH

Print

jmc

number theory intermediate

Problem

A natural number is abundant if it is less than the sum of its proper divisors. What is the smallest abundant number?
Solution
For any prime number, the sum of its proper divisors is equal to , so a prime number cannot be an abundant number. Therefore, it suffices to check only composite numbers:

For , ,

For , ,

For , ,

For , ,

For , ,

For , .

Thus, the answer is .
Final answer
12