Let n
be a number.
If the (sum of proper divisors of
n
) equalsn
, thenn
is perfect.For example, 6 is perfect, because 1 + 2 + 3 = 6.
If the (sum of proper divisors of
n
) is less thann
, thenn
is deficient.For example, 5 is deficient, because 1 < 5.
If the (sum of proper divisors of
n
) is greater thann
, thenn
is abundant.As said in the text, for example 12 is abundant, because 1 + 2 + 3 + 4 + 6 > 12.
That said, if 12 is the smallest abundant number and we need to find an abundant number that is a sum of two abundant numbers, the smallest one we can check is the sum of twice the minimal one!
We need A and B such that A + B = C where A, B, C are abundant.
12 is the minimal abundant number and can be both A and B. There's nowhere said that the numbers have to be different. The definitions in Project Euler are pretty well worded, don't assume things that aren't said unless you can prove them. This is math, not a trick question.
Therefore, since A and B can be both 12, the smallest number to look at is 12 + 12 = 24. Which is abundant.