Explicit bounds for primes in arithmetic progressions

From MaRDI portal




Abstract: We derive explicit upper bounds for various functions counting primes in arithmetic progressions. By way of example, if q and a are integers with gcd(a,q)=1 and 3leqqleq105, and heta(x;q,a) denotes the sum of the logarithms of the primes pequivapmodq with pleqx, we show that �igg| heta (x; q, a) - frac{x}{phi (q)} �igg| < frac1{160} frac{x}{log x}, for all xge8cdot109 (with sharper constants obtained for individual such moduli q). We establish inequalities of the same shape for the other standard prime-counting functions pi(x;q,a) and psi(x;q,a), as well as inequalities for the nth prime congruent to apmodq when qle1200. For moduli q>105, we find even stronger explicit inequalities, but only for much larger values of x. Along the way, we also derive an improved explicit lower bound for L(1,chi) for quadratic characters chi, and an improved explicit upper bound for exceptional zeros.




Cited in
(62)






This page was built for publication: Explicit bounds for primes in arithmetic progressions

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