paper

Primes in arithmetic progressions and Siegel zeroes

arXiv:2609.35950

Abstract

Let be a Dirichlet character mod with its associated -function, and let be, as usual, Chebyshev's prime-counting function for the primes of the arithmetic progression (mod ) with . Let be a primitive character modulo , and let be small. We prove that if has a Siegel zero at with for some large , there exists a range of for which the asymptotic holds for . We also show slightly better bounds for if we take an average over a range of , finding an Elliott-Halberstam-type result for on the range . This improves on a 2003 result of Friedlander and Iwaniec that requires and builds on recent work of Sachpazis.

arXiv commentThis is a reworking of my previous paper (https://arxiv.org/abs/2311.12470) on Siegel zeroes and primes in arithmetic progressions in light of Sachpazis' new work (https://arxiv.org/abs/2511.16452)