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. Copyright © The Author(s) 2013.