Pretentious multiplicative functions and the prime number theorem for arithmetic progressions-Reference-Cited by-同舟云学术

Pretentious multiplicative functions and the prime number theorem for arithmetic progressions

Published:2013-05-14 Issue:7 Volume:149 Page:1129-1149
ISSN:0010-437X
Container-title:Compositio Mathematica
language:en
Short-container-title:Compositio Math.

Author:

Koukoulopoulos Dimitris

Abstract

AbstractBuilding on the concept ofpretentious multiplicative functions, we give a new and largely elementary proof of the best result known on the counting function of primes in arithmetic progressions.

Publisher

Wiley

Subject

Algebra and Number Theory

Reference34 articles.

1. Different approaches to the distribution of prime numbers;Granville;Milan J. Math.,2009

2. Elementare Beweise des Primzahlsatzes mit Restglied. II;Wirsing;J. Reine Angew. Math.,1964

3. Ten Lectures on the Interface between Analytic Number Theory and Harmonic Analysis

4. A note on Mertens' formula for arithmetic progressions

5. Pretentious multiplicative functions and an inequality for the zeta-function

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Correlations of the Riemann zeta function;Mathematika;2024-07-20

2. Refinements to the prime number theorem for arithmetic progressions;Mathematische Zeitschrift;2024-02-20

3. Multiplicative functions in short arithmetic progressions;Proceedings of the London Mathematical Society;2023-06-25

4. A pretentious proof of Linnik's estimate for primes in arithmetic progressions;Mathematika;2023-06-09

5. Sign changes of fourier coefficients of holomorphic cusp forms at norm form arguments;Mathematical Proceedings of the Cambridge Philosophical Society;2023-05-23