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

2021/01/21 by Bordignon, Matteo · 1 citation
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/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.

Cited by

• An effective Bombieri-Vinogradov error term for sifting problems

Related

• Explicit formulae for primes in arithmetic progressions, II
• The prime number theorem for primes in arithmetic progressions at large values
• Primes in arithmetic progressions to large moduli, and shifted primes without large prime factors
• Primes in arithmetic progressions to large moduli III: Uniform residue classes
• Primes in arithmetic progressions to spaced moduli.III