Wiki
Wiki

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

Updated


Statement

SxS_x is the Schinzel–Szekeres set defined on the page of Lemma 2.1.

Lemma 2.10 (printed p. 265). For all xx, with a positive constant c4<1c_4<1,

∑a∈Sx1/a≤1+O(log⁡−c4x).\sum_{a\in S_x}1/a\le1+O(\log^{-c_4}x).

With the lower bound ∑a∈Sx1/a≥1−log⁡−c3x\sum_{a\in S_x}1/a\ge1-\log^{-c_3}x recorded on the page of Lemma 2.5, the reciprocal sum of SxS_x tends to 11.

Source. I. Z. Ruzsa, On the small sieve. II. Sifting by composite numbers, J. Number Theory 14 (1982), 260–268; Lemma 2.10 on printed p. 265. The edition is identified in the source digest.

Read depth. Claims checked: the statement was read on the page images. The proof was not checked.

Proof pointer

The paper calls it an immediate consequence of Lemmas 2.1, 2.5 and 2.8: SxS_x has the least-common-multiple property, leaves δ≤log⁡−c3x\delta\le\log^{-c_3}x of the integers up to xx unsifted, and Lemma 2.8 then bounds its reciprocal sum by 1+3δ1+3\sqrt\delta.

Dependencies

Bears on

  • Problem 542: the Schinzel–Szekeres sets, which have the problem's least-common-multiple property, have reciprocal sum 1+O(log⁡−c4x)1+O(\log^{-c_4}x), below 31/3031/30 for large xx; this concerns that family only, not every admissible set.
  • It feeds the upper bounds of Theorem I and Theorem II, which bear on Problem 784.