Ask your own question, for FREE!
Mathematics 4 Online
OpenStudy (anonymous):

The Lonely runner conjecture: if k+1 runners with pairwise distinct speeds run round a track of unit length, will every runner be "lonely" (that is, be at least a distance 1/(k+1) from each other runner) at some time?... answer that K_V8 '- .-

OpenStudy (anonymous):

@K_V8

OpenStudy (anonymous):

Please

OpenStudy (anonymous):

honestly I am only in alg 2. sorry. :)

OpenStudy (anonymous):

>_> some help thanks alot

OpenStudy (anonymous):

good thing I dont really need help.... this is on the list of the worlds most unsolved math problems...

Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!
Can't find your answer? Make a FREE account and ask your own questions, OR help others and earn volunteer hours!

Join our real-time social learning platform and learn together with your friends!