Browse · MATH
Printjmc
number theory intermediate
Problem
An abundant number is a positive integer such that the sum of its proper divisors is greater than the number itself. The number 12 is an abundant number since . What is the smallest abundant number that is not a multiple of 6?
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 the smallest composite numbers that are not divisible by . We find that:
for , , for , , for , , for , , for , , for , , for , , for , .
Thus, the answer is .
for , , for , , for , , for , , for , , for , , for , , for , .
Thus, the answer is .
Final answer
20