Refinements to the prime number theorem for arithmetic progressions

Research output: Contribution to journalArticlepeer-review

Abstract

We prove a version of the prime number theorem for arithmetic progressions that is uniform enough to deduce the Siegel–Walfisz theorem, Hoheisel’s asymptotic for intervals of length x7/12+ε, a Brun–Titchmarsh bound, and Linnik’s bound on the least prime in an arithmetic progression as corollaries. Our proof uses the Vinogradov–Korobov zero-free region, a log-free zero density estimate, and the Deuring–Heilbronn zero repulsion phenomenon. Improvements exist when the modulus is sufficiently powerful.

Original languageEnglish (US)
Article number54
JournalMathematische Zeitschrift
Volume306
Issue number3
Early online dateFeb 20 2024
DOIs
StatePublished - Mar 2024

Keywords

  • Hoheisel’s theorem
  • Linnik’s theorem
  • Log-free zero density estimate
  • Primes in arithmetic progressions
  • Zero repulsion

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'Refinements to the prime number theorem for arithmetic progressions'. Together they form a unique fingerprint.

Cite this