arXiv · 2303.06122
Sifting for small primes from an arithmetic progression
Abstract
In this work and its sister paper [5] we give a new proof of the famous Linnik theorem bounding the least prime in an arithmetic progression. Using sieve machinery in both papers, we are able to dipense with the log-free zero density bounds and the repulsion property of exceptional zeros, two deep innovations begun by Linnik and reelied on in earlier proofs.
Explore related subjects
Keep this discovery
John B Friedlander, Henryk Iwaniec. 2023-03-10. Sifting for small primes from an arithmetic progression. https://arxiv.org/abs/2303.06122
Cite the original work for its findings. Save a collection to share your selection of sources.