| changeset 98 | 1b9a427f41c6 |
| parent 94 | 8c92864c184b |
| child 354 | 5dc6c3673f9d |
| 97:555237dbce44 | 98:1b9a427f41c6 |
|---|---|
1 def is_perfect_square(n): |
|
2 i = 1 |
|
3 while i * i < n: |
|
4 i += 1 |
|
5 return i * i == n, i |
|
6 |
|
1 def aliquot(n): |
7 def aliquot(n): |
2 sum = 0 |
8 sum = 1 |
3 for i in range(1, (n/2)+1): |
9 i = 2 |
10 |
|
11 is_ps, root = is_perfect_square(n) |
|
12 while i < root: |
|
4 if n % i == 0: |
13 if n % i == 0: |
5 sum += i |
14 sum += i + (n / i) |
15 i += 1 |
|
6 return sum |
16 return sum |
7 |
17 |
8 print aliquot(14) |
18 n = int(raw_input('Enter a number? ')) |
19 print aliquot(n) |