diff options
| author | Charles <sircharlesaze@gmail.com> | 2019-08-11 22:41:34 +0200 |
|---|---|---|
| committer | Charles <sircharlesaze@gmail.com> | 2019-08-11 22:41:34 +0200 |
| commit | 1879caa1dd80cb11dd62403663917ad4bf7cc68e (patch) | |
| tree | ea41c6dd83a9f9bbfe0a891237674342de92d533 /wip/027-quadratic_primes.py | |
| parent | 6b16d921543a62d880171791d39bcc58560785fa (diff) | |
| download | project_euler-1879caa1dd80cb11dd62403663917ad4bf7cc68e.tar.gz project_euler-1879caa1dd80cb11dd62403663917ad4bf7cc68e.tar.bz2 project_euler-1879caa1dd80cb11dd62403663917ad4bf7cc68e.zip | |
rename all file with 3 zero padding
Diffstat (limited to 'wip/027-quadratic_primes.py')
| -rw-r--r-- | wip/027-quadratic_primes.py | 17 |
1 files changed, 17 insertions, 0 deletions
diff --git a/wip/027-quadratic_primes.py b/wip/027-quadratic_primes.py new file mode 100644 index 0000000..8b21cc6 --- /dev/null +++ b/wip/027-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 + + |
