2023/03/10 by John Friedlander, Henryk Iwaniec, Friedlander, John B +1
Mathematics · #11M20 #11N05 #11N35 #11P32 #Analytic Number Theory Research #FOS: Mathematics #History and Theory of Mathematics #Number Theory (math.NT)
paper · pdf · doi:10.48550/arxiv.2303.06122
openalex publication_date 2023/03/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.