day1/exercise/amicable.py
author Shantanu <shantanu@fossee.in>
Wed, 23 Dec 2009 14:17:02 +0530
changeset 331 c1bfec797af6
parent 94 8c92864c184b
child 380 669b72283b55
permissions -rw-r--r--
Added images of ode results in session 5.

def is_perfect_square(n):
    i = 1
    while i * i < n:
        i += 1
    return i * i == n, i

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

    is_ps, root = is_perfect_square(n)
    while i < root:
        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