Thought Process

Notice a few things about f(n) = n^2 + an + b with respect to finding primes

1. f(0) = b

   • This tells us that b must be a prime between 1 and 1000, I used my prime generation function for this

2. f(1) = 1 + a + b

   • for f(1) to be a prime f(1) >= 2 => 1 + a + b >= 2 => a >= 1 - b

   • This means we only have to check values of a between 1-b and 1000

I created a simple function which takes inputs a, b and find the number of primes in a row n^2 + an + b generates. I used my is_prime function for this