Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Proposition 7, p. 6, 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 7 (p. 6). If , then is complete for all .
Proof pointer
Proved on pp. 7--8 by case analysis on which small integers occur in , using the paper's Lemma 6 ( for ) and Lemma 7 (if for some , every integer in is a term), and closing each case with Lemma 5.
Dependencies
Lemma 5, Lemmas 6 and 7 of the paper (pp. 6--7).
Bears on
- Problem 349: every pair with and gives a complete sequence, a region below beyond the entire-completeness range of Proposition 6.