Previous Page 2

Displaying 21 – 36 of 36

Showing per page

On the lonely runner conjecture

Ram Krishna Pandey (2010)

Mathematica Bohemica

Suppose k + 1 runners having nonzero distinct constant speeds run laps on a unit-length circular track. The Lonely Runner Conjecture states that there is a time at which a given runner is at distance at least 1 / ( k + 1 ) from all the others. The conjecture has been already settled up to seven ( k 6 ) runners while it is open for eight or more runners. In this paper the conjecture has been verified for four or more runners having some particular speeds using elementary tools.

Currently displaying 21 – 36 of 36

Previous Page 2