feat(solution): problem #21

solutions/021/amicablenumbers.py

@@ -0,0 +1,26 @@
+def sum_divisors(n):
+    factors = []
+    for i in range(1, n):
+        if n % i == 0:
+            factors.append(i)
+    factorSum = 0
+    for i in factors:
+        factorSum += i
+    return factorSum
+
+limit = 10000
+amicablePairs = []
+amicableSum = 0
+
+for i in range(limit):
+    if (i in amicablePairs) == False:
+        sum = sum_divisors(i)
+        pairCheck = sum_divisors(sum)
+        if pairCheck == i and sum != i:
+            amicablePairs.append(i)
+            amicablePairs.append(sum)
+
+for i in amicablePairs:
+    amicableSum += i
+
+print("The sum of all the amicable numbers under " + str(limit) + " is: " + str(amicableSum))