aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorWalt Mankowski <waltman@pobox.com>2022-06-29 18:18:12 -0400
committerWalt Mankowski <waltman@pobox.com>2022-06-29 18:18:12 -0400
commitb6dc516518883fed6a1e8bc89a4bbe31aacb9077 (patch)
treea98e237cd811b4fb32d6b6ec13d12ab4e9118caf
parente489704e06b880b6e396f8ff04a4f11d08c3907e (diff)
downloadperlweeklychallenge-club-b6dc516518883fed6a1e8bc89a4bbe31aacb9077.tar.gz
perlweeklychallenge-club-b6dc516518883fed6a1e8bc89a4bbe31aacb9077.tar.bz2
perlweeklychallenge-club-b6dc516518883fed6a1e8bc89a4bbe31aacb9077.zip
python code for challenge 1
-rw-r--r--challenge-171/walt-mankowski/python/ch-1.py19
1 files changed, 19 insertions, 0 deletions
diff --git a/challenge-171/walt-mankowski/python/ch-1.py b/challenge-171/walt-mankowski/python/ch-1.py
new file mode 100644
index 0000000000..90da29528a
--- /dev/null
+++ b/challenge-171/walt-mankowski/python/ch-1.py
@@ -0,0 +1,19 @@
+#!/usr/bin/env python
+
+def odd_divisors(n):
+ od = [i for i in range(1,n//2+1,2) if n % i == 0]
+ return od
+
+abundant = []
+n = 1
+while len(abundant) < 20:
+ od = odd_divisors(n)
+ if sum(od) > n:
+ abundant.append(n)
+ sum_str = ' + '.join([str(i) for i in od])
+ print(f"{len(abundant):2d}: {sum_str} = {sum(od)} > {n}")
+ n += 2
+print(abundant)
+
+
+