arrow
返回

Small gaps between primes

delete2015-01-01
delete174
delete
OA
AI
J
James Maynard *
DOI:10.4007/annals.2015.181.1.7delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
We introduce a refinement of the GPY sieve method for studying prime k-tuples and small gaps between primes. This refinement avoids previous limitations of the method and allows us to show that for each k, the prime k-tuples conjecture holds for a positive proportion of admissible k-tuples. In particular, lim inf(n)(p(n)+(m) - p(n)) < infinity for every integer m. We also show that lim inf(p(n)+(l) - pn) <= 600 and, if we assume the Elliott-Halberstam conjecture, that lim inf(n) (p(n)+(1) - p(n)) <= 12 and lim inf(n) (p(n)+(2) - p(n)) <= 600.

期刊

Annals of Mathematics 封面图
Annals of Mathematics
IF:
5.3
论文数:
1.4K
被引数:
1.6W

机构

暂无机构信息
引用论文

引用论文

err
IF0
err
err0
PREAI
err
err分享
err收藏
Primes in tuples I
err2009-09-01
err138
errOAAI
errGoldston, Daniel A.; Pintz, Janos; Yildirim, Cem Y.
err分享
err收藏
Bounded gaps between primes
err2014-05-01
err244
errOAAI
errZhang, Yitang
err分享
err收藏
err分享
err收藏
没有更多内容