Two runners start at vertices A and B simultaneously and run clockwise around the perimeter of square ABCD at the same speed. A drone flies so that it is always at the midpoint of the two runners. What is the minimum distance between the two runners? What is the maximum distance between the two runners?
I don't know how to solve this, so I'm going to try to figure it out,
starting out by assuming the length of a side of the square is 1.
While each of the runners is at their corner, the distance is 1.000.
Picture it ... when each runner has run a fourth of the side of the
square, the straight line distance between them is sqrt(0.752 + 0.252)
I'll spare you the arithmetic, that answer is 0.791.
Then next ... when each runner has run a third of the side of the
square, the straight line distance between them is sqrt(0.672 + 0.332)
I'll spare you the arithmetic, that answer is 0.747.
And then ... when each runner has run a half of the side of the
square, the straight line distance between them is sqrt(0.52 + 0.52)
I'll spare you the arithmetic, that answer is 0.707.
You can see that the distance decreases as the runners approach the
midpoint of their respective sides, and then as they pass the midpoints,
the distance will start increasing again until they reach the next corner.
Conclusion. The maximum distance between the runners is 1.000.
The minimum distance between the runners is 0.707.
.