摘要
Let d(n) := p(n+1) - p(n), where pn denotes the nth smallest prime, and let R(T) := log T log(2) T log(4) T/(log(3) T)(2) (the 'Erdos-Rankin' function). We consider the sequence (d(n)/R(p(n))) of normalized prime gaps, and show that its limit point set contains at least 25% of non-negative real numbers. We also show that the same result holds if R(T) is replaced by any 'reasonable' function that tends to infinity more slowly than R(T) log(3) T. We also consider 'chains' of normalized prime gaps. Our proof combines breakthrough work of Maynard and Tao on bounded gaps between primes with subsequent developments of Ford, Green, Konyagin, Maynard and Tao on long gaps between consecutive primes.
- 出版日期2016-6