Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source. Y. Yu and K. Chen, Erdős Problem 354(i): Strong Completeness of Two Dyadic Floor Sequences, manuscript of 13 September 2026, Lemma 2.3 with its display (2.3), physical p. 4, in the seventeen-page PDF held by its library source card, Yu and Chen (2026).
Standing. This is an author-recorded reconstruction. It is not an independent review, changes no status and assigns no tier.
Definitions
and of a finite integer set with at least two elements are as on the mesh lemma page, and of a nonempty subset of (the longest run of missing residues) is as on the erosion lemma page. For , is its image in .
Statement
Lemma 2.3. If and , then
Proof
Translating by an integer rotates by a fixed residue and changes neither , the span nor the gap, so assume . The set has at least two elements, so .
If , then has one residue, is full, and .
Let . Let be the largest element of in ; it exists because . Let be the smallest element of with ; it exists because . No element of lies strictly between and , so they are consecutive in and , whence
Now consider the residues of the points of ; these integers are their own residues, and they include and . Any two consecutive ones differ by at most , so between them at most residues are missing. The remaining residues are , a run of length , and it is followed cyclically by the residue , which is present. Hence every maximal run of residues missing from has length at most . The residues of the other points of can only shorten missing runs, so .