The Loneliness Spectrum Conjecture
Statement
Let be positive integers, and let
where denotes the absolute distance from to the nearest integer. The Loneliness Spectrum Conjecture. One has either
or
This conjecture refines the Lonely Runner Conjecture by describing the possible values below . Kravitz proved it for , but the paper gives counterexamples for and , so the conjecture is refuted.
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.