Can the Lonely Runner Conjecture apply to circular tracks of any diameter?

  • Context: High School 
  • Thread starter Thread starter Einstein's Cat
  • Start date Start date
  • Tags Tags
    Conjecture
Click For Summary
SUMMARY

The Lonely Runner Conjecture, proposed by Wills and Cusick, asserts that n runners with distinct constant speeds running around a unit circle will eventually be separated by a distance of at least 1/(n+1). This conjecture can be applied to circular tracks of any diameter, as the track can be scaled from the unit circle to any length. Terence Tao's remarks provide insights into the current boundaries and implications of the conjecture beyond its standard formulation.

PREREQUISITES
  • Understanding of the Lonely Runner Conjecture
  • Familiarity with concepts of constant speed in motion
  • Basic knowledge of mathematical proofs and conjectures
  • Awareness of scaling in geometric contexts
NEXT STEPS
  • Explore the mathematical proofs related to the Lonely Runner Conjecture
  • Investigate the implications of scaling geometric figures in conjectures
  • Study Terence Tao's contributions to mathematical conjectures
  • Learn about the applications of the Lonely Runner Conjecture in various mathematical fields
USEFUL FOR

Mathematicians, researchers in number theory, and students interested in geometric conjectures will benefit from this discussion.

Einstein's Cat
Messages
182
Reaction score
2
With the lonely runner conjecture, can the runners run along a circular track of any diameter or does the conjecture require that they run along a unit circle?
 
Mathematics news on Phys.org
The track does not have to be a circle, and, although the standard formulation has the track of unit length, it can be scaled to any length track.
 
If someone is interested in some details, i.e. current boundaries:
Some remarks on the lonely runner conjecture
Terence Tao

The lonely runner conjecture of Wills and Cusick, in its most popular formulation, asserts that if n runners with distinct constant speeds run around a unit circle ##\mathbb{R}/\mathbb{Z}## starting at a common time and place, then each runner will at some time be separated by a distance of at least ##1/(n+1)## from the others. In this paper we make some remarks on this conjecture.
 

Similar threads

  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 33 ·
2
Replies
33
Views
3K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 12 ·
Replies
12
Views
19K
  • · Replies 37 ·
2
Replies
37
Views
5K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 6 ·
Replies
6
Views
1K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 8 ·
Replies
8
Views
9K