Maths Olympiad Prep

Library / Harvard-MIT Mathematics Tournament /285 of 352

Harvard-MIT Mathematics Tournament

Geometry Difficulty 5.5 AIME, harder Prove it United States

Problem:

At time 00, an ant is at (1,0)(1,0) and a spider is at (−1,0)(-1,0). The ant starts walking counterclockwise along the unit circle, and the spider starts creeping to the right along the xx-axis. It so happens that the ant's horizontal speed is always half the spider's. What will the shortest distance ever between the ant and the spider be?

Solution

Solution:

Picture an instant in time where the ant and spider have xx-coordinates aa and ss, respectively. If 1≤s≤31 \leq s \leq 3, then a≤0a \leq 0, and the distance between the bugs is at least 11. If s>3s > 3, then, needless to say, the distance between the bugs is at least 22. If −1≤s≤1-1 \leq s \leq 1, then s=1−2as = 1 - 2a, and the distance between the bugs is
(a−(1−2a))2+(1−a2)=8a2−6a+2=(8a−3)2+78 \sqrt{(a - (1 - 2a))^2 + (1 - a^2)} = \sqrt{8a^2 - 6a + 2} = \sqrt{\frac{(8a - 3)^2 + 7}{8}}
which attains the minimum value of 7/8\sqrt{7/8} when a=3/8a = 3/8.

Want a route through all this instead of an archive? The track puts 2,604 problems in a working order, from Junior Challenge level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.