The prime number theorem for primes in arithmetic progressions at large values
arXiv:2301.13457
Abstract
Assuming the Riemann hypothesis, we prove the latest explicit version of the prime number theorem for short intervals. Using this result, and assuming the generalised Riemann hypothesis for Dirichlet -functions is true, we then establish explicit formulae for , , and an explicit version of the prime number theorem for primes in arithmetic progressions that hold for general moduli . Finally, we restrict our attention to and use an exact computation to refine these results.
25 pages, 6 tables, and any comments are always welcomed! A major face-lift over the previous version of this paper following feedback, including new results and refinements