arXiv · 1203.0596
Pretentious multiplicative functions and the prime number theorem for arithmetic progressions
Abstract
Building on the concept of pretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.
Explore related subjects
Keep this discovery
Dimitris Koukoulopoulos. 2013-03-13. Pretentious multiplicative functions and the prime number theorem for arithmetic progressions. https://doi.org/10.1112/s0010437x12000802
Cite the original work for its findings. Save a collection to share your selection of sources.