# When is $n^2+n+p$ prime? [duplicate]

Possible Duplicate:
Behaviour of Polynomials in a PID!

Prove: if $p$ is a prime, and if $n^2+n+p$ is prime for $0\leq n \leq \sqrt{p/3}$, then it is also prime for $0 \leq n \leq p-2$.

This appeared on reddit recently, but no proof was posted. With $p=41$, it is Euler's famous prime-generating polynomial.

-

## marked as duplicate by Aryabhata, muad, Robin Chapman, kennytmAug 19 '10 at 17:06

This question has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.

## 1 Answer

This follows by employing in Rabinowitsch's proof a Gauss bound, e.g. see Theorem 9.1 here.

-
I should have searched more carefully. Thank you! –  mmm Aug 18 '10 at 23:16