Hostname: page-component-89b8bd64d-ksp62 Total loading time: 0 Render date: 2026-05-08T03:39:28.021Z Has data issue: false hasContentIssue false

Pretentious multiplicative functions and the prime number theorem for arithmetic progressions

Published online by Cambridge University Press:  14 May 2013

Dimitris Koukoulopoulos*
Affiliation:
Département de mathématiques et de statistique, Université de Montréal, CP 6128 succ. Centre-Ville, Montréal, QC H3C 3J7, Canada email koukoulo@dms.umontreal.ca

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.

Information

Type
Research Article
Copyright
© The Author(s) 2013 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable