1. We need to find the values of k such that the three flies meet at a location different from their starting point. The flies travel at speeds of 2, 6, and k meters per second, respectively, on a circular track with a circumference of 1000 meters.
2. Let t be the time in seconds when the flies meet again at a location different from their starting point. The positions of the flies at time t can be described by the following congruences:
2t≡6t≡kt(mod1000)
3. For the flies to meet at the same point, the positions must be congruent modulo 1000. This gives us the system of congruences:
2t≡6t(mod1000)
6t≡kt(mod1000)
4. From the first congruence, we have:
2t≡6t(mod1000)⟹4t≡0(mod1000)⟹t≡0(mod250)
This implies that t must be a multiple of 250.
5. From the second congruence, we have:
6t≡kt(mod1000)⟹t(k−6)≡0(mod1000)
Since t≡0(mod250), we can write t=250m for some integer m. Substituting this into the congruence, we get:
250m(k−6)≡0(mod1000)
Dividing both sides by 250, we obtain:
m(k−6)≡0(mod4)
6. For this congruence to hold for any integer m, k−6 must be a multiple of 4. Therefore, we can write:
k−6=4n⟹k=4n+6
for some integer n.
7. Given the constraint 7≤k≤2013, we substitute k=4n+6 and solve for n:
7≤4n+6≤2013
Subtracting 6 from all parts of the inequality:
1≤4n≤2007
Dividing by 4:
41≤n≤501.75
Since n must be an integer, we have:
1≤n≤501
8. Therefore, n can take any integer value from 1 to 501, inclusive. This gives us 501 possible values for n, and hence 501 possible values for k.
The final answer is 501