On the Brun-Titchmarsh theorem

From MaRDI portal
Publication:4905231



Abstract: The Brun-Titchmarsh theorem shows that the number of primes lex which are congruent to apmodq is le(C+o(1))x/(phi(q)logx) for some value C depending on logx/logq. Different authors have provided different estimates for C in different ranges for logx/logq, all of which give C>2. We show that one can take C=2 provided that logx/logqge8. Without excluding the possibility of an exceptional Siegel zero, we cannot have C<2 and so this result is best-possible in this sense. We obtain this result using analytic methods developed in the study of Linnik's constant. In particular, we obtain explicit bounds on the number of zeroes of Dirichlet L-functions with real part close to 1 and imaginary part of size O(1).





Cited in
(30)








This page was built for publication: On the Brun-Titchmarsh theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4905231)