2.1 KiB
2.1 KiB
id | challengeType | title |
---|---|---|
5900f3871000cf542c50fe9a | 5 | Problem 27: Quadratic primes |
Description
n^2 + an + b
, where |a| < range
and |b| \le range$where
|n|is the modulus/absolute value of $n$e.g.
|11| = 11$ and |-4| = 4
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
.
Instructions
Tests
tests:
- text: <code>quadraticPrimes(200)</code> should return -4925.
testString: assert(quadraticPrimes(200) == -4925, '<code>quadraticPrimes(200)</code> should return -4925.');
- text: <code>quadraticPrimes(500)</code> should return -18901.
testString: assert(quadraticPrimes(500) == -18901, '<code>quadraticPrimes(500)</code> should return -18901.');
- text: <code>quadraticPrimes(800)</code> should return -43835.
testString: assert(quadraticPrimes(800) == -43835, '<code>quadraticPrimes(800)</code> should return -43835.');
- text: <code>quadraticPrimes(1000)</code> should return -59231.
testString: assert(quadraticPrimes(1000) == -59231, '<code>quadraticPrimes(1000)</code> should return -59231.');
Challenge Seed
function quadraticPrimes(range) {
// Good luck!
return range;
}
quadraticPrimes(1000);
Solution
// solution required