paper

Medium-sized values for the Prime Number Theorem for primes in arithmetic progression

arXiv:2101.08610

Abstract

We give two improved explicit versions of the prime number theorem for primes in arithmetic progression: the first isolating the contribution of the Siegel zero and the second completely explicit, where the improvement is for medium-sized values. This will give an improved explicit Bombieri-Vinogradov like result for non-exceptional moduli.

21 pages

Medium-sized values for the Prime Number Theorem for primes in arithmetic progression · wovepaper