Large gaps between primes
成果类型：
Article
署名作者：
Maynard, James
刊物名称：
ANNALS OF MATHEMATICS
ISSN/ISSBN：
0003-486X
DOI：
10.4007/annals.2016.183.3.3
发表日期：
2016
页码：
915-933
关键词：
摘要：
We show that there exist pairs of consecutive primes less than x whose difference is larger than t(1 + o(1))(logx)(log log x) (log log log log x) (log log log x)(-2) for any fixed t. This answers a well-known question of Erdos.