Ants on a ring

Logic Level 2

Suppose you have a circular ring. On the ring are ants, randomly placed and moving clockwise or counterclockwise randomly. Each ant moves at the same constant speed. Once two ants collide, they reverse directions instantaneously keeping the same speed (there is no loss of kinetic energy in the collision). Stating from an initial configuration, which we define by the position of each ant and the direction of its motion (clockwise or counterclockwise), we assume that at a later time each ant regains its initial position, but at this time its direction of motion is inverted compared to the initial configuration. What can we say about the number of ants?

Can't say anything about the parity Even Odd

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

Assuming that the ants' movement is filmed starting from the initial configuration and ending at the moment when the conditions of the problem are satisfied. If the video is played backward, the result should be exactly the same as if it is played forward. Hence, starting from the mid-point of the video, whether the video is played forward or backward, the result should also be the same. To be convinced of this, one should simply imagine that the video is played forward and backward simultaneously. The mid-point of the video is reached at the same time in either the forward played version and the backward one, this is obvious, and the two played versions should look exactly the same. It follows that at the mid-point all the ants are in collision, hence there is an even number of ants.

Nothing can be said about the parity...if we take two cases of 3 ants and 4 ants, after some collisions, they will assume their initial configuration...

Harmeet Sokhi - 5 months, 1 week ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...