2018-09-30 22:01:58 +00:00
---
id: 5900f3871000cf542c50fe9a
title: 'Problem 27: Quadratic primes'
2020-11-27 18:02:05 +00:00
challengeType: 5
2019-08-05 16:17:33 +00:00
forumTopicId: 301919
2021-01-13 02:31:00 +00:00
dashedName: problem-27-quadratic-primes
2018-09-30 22:01:58 +00:00
---
2020-11-27 18:02:05 +00:00
# --description--
2020-02-28 12:39:47 +00:00
2018-09-30 22:01:58 +00:00
Euler discovered the remarkable quadratic formula:
2020-02-28 12:39:47 +00:00
< div style = 'margin-left: 4em;' > $n^2 + n + 41$< / div >
2020-11-27 18:02:05 +00:00
It turns out that the formula will produce 40 primes for the consecutive integer values $0 \\le n \\le 39$. However, when $n = 40, 40^2 + 40 + 41 = 40(40 + 1) + 41$ is divisible by 41, and certainly when $n = 41, 41^2 + 41 + 41$ is clearly divisible by 41.
2020-02-28 12:39:47 +00:00
2020-11-27 18:02:05 +00:00
The incredible formula $n^2 - 79n + 1601$ was discovered, which produces 80 primes for the consecutive values $0 \\le n \\le 79$. The product of the coefficients, − 79 and 1601, is − 126479.
2020-02-28 12:39:47 +00:00
2018-09-30 22:01:58 +00:00
Considering quadratics of the form:
2020-02-28 12:39:47 +00:00
< div style = 'margin-left: 4em;' >
$n^2 + an + b$, where $|a| < range $ and $| b | \le range $< br >
where $|n|$ is the modulus/absolute value of $n$< br >
e.g. $|11| = 11$ and $|-4| = 4$< br >
< / div >
2018-09-30 22:01:58 +00:00
Find the product of the coefficients, $a$ and $b$, for the quadratic expression that produces the maximum number of primes for consecutive values of $n$, starting with $n = 0$.
2020-02-28 12:39:47 +00:00
2020-11-27 18:02:05 +00:00
# --hints--
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
`quadraticPrimes(200)` should return a number.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
assert(typeof quadraticPrimes(200) === 'number');
```
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
`quadraticPrimes(200)` should return -4925.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
assert(quadraticPrimes(200) == -4925);
```
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
`quadraticPrimes(500)` should return -18901.
```js
assert(quadraticPrimes(500) == -18901);
2018-09-30 22:01:58 +00:00
```
2020-11-27 18:02:05 +00:00
`quadraticPrimes(800)` should return -43835.
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
```js
assert(quadraticPrimes(800) == -43835);
```
2018-09-30 22:01:58 +00:00
2020-11-27 18:02:05 +00:00
`quadraticPrimes(1000)` should return -59231.
```js
assert(quadraticPrimes(1000) == -59231);
```
# --seed--
## --seed-contents--
2018-09-30 22:01:58 +00:00
```js
function quadraticPrimes(range) {
2020-09-15 16:57:40 +00:00
2018-09-30 22:01:58 +00:00
return range;
}
quadraticPrimes(1000);
```
2020-11-27 18:02:05 +00:00
# --solutions--
2018-09-30 22:01:58 +00:00
```js
// solution required
```