Pretentiousness in analytic number theory

DOI10.5802/jtnb.664zbMath1236.11086OpenAlexW2325605712MaRDI QIDQ1032673

Andrew Granville

Publication date: 26 October 2009

Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/10868

zbMATH Keywords

prime number theoremcharacter sumsmean values of totally multiplicative functionsmultiplicative functions in arithmetic progressionspretentiousness

Mathematics Subject Classification ID

Asymptotic results on arithmetic functions (11N37) (zeta (s)) and (L(s, chi)) (11M06) Primes in congruence classes (11N13)

Related Items

Dirichlet, Sierpiński, and Benford ⋮ On uniformity of q‐multiplicative sequences ⋮ Pretentiously detecting power cancellation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Multiplicative functions in arithmetic progressions
• A large sieve density estimate near \(\sigma = 1\)
• Large character sums
• On Character Sums and L-Series^†
• Large character sums: Pretentious characters and the Pólya-Vinogradov theorem
• A Theorem on Characters
• Prime Number Races
• On the distribution of additive arithmetic functions
• An Elementary Proof of the Prime-Number Theorem for Arithmetic Progressions
• Exponential sums with multiplicative coefficients
• The spectrum of multiplicative functions