Answers are grounded in this paper and cite their sources.
We fix a nonzero integer a and consider arithmetic progressions amodq, with q varying over a given range. We show that, for certain specific values of a, the arithmetic progressions amodq contain, on average, significantly fewer primes than expected. We improve on results of Fouvry, Bombieri, Friedlander, Iwaniec, Granville, Hildebrandt, and Maier.
No takes yet. Share an insight, caveat, or question.
Daniel Fiorilli (2012) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: