From 9971f981a19072097d6d8761c068379de9bdb7ea Mon Sep 17 00:00:00 2001
From: fpringle <freddyjepringle@gmail.com>
Date: Thu, 29 Oct 2020 07:49:33 +0100
Subject: [PATCH] Added solution for Project Euler problem 87. (#3141)

* Added solution for Project Euler problem 87. Fixes: #2695

* Update docstring and 0-padding in directory name. Reference: #3256
---
 project_euler/problem_087/__init__.py |  0
 project_euler/problem_087/sol1.py     | 52 +++++++++++++++++++++++++++
 2 files changed, 52 insertions(+)
 create mode 100644 project_euler/problem_087/__init__.py
 create mode 100644 project_euler/problem_087/sol1.py

diff --git a/project_euler/problem_087/__init__.py b/project_euler/problem_087/__init__.py
new file mode 100644
index 0000000..e69de29
diff --git a/project_euler/problem_087/sol1.py b/project_euler/problem_087/sol1.py
new file mode 100644
index 0000000..f444481
--- /dev/null
+++ b/project_euler/problem_087/sol1.py
@@ -0,0 +1,52 @@
+"""
+Project Euler Problem 87: https://projecteuler.net/problem=87
+
+The smallest number expressible as the sum of a prime square, prime cube, and prime
+fourth power is 28. In fact, there are exactly four numbers below fifty that can be
+expressed in such a way:
+
+28 = 22 + 23 + 24
+33 = 32 + 23 + 24
+49 = 52 + 23 + 24
+47 = 22 + 33 + 24
+
+How many numbers below fifty million can be expressed as the sum of a prime square,
+prime cube, and prime fourth power?
+"""
+
+
+def solution(limit: int = 50000000) -> int:
+    """
+    Return the number of integers less than limit which can be expressed as the sum
+    of a prime square, prime cube, and prime fourth power.
+    >>> solution(50)
+    4
+    """
+    ret = set()
+    prime_square_limit = int((limit - 24) ** (1 / 2))
+
+    primes = set(range(3, prime_square_limit + 1, 2))
+    primes.add(2)
+    for p in range(3, prime_square_limit + 1, 2):
+        if p not in primes:
+            continue
+        primes.difference_update(set(range(p * p, prime_square_limit + 1, p)))
+
+    for prime1 in primes:
+        square = prime1 * prime1
+        for prime2 in primes:
+            cube = prime2 * prime2 * prime2
+            if square + cube >= limit - 16:
+                break
+            for prime3 in primes:
+                tetr = prime3 * prime3 * prime3 * prime3
+                total = square + cube + tetr
+                if total >= limit:
+                    break
+                ret.add(total)
+
+    return len(ret)
+
+
+if __name__ == "__main__":
+    print(f"{solution() = }")
-- 
GitLab