Lonely runner conjecture
OpenLonelyRunnerConjecture.lonely_runner_conjectureThe lonely runner conjecture. Runners start together at on a circular track of length , each with a distinct positive integer speed. For every and every set of distinct positive integer speeds there is a time at which every runner is at distance at least from the start:
Equivalently, every runner is sometimes lonely. The threshold is best possible (Dirichlet approximation). A counterexample — a set of distinct positive integers such that at every time some runner is within of — would disprove the conjecture; this is the task posed by Epoch AI. The cases are trivial.
Formalization Note Speeds are a Finset ℕ of positive integers (distinctness automatic); is distToNearestInt. The statement is ∀ k, LRC k.
import Mathlib import Definitions.Def_LonelyRunnerConjecture_Defs
namespace LonelyRunnerConjecture theorem lonely_runner_conjecture : ∀ k : ℕ, LRC k := by sorry end LonelyRunnerConjecture
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.