day1/exercise/amicable.py
author Christopher Burns <chris.d.burns@gmail.com>
Tue, 22 Jun 2010 00:00:54 -0700
branchscipy2010
changeset 421 47427c8d64fe
parent 380 669b72283b55
permissions -rw-r--r--
Added breaks to plan so I could think though the timing when drafting the summary.

def aliquot(n):
    sum = 1
    i = 2

    while i * i  < n:
        if n % i == 0:
            sum += i + (n / i)
        i += 1
    return sum

amicable = []

n = 1000
while n < 10000:
    m = aliquot(n)
    if m > n and aliquot(m) == n:
        print m, n
    n += 1