ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let nn runners with distinct constant speeds run around the unit circle, starting at a common time and place. Identify the unit circle with T=R/Z\mathbf{T}=\mathbf{R}/\mathbf{Z}, and let ∥⋅∥T\lVert\cdot\rVert_{\mathbf{T}} denote the distance to the nearest integer. Equivalently, let w1,w2,…,wn∈Nw_1,w_2,\dots,w_n\in\mathbf{N} be any nn distinct positive integers. Lonely Runner Conjecture. For each i∈[n]i\in[n], there exists a time t∈Rt\in\mathbf{R} such that

min⁡j≠i∥t(wi−wj)∥T⩾1n.\min_{j\neq i}\lVert t(w_i-w_j)\rVert_{\mathbf{T}}\geqslant \frac{1}{n}.

The conjecture was raised independently by Wills and Cusick and is a central problem in Diophantine approximation and view-obstruction theory. The original formulation allows distinct real speeds; the source notes that this is equivalent to the integer formulation. The paper discusses improved lower bounds toward the conjectured value.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.