Runner Alignments on Circular Tracks: Meeting Times and Speed Combinations

[Gerenuk]

If I have n runners on a circular tracks at different speeds s_i, will they always meet up arbitrarily close together in a group?

So does there always exist a time t such that
<br /> \forall i,\varepsilon&gt;0 ,\exists t: [t\cdot s_i]&lt;\varepsilon<br />
where the bracket denote the fractional (non-integer) part.

And if that time always exists, what is the combination of runner speeds such that it takes them longest time to meet up again?

 

[ramsey2879]

If I have n runners on a circular tracks at different speeds s_i, will they always meet up arbitrarily close together in a group?

So does there always exist a time t such that
<br /> \forall i,\varepsilon&gt;0 ,\exists t: [t\cdot s_i]&lt;\varepsilon<br />
where the bracket denote the fractional (non-integer) part.

And if that time always exists, what is the combination of runner speeds such that it takes them longest time to meet up again?

Lets make this into a simple problem using whole numbers to specify the number of revolutions per minute A1,A2,A3,...A(n) all "n" whole numbers being coprime to each other. If they all start up on the same radius, at a time t they will indeed all be radially aligned again. Can you prove this?

 

[Gerenuk]

Lets make this into a simple problem using whole numbers to specify the number of revolutions per minute A1,A2,A3,...A(n) all "n" whole numbers being coprime to each other. If they all start up on the same radius, at a time t they will indeed all be radially aligned again. Can you prove this?

All rationals is easy to prove I guess, so I'm more worried about algebraic independent numbers (if that's the correct term). And it's easy to show that 3 runners will meet.
But I'm not sure about more of them, since it might take so long before this 3 group meets the 4th runner, so that the 3 group might split by that time.
I found http://eom.springer.de/k/k055910.htm but that doesn't help either?

 

[dodo]

Here is my take on the problem. I hope I'm not wrong bigtime. : ) -- Edit P.S.: oh well, this was the "easy" part that Gerenuk referred to.

Let T_i = 2 \pi R / s_i be the period (time to complete one revolution) of each runner.

Then you look for positive integers n_i, such that all n_i T_i are equal.

Since some T_i can be rational and some irrational, this won't be generally possible. But you can always find rational approximations to your T_i (f.i. by a bisection method), as close to the originals as you wish.

So assume now that all T_i are expressed as the reduced fraction a_i / b_i, with a_i, b_i coprime integers.

Let L be the least common multiple of all b_i. The integer c_i = a_i L / b_i is the numerator of each fraction, when expressed with L as the (common) denominator. Let C be the lcm of all c_i; now each n_i will be C / c_i. As we have taken the least common multiple on each step, there are no smaller integers satisfying this condition.

 

[Gerenuk]

But you can always find rational approximations to your T_i (f.i. by a bisection method), as close to the originals as you wish.

As you noticed there is a tricky part

The rational approximation might need such long times to meet up, so that the small deviation from rationals isn't small anymore.

 

[Gerenuk]

Oh, I was wrong. That guy Kronecker did actually prove it and the link I mentioned contains the statement.

 

[dodo]

I am pretty much lost in that topology link, but I do think there is a problem with my argument. Looking for an *exact* match after n_i revolutions each, given rational approximations of the periods, is exceptionally impractical. What you were asking is if the runners *approximately* meet after some revolutions, which is a completely different question. My apologies for the pointless ornamentation. : )

 

[Gerenuk]

Looking for an *exact* match after n_i revolutions each, given rational approximations of the periods, is exceptionally impractical. What you were asking is if the runners *approximately* meet after some revolutions, which is a completely different question.

Your result for rational numbers solves the problem. An exact match is of course also an approximate match.
Yet, for irrational numbers this proof doesn't work. In the problem I pose I'm looking for an "arbitrary close" match (not exact though), but it's not that trivial to show that this occurs. You can of course approximate all number by rational, but this still existing little deviation might be blown up, once the number is multiplied by a large number of revolutions.

 

[dodo]

Your result for rational numbers solves the problem. An exact match is of course also an approximate match.

Not really. Two runners with periods 333/1000 and 667/1000 will meet at 222111 turns of the first, while what you probably wanted to know is that they nearly meet every other turn at the beginning.

(Edit: sorry, I meant 667 turns of the first, not 222111. But you get the idea.)

 

[Gerenuk]

You were right in the first place with your derivation.
I actually have "no time" limit. I wanted to know if they ever meet within any given distance.