The prime number theorem for primes in arithmetic progressions at large values

DOI10.1093/QMATH/HAAD031MaRDI QIDQ6183315zbMATH OpenOpenAlexWikidataFDO

Authors Ethan Simpson Lee

Publication date 26 January 2024

Published in The Quarterly Journal of Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2301.13457

Mathematics Subject Classification ID

Distribution of primes (11N05) Primes in congruence classes (11N13)

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)$, $heta(x,chi)$, and an explicit version of the prime number theorem for primes in arithmetic progressions that hold for general moduli $qgeq3$. Finally, we restrict our attention to $qleq10,000$ and use an exact computation to refine these results.

Recommendations

• Explicit bound for the number of primes in arithmetic progressions assuming the Generalized Riemann Hypothesis
• Primes in arithmetic progressions
• Medium-sized values for the prime number theorem for primes in arithmetic progressions
• Explicit Estimates for the Error Term in the Prime Number Theorem for Arithmetic Progressions
• Explicit bounds for primes in arithmetic progressions

Cited in

(2)

• Refinements to the prime number theorem for arithmetic progressions
• On the sum of a prime and a number that is not square-free

This page was built for publication: The prime number theorem for primes in arithmetic progressions at large values

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