Bunyakovsky conjecture: Difference between revisions
(Created page with "==Statement== The conjecture (not yet proved or disproved) states the following: suppose <math>p(x) \in \mathbb{Z}[x]</math>, i.e., <math>p</math> is a polynomial of degree t...") |
No edit summary |
||
| Line 1: | Line 1: | ||
==Statement== | ==Statement== | ||
The conjecture (not yet proved or disproved) states the following: suppose <math>p(x) \in \mathbb{Z}[x]</math>, i.e., <math>p</math> is | The conjecture (not yet proved or disproved) states the following: suppose <math>p(x) \in \mathbb{Z}[x]</math> is irreducible, i.e., <math>p</math> is an irreducible polynomial of degree two or higher with integer coefficients. Consider the set: | ||
<math>S = \{ p(n) \mid n \in \mathbb{N} \}</math> | <math>S = \{ p(n) \mid n \in \mathbb{N} \}</math> | ||
Revision as of 00:47, 3 July 2012
Statement
The conjecture (not yet proved or disproved) states the following: suppose is irreducible, i.e., is an irreducible polynomial of degree two or higher with integer coefficients. Consider the set:
Then, one of these two cases must hold:
- The greatest common divisor of all the elements of is greater than 1, i.e., all elements of have a nontrivial common factor.
- contains infinitely many prime numbers.
Note that the first case occurs if and only if the polynomial can be written as (a positive integer greater than 1) times (an integer-valued polynomial).
Related facts and conjectures
Related known facts
- Dirichlet's theorem on primes in arithmetic progressions is the analogous statement for polynomials of degree one.
Related conjectures
- Bateman-Horn conjecture is a stronger conjecture that also makes assertions about the frequency of primes in the set of values taken by a polynomial.