Pretentious multiplicative functions and the prime number theorem for arithmetic progressions
Number Theory
2019-02-20 v3
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.
Cite
@article{arxiv.1203.0596,
title = {Pretentious multiplicative functions and the prime number theorem for arithmetic progressions},
author = {Dimitris Koukoulopoulos},
journal= {arXiv preprint arXiv:1203.0596},
year = {2019}
}
Comments
21 pages. Final version. Strengthened Lemma 2.4 to fix an error in the proof of Lemma 4.1. Also made some other minor changes. To appear in Compos. Math