Open problem, Arithmetic and number theory, posed 1958
Schinzel's hypothesis H and Bunyakovsky's conjecture
For every finite collection of nonconstant irreducible polynomials in with positive leading coefficients, if there is no prime that divides the product for every integer , then there are infinitely many positive integers such that are simultaneously prime. The case is Bunyakovsky's conjecture.
As of 2026, Bunyakovsky's conjecture is unproved for every single polynomial of degree , and Schinzel's hypothesis H is unproved for every pair of polynomials (). The closest unconditional results either relax primality to almost-primality — such as Iwaniec's 1978 theorem that has at most two prime factors infinitely often — or replace the single-variable polynomial with a two-variable polynomial of large density, such as the Friedlander–Iwaniec theorem (, 1998) and the Heath-Brown theorem (, 2001). For linear systems , the Maynard–Tao sieve (2013) proves that for any , if is large enough, at least of the linear forms are simultaneously prime infinitely often, establishing a weak existential fragment of Dickson's conjecture.
Best known results
- For and , Bunyakovsky's conjecture holds by Dirichlet's theorem on primes in arithmetic progressions (1837).
- For any irreducible quadratic polynomial without fixed prime divisors, has at most two prime factors for infinitely many (Iwaniec, 1978).
- For any admissible tuple of linear polynomials, at least of them are simultaneously prime infinitely often once (Maynard, Tao, Polymath8b, 2013–2014).
Tools and where they stop
| Tool | Achieved | Where it stops |
|---|---|---|
| Half-dimensional and weighted linear sieves | Produce almost-prime values () for single polynomials and systems of polynomials of bounded degree. | Cannot cross the parity barrier to guarantee actual primes (), and the level of distribution for polynomial sequences of degree is too small. |
| Multidimensional Maynard–Tao sieve | Finds clusters of simultaneous primes within a larger admissible set of polynomials when the polynomials satisfy a Bombieri–Vinogradov-type theorem. | Requires to be much larger than (so it never proves all forms are simultaneously prime) and relies on level-of-distribution estimates known mainly for linear polynomials. |
Open questions
- Does there exist any single polynomial of degree that takes infinitely many prime values?
- Can the Maynard–Tao bounded-cluster theorem be extended unconditionally to admissible families of irreducible quadratic polynomials?
References
- Andrzej Schinzel, Wacław Sierpiński (1958). Sur certaines hypothèses concernant les nombres premiers · DOI:10.4064/aa-4-3-185-208
- Paul T. Bateman, Roger A. Horn (1962). A heuristic asymptotic formula concerning the distribution of prime numbers · DOI:10.1090/S0025-5718-1962-0148632-7
- Henryk Iwaniec (1978). Almost-primes represented by quadratic polynomials · DOI:10.1007/BF01578070