Created
November 22, 2013 00:54
-
-
Save mavant/7592816 to your computer and use it in GitHub Desktop.
Project Euler problem 21
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import math | |
| def d(n): | |
| sum = 0 | |
| for i in range(1, int(math.sqrt(n)+1)): | |
| if (n % i == 0): | |
| sum += i | |
| return sum | |
| amicable = [] | |
| for a in range (2, 10000): | |
| b = d(a) | |
| db = d(b) | |
| if (b != a and db == a): | |
| amicable.append(a) | |
| print (sum(amicable)) | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment