Let P(n) be a polynomial with coefficients in \mathbb Z. Suppose that \deg (P) = p where p is a prime number. Suppose also that P(n) is irreducible over \mathbb Z. Then there exists a prime number q such that q does not divide P(n) for any integer n.

[originally posted by Mladenov on TSR]