TOPICS
Search

Weakly Complete Sequence


A weakly complete sequence is a sequence of numbers V={nu_n} for which every positive integer n beyond a certain point N is the sum of a finite subsequence of V (Honsberger 1985). Dropping two terms from the Fibonacci numbers produces a sequence which is not even weakly complete. However, the sequence

 F_n^'=F_n-(-1)^n

is weakly complete, even with any finite subsequence deleted (Graham 1964).

Yu and Chen (2026) proved that if alpha and beta are positive real numbers and alpha/beta is irrational, then the interleaved sequence with terms |_2^jalpha_| and |_2^jbeta_| for j>=0 is weakly complete, where |_x_| denotes the floor function. In fact, every sufficiently large integer is a sum of distinct nonzero values from the two sequences, even after any finite set of values is deleted. This answers part (i) of problem 354 in the Erdős problems collection.

Yu and Chen used AI in the mathematical development and Lean formalization. Their published build and axiom audit report that the indexed result and the finite-deletion strengthening use only Lean's standard axioms. Conjectures.io (2026) also reports a successful Lean check of a separate proof of the indexed statement by JenW1N.

Part (ii) asks whether some fixed base between 1 and 2 works for every such pair of coefficients. Kitamura (2026) supplied an AI-assisted Lean proof that the square root of the golden ratio works. For this base even a single sequence with any positive coefficient is weakly complete. Kitamura reported successful kernel checking using Lean's standard axioms. Geneson (2026) showed that other bases can fail by constructing a base and a pair with irrational ratio for which both sequences consist entirely of even integers.


See also

Complete Sequence

Explore with Wolfram|Alpha

References

Conjectures.io. "Erdős Problem 354 -- Part I." Sep. 15, 2026. https://conjectures.io/problems/erdos354-erdos-354-parts-i.Geneson, J. "Deletion Thresholds and Exponential Examples for Complete Sequences." 20 Sep 2026. https://arxiv.org/abs/2609.25107.Graham, R. "A Property of Fibonacci Numbers." Fib. Quart. 2, 1-10, 1964.Honsberger, R. Mathematical Gems III. Washington, DC: Math. Assoc. Amer., p. 128, 1985.Kitamura, K. "A Lean Proof of Erdős Problem 354(ii)." 2026. https://github.com/KitaKen1/erdos-354-part-ii/tree/5536b1874d734cfaac522a379722b8cd828dd343.Yu, Y. and Chen, K. "Erdős Problem 354(i): Strong Completeness of Two Dyadic Floor Sequences." Sep. 13, 2026. https://github.com/Andrewyzzz/erdos354/blob/c735d9389a79a2aa20fc04103d8890dd330b531e/proof/FORMALIZED_PROOF.pdf. Lean audit: https://github.com/Andrewyzzz/erdos354/blob/c735d9389a79a2aa20fc04103d8890dd330b531e/formalization/logs/fresh-verification.json.

Referenced on Wolfram|Alpha

Weakly Complete Sequence

Cite this as:

Weisstein, Eric W. "Weakly Complete Sequence." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/WeaklyCompleteSequence.html

Subject classifications