Wills–Cusick Lonely Runner Conjecture
Statement
Let runners with distinct constant speeds run around the unit circle, starting at a common time and place. Identify the unit circle with , and let denote the distance to the nearest integer. Equivalently, let be any distinct positive integers. Lonely Runner Conjecture. For each , there exists a time such that
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.