IMO 1987 Problem 6

Let $n\ge2$ be an integer. Prove that if $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le\sqrt{n\over3}$ , then $k^2+k+n$ is prime for all integers $k$ such that $0\le k\le n-2$ .