aboutsummaryrefslogtreecommitdiff
path: root/wip/27-quadratic_primes.py
diff options
context:
space:
mode:
authorCharles <sircharlesaze@gmail.com>2019-08-11 18:42:52 +0200
committerCharles <sircharlesaze@gmail.com>2019-08-11 18:42:52 +0200
commit7b624de8e3e3637a07364f992c1d7e4185e4a872 (patch)
treefdb9b0c3f9185b267f9f7bfb9cb4b0e4cdd8cc16 /wip/27-quadratic_primes.py
downloadproject_euler-7b624de8e3e3637a07364f992c1d7e4185e4a872.tar.gz
project_euler-7b624de8e3e3637a07364f992c1d7e4185e4a872.tar.bz2
project_euler-7b624de8e3e3637a07364f992c1d7e4185e4a872.zip
initial commit
Diffstat (limited to 'wip/27-quadratic_primes.py')
-rw-r--r--wip/27-quadratic_primes.py17
1 files changed, 17 insertions, 0 deletions
diff --git a/wip/27-quadratic_primes.py b/wip/27-quadratic_primes.py
new file mode 100644
index 0000000..8b21cc6
--- /dev/null
+++ b/wip/27-quadratic_primes.py
@@ -0,0 +1,17 @@
+from itertools import count
+from helper.prime import is_prime
+
+
+ab_iter = [(a, b) for b in range(1_001) for a in range(1_000)]
+
+max_product = 0
+max_prime_seq = 0
+for a, b in ab_iter:
+ for n in count():
+ if (not is_prime(n**2 + a*n + b)) and n > max_prime_seq:
+ max_prime_seq = n
+ max_product = a * b
+ print(max_product)
+ break
+
+