Pretentious multiplicative functions and the prime number theorem for arithmetic progressions
classification
🧮 math.NT
keywords
arithmeticfunctionsmultiplicativepretentiousprogressionsbestbuildingconcept
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.