Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claims
2005_08_10_goldston_pintz_yildirim: Theorem 2 of Goldston, Pintz and Yıldırım (Ann. of Math. 2009): the liminf of the prime gap over log p_n is 0, so 0 is a limit point, the case C = 0 of the question; accepted on the refereed publication.
2013_05_27_pintz: Theorem 3 of Pintz's chapter in From Arithmetic to Zeta-Functions (2016): every C in [0, c] is a limit point of the normalized prime gaps, for an ineffective c > 0; claimed, with no evidence of refereeing.
Linked from (1)
Graph