The following is from Art and Craft of Problem Solving, Paul Zeitz, third edition.
Example 3.1.6 and Problem 3.1.19
Four bugs are situated at each vertex of a unit square. Suddenly, each bug begins to chase its counterclockwise neighbor. As the bugs travel, they “turn”. For example, if one bug starts out facing due north, but then gradually comes to face due west, it will have turned $90^\circ$. It may even be that the bugs turn more than $360^\circ$. How much does each bug turn (in degrees) before they crash into each other?
I don't quite understand what is the question asking.
Is it not the case that each bug turns by $90$ degrees? Initially, suppose a particular bug faced north, at its neighbour, and then as time passed the bug continuously turned in order to ensure it always was facing the same neighbour, until it crashed into it at the centre of the square, where it would now be facing west.
So, the total "turn" equals $90$ degrees.
What am I missing?
*Okay, the solution in the Instructor's Manual is as follows: I found the solution: Can you please explain this to me: "There will be an infinite amount of rotation. Consider the situation after the bugs have each rotated 1 degree. They are now, as before, lying at four vertices of a square, with exactly the same situation as at the start, in terms of angular relationships. Except for scale, it would be impossible to tell if this was not the starting configuration. Hence the bugs will rotate yet another degree, and another, and another . . ."
Is the above a sound solution? I ask because, the author seems to be assuming that bugs would rotate even after crashing into each other. Am I right? Otherwise, who is to say there is no upper bound on the number of times the bugs rotate. In other words, the author seems to be assuming there would be an infinite number of "another degree, another degree..." and so on. But what if they crash into each other after a finite number of rotations?
