Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
is the Schinzel–Szekeres set defined on the page of Lemma 2.1.
Lemma 2.10 (printed p. 265). For all , with a positive constant ,
With the lower bound recorded on the page of Lemma 2.5, the reciprocal sum of tends to .
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: has the least-common-multiple property, leaves of the integers up to unsifted, and Lemma 2.8 then bounds its reciprocal sum by .
Dependencies
Bears on
- Problem 542: the Schinzel–Szekeres sets, which have the problem's least-common-multiple property, have reciprocal sum , below for large ; 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.