Prime values of integer polynomials

Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
3 replies · 3K views
VKint
Messages
139
Reaction score
12
Hey there, physics forums!

A question occurred to me the other day: Is it true that if [tex]f \in \mathbb{Z}[x][/tex] is monic and irreducible over [tex]\mathbb{Q}[/tex], then for at least one [tex]a \in \mathbb{Z}[/tex], [tex]f(a)[/tex] is prime? I can't prove it, but I suspect it's true. Does anyone know if this problem has been solved?
 
Physics news on Phys.org
What about f(x) = x^2 + x + 4? That's monic and irreducible over Q but isn't prime for any x in Z.
 
The Hardy-Littlewood conjectures discuss this in detail, at least for quadratic polynomials (and one cubic). I can't remember who first published the analysis of higher-order polynomials, but you could probably find it on Google.