Lonely Runner Conjecture (general formulation)
Establish that for every integer k ≥ 1 and every set of k distinct positive integers v1, ..., vk, there exists a real number t such that ||t·vi|| ≥ 1/(k+1) for all indices i ∈ {1, ..., k}.
References
The Lonely Runner Conjecture is a well-known open problem in combinatorial number theory and Diophantine approximation. For all integer k ≥ 1, and every set of distinct positive integers v1, ..., vk, there exists a real number t such that for every i, we have ||tv_i|| ≥ 1/(k+1).
— The lonely runner conjecture holds for eight runners
(2509.14111 - Rosenfeld, 17 Sep 2025) in Section 1 (Introduction), Conjecture [Lonely Runner Conjecture] (second formulation)