Search All of the Math Forum:

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

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

Topic: regular n-gon runners problem
Replies: 12   Last Post: Jul 25, 2013 4:26 AM

 Messages: [ Previous | Next ]
 quasi Posts: 12,067 Registered: 7/15/05
Re: regular n-gon runners problem
Posted: Jul 23, 2013 4:28 AM

Virgil wrote:
>quasi wrote:
>>
>> Suppose n runners, n >= 3, start at the same time and place
>> on a circular track, and proceed to run counterclockwise along
>> the track (forever), each at a distinct positive constant speed.
>>
>> Conjecture:
>>
>> If there is an instant where the locations of the n runners are
>> the vertices of a regular n-gon, then the speeds of the runners,
>> arranged in ascending order, form an arithmetic sequence.
>>
>> Remark:
>>
>> It's easy to see that the converse holds.

>
>Suppose that the speeds of the first n-1 runners are in
>proportion to 1:2:...:n-1 but the last speed is in proportion
>
>Then when the fastest finishes his second full lap,
>the rummers will all be at the vertices of a regular n-gon.
>
>So it would appear as if the conjecture is false.

Yes, it fails -- I realized as much soon after I posted.

Generalizing your example, using a track of circumference 1,
the speeds, in revolutions per unit time, could just as well
be any sequence v_1,v_2,...,v_n of positive integers such that
v_i = i (mod n). Then at time t = 1/n, the runners are at the
vertices of a regular n-gon.

quasi

Date Subject Author
7/23/13 quasi
7/23/13 Virgil
7/23/13 quasi
7/23/13 quasi
7/23/13 quasi
7/23/13 quasi
7/25/13 quasi
7/23/13 William Elliot
7/23/13 quasi
7/23/13 William Elliot
7/23/13 quasi
7/23/13 James Waldby
7/23/13 quasi