Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Claim. Write JJ for the set of limit points of (pn+1−pn)/log⁡n(p_{n+1}-p_n)/\log n. Theorem 3 of J. Pintz, Polignac numbers, conjectures of Erdős on gaps between primes, arithmetic progressions in primes, and the bounded gap conjecture, From Arithmetic to Zeta-Functions, Springer (2016), 367--384, states: "There is an ineffective constant c>0c>0 such that [0,c]⊂J[0,c]\subset J." Each CC in [0,c][0,c] is then the limit of (pni+1−pni)/log⁡ni(p_{n_i+1}-p_{n_i})/\log n_i along some sequence nin_i, which answers the question of Problem 5 yes for those CC. The chapter is described on its library card.

Covers. C=0C=0 and every CC in [0,c][0,c] for an ineffective c>0c>0 that the paper does not determine; no positive CC is named.

Depends on. Nothing in this wiki.

Standing. Claimed. The result appeared as a chapter of the edited volume From Arithmetic to Zeta-Functions (Springer 2016), with no evidence that the chapter was refereed, so no refereed evidence is listed. Not reviewed: the site's commentary credits [0,c]⊂S[0,c]\subset S to [Pi16], but the site labels the problem OPEN, so that commentary is not acceptance.