[FOM] Prime values of polynomials
vladik at utep.edu
Tue Mar 4 12:52:15 EST 2008
According to Matiyasevich's theorem, every recursively enumerable set of
natural numbers is a range of some polynomial with integer coefficients.
This means that, in particular, the set of all prime numbers can be
represented as such an image. There are explicit examples of such
polynomials, e.g., in the latest Notices of the AMS. Such polynomials
take infiitely many prime values. So, contrary to what you read, such
polynomials are well known.
>From joeshipman at aol.com
I have read that no integer-coefficient polynomials of degree >1 are
known to take infinitely many prime values.
More information about the FOM