Wiki
Wiki

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 tt and α\alpha, St(α)=(s1,s2,…)S_t(\alpha)=(s_1,s_2,\ldots) with sn=⌊tαn⌋s_n=\lfloor t\alpha^n\rfloor, indexed from n=1n=1. For a sequence or multiset SS of positive integers, P(S)P(S) is the set of integers that are sums of distinct elements of SS; SS is complete when N∖P(S)\mathbb N\setminus P(S) is finite and entirely complete when P(S)=NP(S)=\mathbb N. Throughout, φ=(1+5)/2\varphi=(1+\sqrt5)/2.

Proposition 3 (p. 5). If 51/3≤α<25^{1/3}\le\alpha<2, there is no value of t≥1t\ge1 for which St(α)S_t(\alpha) is complete.

Proof pointer

Three cases on tt (p. 5): t≥2/αt\ge2/\alpha gives s1≥2s_1\ge2 and Corollary 1 with m=1m=1, r=0r=0; otherwise t≥3/α2t\ge3/\alpha^2 gives s2≥3s_2\ge3 and Corollary 1 with m=2m=2, r=1r=1; otherwise t≥1≥5/α3t\ge1\ge5/\alpha^3 gives s3≥5s_3\ge5 and Corollary 1 with m=4m=4, r=2r=2.

Dependencies

Corollary 1.

Bears on

  • Problem 349: decides every pair with 51/3≤α<25^{1/3}\le\alpha<2 and t≥1t\ge1 (none complete); the pairs with t<1t<1 there are Graham's (1964).