A weakly complete sequence is a sequence of numbers
for which every positive integer
beyond a certain point
is the sum of a finite subsequence
of
(Honsberger 1985). Dropping two terms from the Fibonacci
numbers produces a sequence which is not even weakly
complete. However, the sequence
is weakly complete, even with any finite subsequence deleted (Graham 1964).
Yu and Chen (2026) proved that if and
are positive real
numbers and
is irrational, then the interleaved sequence
with terms
and
for
is weakly complete, where
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.