共 50 条
Sifting for small primes from an arithmetic progression
被引:0
|作者:
John B. Friedlander
Henryk Iwaniec
机构:
[1] University of Toronto,Department of Mathematics
[2] Rutgers University,Department of Mathematics
来源:
关键词:
sieve;
small primes;
Linnik theorem;
11M20;
11N05;
11N35;
11P32;
D O I:
暂无
中图分类号:
学科分类号:
摘要:
In this work and its sister paper (Friedlander and Iwaniec (2023)), 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 dispense with the log-free zero density bounds and the repulsion property of exceptional zeros, two deep innovations begun by Linnik and relied on in earlier proofs.
引用
收藏
页码:2715 / 2730
页数:15
相关论文