Classical small cases: up to seven runners ()
OpenLonelyRunnerConjecture.classical_small_casescombinatoricsdiophantine-approximationnumber-theory
The conjecture holds for every (up to seven runners). This combines the classical cases: trivial, Wills, Betke–Wills, Cusick–Pomerance, Bohman–Holzman–Kleitman, Barajas–Serra.
Formalization Note Stated as ∀ k ≤ 6, LRC k.
Preamble
import Mathlib import Definitions.Def_LonelyRunnerConjecture_Defs
Formal statement
namespace LonelyRunnerConjecture theorem classical_small_cases : ∀ k : ℕ, k ≤ 6 → LRC k := by sorry end LonelyRunnerConjecture
Source
G. Perarnau, O. Serra, The Lonely Runner Conjecture turns 60, https://arxiv.org/abs/2409.20160, §6 (Small number of runners); Barajas–Serra 2008, https://arxiv.org/abs/0710.4495.
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.