The Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by NCTM or The Math Forum.

Math Forum » Discussions » Math Topics » discretemath

Notice: We are no longer accepting new posts, but the forums will continue to be readable.

Topic: The lonely runner conjecture
Replies: 2   Last Post: Nov 4, 2012 3:27 AM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ] Topics: [ Previous | Next ]
pat devine

Posts: 2
From: uk
Registered: 11/1/12
The lonely runner conjecture
Posted: Nov 1, 2012 7:37 AM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

There is an intriguing maths conjecture called the lonely runner conjecture. It is intriguing because it is easily stated and on the face of it looks possible to prove. However, it has been unsolved for 45 years. Let me share it. There is a track of unit length upon which n runners run at n arbitrary different integer (constant) speeds. The runners never tire and run forever. The lonely runner conjecture says that at some point during this never-ending race each runner becomes lonely ( loneliness being defined as no closer than 1/n to the nearest runners).

A link to a possible proof is here. If its right its right but if its wrong it might be close enough for some genius to fill in the missing piece of the puzzle.

Any views on this or suggestions for alternative solutions.
(copy and paste link into your browser if it does't work on clicking.) or see the attachment.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© The Math Forum at NCTM 1994-2018. All Rights Reserved.