All challenges
Medium 0 solved 0% acceptance

Quadratic Primes

Find the quadratic n² + an + b that gives the longest run of primes from n = 0.

What you'll learn

  • Test primality by trial division
  • Search a two-parameter space
  • Apply tie-breaking rules

Problem

Some quadratics are good at making primes. n² + n + 41 gives primes for n = 0 to 39. For whole numbers a and b with |a| ≤ limit and |b| ≤ limit, count how many consecutive values n = 0, 1, 2, ... make n² + an + b prime, stopping at the first value that is not prime. Find the pair with the longest run.

Implement quadratic_primes(limit).

Input

limit: The bound on the absolute values of a and b.

Output

Return [a, b, run], where run is the number of primes in the longest run. If several pairs tie, take the smallest a, then the smallest b. Numbers below 2 are not prime, so a pair whose value at n = 0 is not prime has a run of 0.

Constraints

0 ≤ limit ≤ 300

Examples

Example 1
Input:
limit = 3

Expected output:
expected = [-2, 3, 3]
Input:
long long limit = 3;

Expected output:
std::vector<long long> expected = {-2, 3, 3};
Input:
long limit = 3;

Expected output:
long[] expected = new long[] {-2, 3, 3};

Explanation

With a = −2 and b = 3 the values for n = 0, 1, 2, 3 are 3, 2, 3, 6: three primes. No pair does better and no smaller a ties, so the answer is [-2, 3, 3].

Example 2
Input:
limit = 1

Expected output:
expected = [-1, -1, 0]
Input:
long long limit = 1;

Expected output:
std::vector<long long> expected = {-1, -1, 0};
Input:
long limit = 1;

Expected output:
long[] expected = new long[] {-1, -1, 0};

Explanation

b is −1, 0 or 1 and none of them is prime, so every run is 0 and the smallest pair wins: [-1, -1, 0].

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

At n = 0 the value is b, so b must be prime for any run at all.

Hint 2

Count n upward until the value is not prime; negative values and values below 2 end the run.

Hint 3

Loop a and b in increasing order and replace the best only on a strictly longer run.

Expected complexity

O(limit² × run × √V) time, O(1) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.