Wiki
Wiki

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 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 4 (p. 5). If φ≤α<51/3\varphi\le\alpha<5^{1/3}, then St(α)S_t(\alpha) is (entirely) complete if and only if t<min⁡(3α2,5α3)t<\min\left(\frac3{\alpha^2},\frac5{\alpha^3}\right).

Proof pointer

For t≥min⁡(3/α2,5/α3)t\ge\min(3/\alpha^2,5/\alpha^3) the argument of Proposition 3 gives non-completeness. For smaller tt, Theorem 2 of Graham (1964) allows t≥1t\ge1; then s1=1s_1=1, s2=2s_2=2, s3=4s_3=4, 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 φ≤α<51/3\varphi\le\alpha<5^{1/3}.