In number theory, the Elliott–Halberstam conjecture is a conjecture about the distribution of prime numbers in arithmetic progressions. It has many applications in sieve theory. It is named for Peter D. T. A. Elliott and Heini Halberstam, who stated the conjecture in 1968.^[1]

Stating the conjecture requires some notation. Let ${\displaystyle \pi (x)}$, the prime-counting function, denote the number of primes less than or equal to ${\displaystyle x}$. If ${\displaystyle q}$ is a positive integer and ${\displaystyle a}$ is coprime to ${\displaystyle q}$, we let ${\displaystyle \pi (x;q,a)}$ denote the number of primes less than or equal to ${\displaystyle x}$ which are equal to ${\displaystyle a}$ modulo ${\displaystyle q}$. Dirichlet's theorem on primes in arithmetic progressions then tells us that

${\displaystyle \pi (x;q,a)\approx {\frac {\pi (x)}{\varphi (q)}}}$

where ${\displaystyle \varphi }$ is Euler's totient function. If we then define the error function

${\displaystyle E(x;q)=\max _{{\text{gcd}}(a,q)=1}\left|\pi (x;q,a)-{\frac {\pi (x)}{\varphi (q)}}\right|}$

where the max is taken over all ${\displaystyle a}$ coprime to ${\displaystyle q}$, then the Elliott–Halberstam conjecture is the assertion that for every ${\displaystyle \theta <1}$ and ${\displaystyle A>0}$ there exists a constant ${\displaystyle C>0}$ such that

${\displaystyle \sum _{1\leq q\leq x^{\theta }}E(x;q)\leq {\frac {Cx}{\log ^{A}x}}}$

for all ${\displaystyle x>2}$.

This conjecture was proven for all ${\displaystyle \theta <1/2}$ by Enrico Bombieri^[2] and A. I. Vinogradov^[3] (the Bombieri–Vinogradov theorem, sometimes known simply as "Bombieri's theorem"); this result is already quite useful, being an averaged form of the generalized Riemann hypothesis. It is known that the conjecture fails at the endpoint ${\displaystyle \theta =1}$.^[4]

The Elliott–Halberstam conjecture has several consequences. One striking one is the result announced by Dan Goldston, János Pintz, and Cem Yıldırım,^[5][6] which shows (assuming this conjecture) that there are infinitely many pairs of primes which differ by at most 16. In November 2013, James Maynard showed that subject to the Elliott–Halberstam conjecture, one can show the existence of infinitely many pairs of consecutive primes that differ by at most 12.^[7] In August 2014, Polymath group showed that subject to the generalized Elliott–Halberstam conjecture, one can show the existence of infinitely many pairs of consecutive primes that differ by at most 6.^[8] Without assuming any form of the conjecture, the lowest proven bound is 246.

See also

• Barban–Davenport–Halberstam theorem
• Sexy prime
• Siegel–Walfisz theorem

Notes