Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Proposition 3, 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 3 (p. 5). If , there is no value of for which is complete.
Proof pointer
Three cases on (p. 5): gives and Corollary 1 with , ; otherwise gives and Corollary 1 with , ; otherwise gives and Corollary 1 with , .
Dependencies
Bears on
- Problem 349: decides every pair with and (none complete); the pairs with there are Graham's (1964).