Sifting for small primes from an arithmetic progression
arXiv:2303.06122
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.
Acceted for publication in SCIENCE CHINA Math