Wiki
Wiki

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

Updated


The claim. Let s1<s2<⋯s_1<s_2<\cdots be the squarefree numbers, the set BB of Problem 489 for A={p2:p prime}A=\{p^2:p\text{ prime}\}, and for t≥1t\ge1 let βt\beta_t be the density of the sis_i with si+1−si=ts_{i+1}-s_i=t, which exists (Lemma 1, p. 107). Then

∑si+1≤x(si+1−si)2=x∑t≥1t2βt+o(x),∑t≥1t2βt<∞,\sum_{s_{i+1}\le x}(s_{i+1}-s_i)^2=x\sum_{t\ge1}t^2\beta_t+o(x), \qquad\sum_{t\ge1}t^2\beta_t<\infty,

so the mean squared gap tends to a finite limit. This is the case α=2\alpha=2 of display (23), p. 107, of P. Erdős, Some problems and results in elementary number theory, Publ. Math. Debrecen 2 (1951), 103--109, received 4 May 1951 (the date this page is named by). The paper conjectures (23), ∑si+1≤x(si+1−si)α=Cαx+o(x)\sum_{s_{i+1}\le x}(s_{i+1}-s_i)^\alpha=C_\alpha x+o(x), for every α\alpha, says that it can be proved for α<A\alpha<A with AA between 22 and 33, and sketches the proof for α=2\alpha=2: Lemma 2 (p. 107) bounds the number of si<xs_i<x with gap above tt by c17x/(t2(log⁡t)2)c_{17}x/(t^2(\log t)^2), because a gap of length rr contains at least r/16r/16 integers divisible by the square of a prime above tlog⁡t/100t\log t/100, by the Chebyshev prime count and the convergence of ∑1/P2\sum1/P^2; displays (28) and (29), pp. 108--109, then compare the sum over large gaps with Lemma 1's densities. The card Erdős (1951) records the result. Erdős's 1961 problem list, the site's source for the problem (Erdős (1961), printed pp. 236--237), states the result as (I.28.2), with the normalization 1n∑si<n\frac1n\sum_{s_i<n}, cites this paper for it, and poses the general question as (I.28.3) for a sequence with ak/k2→∞a_k/k^2\to\infty, adding that under ak<ck2a_k<ck^2 alone the limit need not exist. The paper's closing remarks (p. 109) bear on the general case: for a1<a2<⋯a_1<a_2<\cdots with ∑1/ai<∞\sum1/a_i<\infty the gap densities of the non-multiples exist, and for every ε\varepsilon the gaps above a constant cεc_\varepsilon contribute less than εx\varepsilon x to the first moment below xx, but for the aa's in the intervals [2k,2k(1+1/k2)][2^k,2^k(1+1/k^2)] the normalized (1+ε)(1+\varepsilon)-moment of the gaps is unbounded although ∑1/ai<∞\sum1/a_i<\infty; whether this can happen for pairwise coprime aa's is left open there.

Covers. The instance A={p2:p prime}A=\{p^2:p\text{ prime}\}, for which BB is the squarefree numbers: the limit exists and is finite. Not covered: any other AA.

Acceptance. Refereed: the journal publication cited above. The site's commentary credits Erdős with the existence of the limit in this case; on a problem the site labels OPEN, that credit is context, not acceptance.

Depends on. Nothing in this wiki.