Attracting Bugs
N bugs are initially located at the vertices of a regular N-gon, whose sides have
length L. At a given moment, they all begin crawling with equal speeds in the
clockwise direction, directly towards the adjacent bug. They continue to walk directly
toward the adjacent bug, until they finally all meet at the center of the N-
gon.
How many times does each bug spiral around the center?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
1 solution
Here as far as the answer is concerned, the only answer which is not dependent on N &L( N,L are not specified) is infinity. Now, another way of looking at the question is to take L to be infinitely small and N to be infinitely large. Now intuitively they all will lie on a circle. And the answer is obvious. But i don't think the question has the same answer for every value of N and L.