Let n≥2 be an integer. Prove that if k2+k+n is prime for all integers k such that 0≤k≤3n, then k2+k+n is prime for all integers k such that 0≤k≤n−2.(IMO Problem 6)Original FormulationLet f(x)=x2+x+p, p∈N. Prove that if the numbers f(0), f(1), \cdots , f(\sqrt{p\over 3} ) are primes, then all the numbers f(0),f(1),⋯,f(p−2) are primes.Proposed by Soviet Union. number theorypolynomialprime numbersquadraticsIMO ShortlistIMOIMO 1987