Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


Source. Proposition 9, p. 10, 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 9 (p. 10). The sequence St(α)S_t(\alpha) is complete for all α\alpha with

1<α≤1+1⌈t⌉+2⌈t⌉.1<\alpha\le1+\frac1{\lceil t\rceil+2\lceil\sqrt t\rceil}.

The introduction (p. 2) describes the same result with a strict inequality on α\alpha; the proposition as printed has ≤\le.

Proof pointer

With v=⌈t⌉v=\lceil t\rceil and w=⌈t⌉w=\lceil\sqrt t\rceil, the paper's Lemma 7 puts every integer of [v,v+2w][v,v+2w] in St(α)S_t(\alpha) and its Lemma 6 bounds the next term; sums of ww and of w+1w+1 of these terms cover a run of consecutive integers long enough for Lemma 5 (pp. 10--11). The proof assumes t≥1t\ge1, which the paper says it is free to do (p. 11).

Dependencies

Lemma 5, Lemmas 6 and 7 of the paper (pp. 6--7).

Bears on

  • Problem 349: every pair in this unbounded region gives a complete sequence.