Pretentious multiplicative functions and the prime number theorem for arithmetic progressions

DOI10.1112/S0010437X12000802zbMath1337.11063arXiv1203.0596OpenAlexW1979434718MaRDI QIDQ2841768

Dimitris Koukoulopoulos

Publication date: 30 July 2013

Published in: Compositio Mathematica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.0596

zbMATH Keywords

multiplicative functionsHalasz's theoremprime number theorem for arithmetic progressionselementary proofs of the prime number theorem

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) (zeta (s)) and (L(s, chi)) (11M06) Real zeros of (L(s, chi)); results on (L(1, chi)) (11M20) Primes in congruence classes (11N13) Distribution of primes (11N05)

Related Items (8)

On multiplicative functions which are small on average ⋮ A pretentious proof of Linnik's estimate for primes in arithmetic progressions ⋮ Multiplicative functions in short arithmetic progressions ⋮ Sign changes of fourier coefficients of holomorphic cusp forms at norm form arguments ⋮ Refinements to the prime number theorem for arithmetic progressions ⋮ Effective means for complex multiplicative functions ⋮ A new proof of Halász’s theorem, and its consequences ⋮ AN -FUNCTION-FREE PROOF OF VINOGRADOV’S THREE PRIMES THEOREM

Cites Work

• A note on Mertens' formula for arithmetic progressions
• An elementary proof of the prime number theorem with a remainder term
• An elementary proof of the prime-number theorem
• Decay of Mean Values of Multiplicative Functions
• VINOGRADOV'S INTEGRAL AND BOUNDS FOR THE RIEMANN ZETA FUNCTION
• On a New Method in Elementary Number Theory Which Leads to An Elementary Proof of the Prime Number Theorem
• Mean values of multiplicative functions

This page was built for publication: Pretentious multiplicative functions and the prime number theorem for arithmetic progressions