It states that, if counts the number of primes p congruent to a modulo q with p ≤ x, then
for all q < x.
The result was proven by sieve methods by Montgomery and Vaughan; an earlier result of Brun and Titchmarsh obtained a weaker version of this inequality with an additional multiplicative factor of .
If "q" is relatively small, e.g., , then there exists a better bound:
This is due to Y. Motohashi (1973). He used a bilinear structure in the error term in the Selberg sieve, discovered by himself. Later this idea of exploiting structures in sieving errors developed into a major method in Analytic Number Theory, due to H. Iwaniec's extension to combinatorial sieve.
Comparison with Dirichlet's theorem
By contrast, Dirichlet's theorem on arithmetic progressions gives an asymptotic result, which may be expressed in the form
but this can only be proved to hold for the more restricted range q < (log x)c for constant c: this is the Siegel–Walfisz theorem.
- Motohashi, Yoichi (1983), Sieve Methods and Prime Number Theory, Tata IFR and Springer-Verlag, ISBN 3-540-12281-8
- Hooley, Christopher (1976), Applications of sieve methods to the theory of numbers, Cambridge University Press, p. 10, ISBN 0-521-20915-3
- Mikawa, H. (2001), "b/b110970", in Hazewinkel, Michiel, Encyclopedia of Mathematics, Springer, ISBN 978-1-55608-010-4
- Montgomery, H.L.; Vaughan, R.C. (1973), "The large sieve", Mathematika 20: 119–134, doi:10.1112/s0025579300004708.