Sifting for small primes from an arithmetic progression
Number Theory
2023-03-13 v1
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.
Cite
@article{arxiv.2303.06122,
title = {Sifting for small primes from an arithmetic progression},
author = {John B Friedlander and Henryk Iwaniec},
journal= {arXiv preprint arXiv:2303.06122},
year = {2023}
}
Comments
Acceted for publication in SCIENCE CHINA Math