Euler: Non-abundant sums

Problem

A perfect number is a number for which the sum of its proper divisors is exactly equal to the number. For example, the sum of the proper divisors of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which means that 28 is a perfect number.

A number n is called deficient if the sum of its proper divisors is less than n and it is called abundant if this sum exceeds n.

As 12 is the smallest abundant number, 1 + 2 + 3 + 4 + 6 = 16, the smallest number that can be written as the sum of two abundant numbers is 24. By mathematical analysis, it can be shown that all integers greater than 28123 can be written as the sum of two abundant numbers. However, this upper limit cannot be reduced any further by analysis even though it is known that the greatest number that cannot be expressed as the sum of two abundant numbers is less than this limit.

Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.

Answer

1. isAbundant() judge whether a number is Abundant number.
2. test_bigest_sum() help to find which two number sum to 28123.
3. get_abundant_set() build all abundant number under certain one into a set.
4. build_sum_array() add every two abundant number.

import math

def isAbundant(n):
    if n<=1:
        return False
    sum = 1
    for i in range(2,1+(int)(math.sqrt(n-1)) ):
        if n%i == 0:
            sum += n/i + i
    if n%math.sqrt(n) == 0:
        sum += int(math.sqrt(n))
    if sum > n:
        return True
    else:
        return False

def test_isAbundant():
    print isAbundant(1)
    print isAbundant(28)
    print isAbundant(12)
    print isAbundant(25)

def test_bigest_sum():
    n = 28123
    s = get_abundant_set(n)
    for i in s:
        if n-i in s:
            print i,n-i
            return

def get_abundant_set(n):
    s = set()
    for i in range(2, n+1):
        if isAbundant(i):
            s.add(i)    
    return s


def build_sum_array():
    s = get_abundant_set(28035)
    li = list(s)
    a_set = set()
    for i in range(0, len(li)):
        for j in range(0, len(li)):
            a_set.add(li[i] + li[j])
    return a_set

def sum_not_sum():
    result = 0
    count = 0
    a_set = build_sum_array()
    for i in range(1, 28123+1):
        if i not in a_set:
            result += i
            count +=1
    print result, count


def main():
    #test_isAbundant()
    #test_bigest_sum()
    sum_all_cannot()


if __name__ == "__main__":
    main()