Large gaps between primes2016-05-0123 OA AI JJames Maynard * DOI:10.4007/annals.2016.183.3.3原文链接原文求助分享收藏摘要 En 中文 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.