Inquiries about lonely runner conjecture

  • B
  • Thread starter Einstein's Cat
  • Start date
  • Tags
    Conjecture
In summary: Once a runner achieves loneliness, it is maintained even if the distance between it and the other runners decreases. This is because loneliness is defined as being at least 1/k away from all other runners simultaneously.
  • #1
Einstein's Cat
182
2
Here is the Wikipedia article on the lonely runner conjecture

https://en.m.wikipedia.org/wiki/Lonely_runner_conjecture#

I have some inquires about it.

Firstly I am right in thinking that "pair wise distinct" means that the speed of all runners are different?

Also does every runner have to be at least 1/k (k is the number of runners) from all the other runners simultaneously? Or can runners achieve "loneliness" at a certain time even whilst other runners have not?

Furthermore, once a runner achieves "loneliness" is it maintained? In other words say a runner is lonely, does it stay lonely even if the distance between it and the other runners decreases to become smaller than 1/k afterwards?
 
Last edited:
Mathematics news on Phys.org
  • #2
Einstein's Cat said:
Firstly I am right in thinking that "pair wise distinct" means that the speed of all runners are different?
Yes. If two runners have the same speed, then they are never lonely, and the problem gets trivial.

Runners can achieve loneliness independent of other runners (otherwise the problem would be trivial again).
Einstein's Cat said:
Furthermore, once a runner achieves "loneliness" is it maintained? In other words say a runner is lonely, does it stay lonely even if the distance between it and the other runners decreases to become smaller than 1/k afterwards?
Sure.
 
  • Like
Likes Einstein's Cat

1. What is the lonely runner conjecture?

The lonely runner conjecture is a mathematical conjecture that states that for any positive integer k, there exists a positive integer N such that if k runners run around a circular track with integer lengths at different constant speeds, at some point during their runs, all k runners will be exactly N units apart.

2. Who proposed the lonely runner conjecture?

The lonely runner conjecture was first proposed by mathematician John H. Conway in 1967.

3. Has the lonely runner conjecture been proven?

No, the lonely runner conjecture has not been proven. It remains an unsolved problem in mathematics and is considered a conjecture rather than a theorem.

4. Are there any known counterexamples to the lonely runner conjecture?

No, there are no known counterexamples to the lonely runner conjecture. However, there have been several attempts at disproving it, but none have been successful so far.

5. Why is the lonely runner conjecture important?

The lonely runner conjecture is important because it is a challenging and intriguing problem in mathematics that has yet to be solved. It has also sparked further research and investigation into related topics, such as number theory and combinatorics.

Similar threads

  • Calculus and Beyond Homework Help
Replies
2
Views
2K
Replies
9
Views
1K
  • Linear and Abstract Algebra
Replies
2
Views
3K
  • Special and General Relativity
3
Replies
75
Views
3K
Replies
6
Views
1K
Replies
13
Views
2K
  • Cosmology
Replies
4
Views
1K
  • General Discussion
Replies
4
Views
667
Replies
5
Views
4K
  • Set Theory, Logic, Probability, Statistics
Replies
1
Views
3K
Back
Top