Wiki
Wiki

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

span⁡\operatorname{span} and gap⁡\operatorname{gap} of a finite integer set with at least two elements are as on the mesh lemma page, and hh of a nonempty subset of Z/mZ\mathbb Z/m\mathbb Z (the longest run of missing residues) is as on the erosion lemma page. For W⊆ZW\subseteq\mathbb Z, W mod mW\bmod m is its image in Z/mZ\mathbb Z/m\mathbb Z.

Statement

Lemma 2.3. If span⁡(W)≥m≥1\operatorname{span}(W)\ge m\ge1 and gap⁡(W)≤k\operatorname{gap}(W)\le k, then

h(W mod m)≤k−1.h(W\bmod m)\le k-1.

Proof

Translating WW by an integer rotates W mod mW\bmod m by a fixed residue and changes neither hh, the span nor the gap, so assume min⁡W=0\min W=0. The set WW has at least two elements, so k≥1k\ge1.

If m=1m=1, then Z/1Z\mathbb Z/1\mathbb Z has one residue, W mod 1W\bmod 1 is full, and h=0≤k−1h=0\le k-1.

Let m≥2m\ge2. Let w−w_- be the largest element of WW in [0,m)[0,m); it exists because 0∈W0\in W. Let w+w_+ be the smallest element of WW with w+≥mw_+\ge m; it exists because max⁡W=span⁡(W)≥m\max W=\operatorname{span}(W)\ge m. No element of WW lies strictly between w−w_- and w+w_+, so they are consecutive in WW and w+−w−≤kw_+-w_-\le k, whence

m−w−≤w+−w−≤k.m-w_-\le w_+-w_-\le k.

Now consider the residues of the points of W∩[0,m)W\cap[0,m); these integers are their own residues, and they include 00 and w−w_-. Any two consecutive ones differ by at most kk, so between them at most k−1k-1 residues are missing. The remaining residues are w−+1,…,m−1w_-+1,\ldots,m-1, a run of length m−1−w−≤k−1m-1-w_-\le k-1, and it is followed cyclically by the residue 00, which is present. Hence every maximal run of residues missing from W∩[0,m) mod mW\cap[0,m)\bmod m has length at most k−1k-1. The residues of the other points of WW can only shorten missing runs, so h(W mod m)≤k−1h(W\bmod m)\le k-1.