2012/03/31 by Dimitris Koukoulopoulos · 1 citation
Mathematics · #math.NT #msc:11N05 #msc:11N13 #msc:11M06 #msc:11M20
paper · pdf · doi:10.1112/s0010437x12000802
published as Compositio Math. 149 (2013) 1129-1149 · 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
arxiv created 2013/03/13 · arxiv updated 2019/02/20
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.