-
Notifications
You must be signed in to change notification settings - Fork 0
/
problem_23.py
52 lines (40 loc) · 1.42 KB
/
problem_23.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
"""Problem 23: Non-abundant sums
A perfect number is a number for which the sum
of its proper divisors is exactly equal to the
number. For example, the sum of the proper divisors
of 28 would be 1 + 2 + 4 + 7 + 14 = 28, which
means that 28 is a perfect number.
A number n is called deficient if the sum of its
proper divisors is less than n and it is called
abundant if this sum exceeds n.
As 12 is the smallest abundant number,
1 + 2 + 3 + 4 + 6 = 16, the smallest number that
can be written as the sum of two abundant numbers
is 24. By mathematical analysis, it can be shown
that all integers greater than 28123 can be written
as the sum of two abundant numbers. However, this upper
limit cannot be reduced any further by analysis even
though it is known that the greatest number that cannot
be expressed as the sum of two abundant numbers is less
than this limit.
Find the sum of all the positive integers which cannot
be written as the sum of two abundant numbers.
"""
# This takes a good 4 minutes on my laptop.
# Definitely room for optimization.
from helpers import divisors
def is_abundant(n):
return sum(divisors(n)) - n > n
abundants = []
non_ab_nums = []
for n in range(1,28124):
non_ab = True
if is_abundant(n):
abundants.append(n)
for a in abundants:
if n - a in abundants:
non_ab = False
break
if non_ab:
non_ab_nums.append(n)
print(sum(non_ab_nums))