2000 character limit reached
The prime number theorem for primes in arithmetic progressions at large values (2301.13457v2)
Published 31 Jan 2023 in math.NT
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 $L$-functions is true, we then establish explicit formulae for $\psi(x,\chi)$, $\theta(x,\chi)$, and an explicit version of the prime number theorem for primes in arithmetic progressions that hold for general moduli $q\geq 3$. Finally, we restrict our attention to $q\leq 10\,000$ and use an exact computation to refine these results.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.