Abstract
AbstractBuilding on the concept ofpretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have