Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Proposition 9, p. 10, of Wouter van Doorn, Completeness of exponentially increasing sequences, arXiv:2602.23394v1 (25 February 2026), the version named on the source card. A preprint.
Read depth. Claims checked: the statement was read clause by clause on the page images of the print; the proof was read for structure only. Nothing here is independently reviewed.
Statement
Setting (p. 1). For positive reals and , with , indexed from . For a sequence or multiset of positive integers, is the set of integers that are sums of distinct elements of ; is complete when is finite and entirely complete when . Throughout, .
Proposition 9 (p. 10). The sequence is complete for all with
The introduction (p. 2) describes the same result with a strict inequality on ; the proposition as printed has .
Proof pointer
With and , the paper's Lemma 7 puts every integer of in and its Lemma 6 bounds the next term; sums of and of of these terms cover a run of consecutive integers long enough for Lemma 5 (pp. 10--11). The proof assumes , which the paper says it is free to do (p. 11).
Dependencies
Lemma 5, Lemmas 6 and 7 of the paper (pp. 6--7).
Bears on
- Problem 349: every pair in this unbounded region gives a complete sequence.