add euler023 and euler058 solution

kailanefelix · Oct 10, 2021 · be78d0b · be78d0b
1 parent ebc9440
commit be78d0b
Show file tree

Hide file tree

Showing 2 changed files with 26 additions and 0 deletions.
diff --git a/euler0XX/euler023.py b/euler0XX/euler023.py
@@ -0,0 +1,8 @@
+from numbertools import divisors
+
+numbers = {*range(28124)}
+
+abundant = {n for n in range(12, 28112) if sum(divisors(n)) > n}
+abundant_sums = {a + b for a in abundant for b in abundant}
+
+print(sum(numbers - abundant_sums))
diff --git a/euler0XX/euler058.py b/euler0XX/euler058.py
@@ -0,0 +1,18 @@
+from itertools import count
+from numbers import is_prime
+
+primes, total, number, step = 0, 0, 1, 2
+
+for i in count():
+    for _ in range(4):
+        number = number + step
+
+        if is_prime(number):
+            primes = primes + 1
+        total = total + 1
+
+    step = step + 2
+
+    if primes / total < 0.1:
+        print(2 * i + 1)
+        break