Abstract
The lonely runner conjecture asserts that for any positive integer n and any positive numbers v1 1/(n+1) for every i = 1, . . . , n. We verify this conjecture for n > 16342 under assumption that the speeds of the runners satisfy vj+1 vj > 1 + 33 log n n for j = 1, . . . , n− 1.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
