diff options
| author | Charles <sircharlesaze@gmail.com> | 2019-08-17 21:39:43 +0200 |
|---|---|---|
| committer | Charles <sircharlesaze@gmail.com> | 2019-08-17 21:39:43 +0200 |
| commit | 3ffc76713f6db4c33f20588ce6896ea3c2bae2a7 (patch) | |
| tree | 1025c801330f078e3a12da191f923ae8b6ddd81b /wip/027-quadratic_primes.py | |
| parent | 9a65938232d1fa9e1afe9a6eb2de48d25ff738a6 (diff) | |
| download | project_euler-3ffc76713f6db4c33f20588ce6896ea3c2bae2a7.tar.gz project_euler-3ffc76713f6db4c33f20588ce6896ea3c2bae2a7.tar.bz2 project_euler-3ffc76713f6db4c33f20588ce6896ea3c2bae2a7.zip | |
wip directory for each language
Diffstat (limited to 'wip/027-quadratic_primes.py')
| -rw-r--r-- | wip/027-quadratic_primes.py | 17 |
1 files changed, 0 insertions, 17 deletions
diff --git a/wip/027-quadratic_primes.py b/wip/027-quadratic_primes.py deleted file mode 100644 index 8b21cc6..0000000 --- a/wip/027-quadratic_primes.py +++ /dev/null @@ -1,17 +0,0 @@ -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 - - |