Hostname: page-component-74656f9884-npj9w Total loading time: 0 Render date: 2026-11-09T09:00:22.135Z 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
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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