Schinzel's hypothesis H: Difference between revisions
New page: Hypothesis H is a variant of the Hardy-Littlewood prime tuples conjecture. It asserts that a non-constant polynomial f(n) with integer coefficients will take infinitely many prime val... |
No edit summary |
||
| Line 3: | Line 3: | ||
It is known for linear polynomials (Dirichlet's theorem), but is open for higher degree (most notably for <math>n^2+1</math>). | It is known for linear polynomials (Dirichlet's theorem), but is open for higher degree (most notably for <math>n^2+1</math>). | ||
A stronger version of this hypothesis would assert that there is a k-digit prime of the form f(n) for all sufficiently large n. If this is the case, one can solve the weak version of the [[finding primes]] project by searching the k-digit values of a degree d irreducible polynomial, such as <math>n^d-2</math>, to find a prime in <math>O( (10^k)^{1/d} )</math> steps for any given d. | A stronger version of this hypothesis (the ''Bateman-Horn conjecture'') would assert that there is a k-digit prime of the form f(n) for all sufficiently large n. If this is the case, one can solve the weak version of the [[finding primes]] project by searching the k-digit values of a degree d irreducible polynomial, such as <math>n^d-2</math>, to find a prime in <math>O( (10^k)^{1/d} )</math> steps for any given d. | ||
# [http://en.wikipedia.org/wiki/Schinzel%27s_hypothesis_H Wikipedia page for this hypothesis] | # [http://en.wikipedia.org/wiki/Schinzel%27s_hypothesis_H Wikipedia page for this hypothesis] | ||
# [http://en.wikipedia.org/wiki/Bateman-Horn_conjecture Wikipedia page for the Bateman-Horn conjecture] | |||
Revision as of 05:53, 9 August 2009
Hypothesis H is a variant of the Hardy-Littlewood prime tuples conjecture. It asserts that a non-constant polynomial f(n) with integer coefficients will take infinitely many prime values as long as there is no "obvious" reason for it not to, for instance if it is not coprime to a fixed modulus q for all n, or if it is only positive for finitely many n, or if it factors into polynomials of smaller degree.
It is known for linear polynomials (Dirichlet's theorem), but is open for higher degree (most notably for [math]\displaystyle{ n^2+1 }[/math]).
A stronger version of this hypothesis (the Bateman-Horn conjecture) would assert that there is a k-digit prime of the form f(n) for all sufficiently large n. If this is the case, one can solve the weak version of the finding primes project by searching the k-digit values of a degree d irreducible polynomial, such as [math]\displaystyle{ n^d-2 }[/math], to find a prime in [math]\displaystyle{ O( (10^k)^{1/d} ) }[/math] steps for any given d.
