Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Proposition 5, 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 5 (p. 5). If , then is entirely complete if and only if . In particular, if , then is entirely complete for all these values of .
The statement concerns entire completeness only: for it says nothing about completeness.
Proof pointer
As in Proposition 4: with , and , and Lemma 4 with the paper's Lemma 3 gives entire completeness; for , , so is not a subset sum (p. 5).
Dependencies
Lemma 4, Lemma 3 of the paper, and Graham (1964) for .
Bears on
- Problem 349: entire completeness implies completeness, so every pair with and gives a complete sequence; the pairs with are left open by this result.