Wiki
Wiki

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 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 5 (p. 5). If 32≤α<φ\tfrac32\le\alpha<\varphi, then St(α)S_t(\alpha) is entirely complete if and only if t<3α2t<\frac3{\alpha^2}. In particular, if t≤9−352t\le\frac{9-3\sqrt5}2, then St(α)S_t(\alpha) is entirely complete for all these values of α\alpha.

The statement concerns entire completeness only: for t≥3/α2t\ge3/\alpha^2 it says nothing about completeness.

Proof pointer

As in Proposition 4: with t≥1t\ge1, s1=1s_1=1 and s2=2s_2=2, and Lemma 4 with the paper's Lemma 3 gives entire completeness; for t≥3/α2t\ge3/\alpha^2, s2≥3s_2\ge3, so 22 is not a subset sum (p. 5).

Dependencies

Lemma 4, Lemma 3 of the paper, and Graham (1964) for t<1t<1.

Bears on

  • Problem 349: entire completeness implies completeness, so every pair with 32≤α<φ\tfrac32\le\alpha<\varphi and t<3/α2t<3/\alpha^2 gives a complete sequence; the pairs with t≥3/α2t\ge3/\alpha^2 are left open by this result.