def approach1(m): result = 0 for a in range(1, m): # find corresponding b b = sum(findDivisors(a)) - a # check if d(b) = a and b is not a if sum(findDivisors(b)) - b == a and b != a: print "pair: ", a, b result += a + b # cutting in half for duplicates print result / 2
def isAbundant(i): D = findDivisors(i) if sum(D) > 2*i: return True else: return False