Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Proposition 4, p. 5, 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 4 (p. 5). If , then is (entirely) complete if and only if .
Proof pointer
For the argument of Proposition 3 gives non-completeness. For smaller , Theorem 2 of Graham (1964) allows ; then , , , and Lemma 4 with the paper's Lemma 3 (Graham's Lemma 2, p. 4) gives entire completeness (p. 5).
Dependencies
Corollary 1, Lemma 4, Lemma 3 of the paper, and Theorem 2 of Graham (1964).
Bears on
- Problem 349: decides every pair with .