Status. Complete elementary proof. Exact check for in verify.py (standard library only). No Lean formalization. Unrefereed.
Statement
For a finite set of positive integers put , where is the distance to the nearest integer, and write . The Lonely Runner Conjecture predicts . For the speeds this prediction is , and Zhang asks whether it is ever attained. [Z26, Question 8.4]
Question 8.4 (Zhang). Is for all and all ?
Zhang proves this when some integer in is coprime to , in particular for , and leaves the remaining open. [Z26, Theorem 2.9 and Corollary 2.10]
Theorem. Let and .
- If , then .
- If , let be the least integer with . Then and . Moreover unless .
Consequently for all and all . The answer to Question 8.4 is yes.
By a theorem of Liu quoted by Zhang, equality holds in case 2. [Z26, Section 2.3, citing Liu] With case 1 this determines every deletion value:
Proof
Case 1. Here , since would force . Take . Every satisfies and , so and . Hence . Conversely the set contains , and by Dirichlet's theorem every real has some with . Hence .
If also , then .
Case 2. Let be coprime to and choose with . Put and let . Since is a unit modulo :
- would give , impossible as ;
- would give , hence , which is excluded;
- would give , hence , which is outside .
So and for every such . This proves ; it is Zhang's Theorem 2.9, and the argument is included to keep the note self-contained.
Among the consecutive integers exactly one is congruent to modulo , and it is coprime to . So . If this gives . If , then is itself coprime to , so , and exactly when , that is, when .
For we therefore get .
Cases 1 and 2 cover all , which proves the consequence. For the set is with , so the restriction cannot be dropped.
Remarks
- The upper range is exactly the range not covered by Zhang's coprimality criterion when is close to : the interval is then short or empty. There the time settles the matter at once. Zhang's proof of his Lemma 2.4 already evaluates the runners at for , for a different purpose.
- In the lower range the pigeonhole choice replaces the Jacobsthal-function bound and removes the restriction .
- The equality case of the prediction is , the consecutive tight set.
Verification
python3 verify.py # n <= 40, 779 cases, about 15 secondsThe script computes exactly, in integers, from the candidate times with in the set, compares with the displayed formula for every and , checks the strict inequality in all 740 cases with and , and checks the witness time of case 2.
Sources
- [Z26] Y. Zhang, Tight instances of the Lonely Runner Conjecture: complete classification of one-entry modifications, a new infinite family, and the growth bound, arXiv:2608.13599, version 3 (18 October 2026). Question 8.4; Lemma 2.1 (Dirichlet); Theorem 2.9; Corollary 2.10; Section 2.3 for the quoted theorem of Liu on .
- The theorem of Liu is used only for the remark that equality holds in case 2. We did not consult the original and quote it through [Z26].
verify.pyconfirms the equality for .