The lonely runner conjecture for integer speed sets
Statement
Let be a set of size , and let . For , write for the distance from to the nearest integer.
Lonely runner conjecture. There exists such that
for every .
This is the formulation of the lonely runner conjecture arising from the paper's study of sets of the form . Its general status is open.
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.