Browse · MathNet
PrintBalkan Mathematical Olympiad Shortlisted Problems
geometry
Problem
A rabbit is at some point in the Euclidean plane. There are some (possibly infinitely many) landmines, which are circles with any radius that do not intersect except possibly at one point (tangent). Every move, the rabbit can hop a distance of exactly , but cannot land in the interior of a landmine (but may possibly land on the edge). Suppose that neither the rabbit nor the origin is in a landmine. Find the minimum so that the rabbit can always reach a point with a distance of at most from the origin, regardless of the landmine configuration.




Solution
We claim the answer is .
Firstly, we prove that there is a configuration of landmines such that the rabbit cannot be closer than to the origin. Consider a square packing of circles, with centers for all and radii . If the rabbit begins on one of the tangency points, it can only move to other tangency points and thus will always be at least away from the origin.
Now we prove that can always be achieved. Firstly, we reduce the distance to . Denote the origin by and the rabbit's position by . Let and suppose that . Consider the circles and which intersect at two points, and .
Claim. No landmine can fully contain the red arc . Proof. If a landmine were to exist, consider the center of the landmine. Since it is closer to and than , it must be in the blue region bounded by the perpendicular bisectors of and . But since it is also closer to and than , it must be in the green region bounded by the perpendicular bisectors of and . Notice that the two regions are disjoint, meaning the center of the landmine cannot exist.
Hence, the rabbit can hop onto the arc. Notice that the maximum distance from the arc to is at . Hence the squared distance between the rabbit and decreases by at least every move and thus the rabbit can eventually achieve a distance of at most from .
Now, if the distance is still greater than , then . Thus we consider the circles and . Since , is acute, thus and lie on opposite sides of the line . Therefore, similar to before, the perpendicular bisectors form two disjoint regions, no landmine fully contains the red arc . Therefore, the rabbit can hop onto the red arc and will be of distance at most from .
Firstly, we prove that there is a configuration of landmines such that the rabbit cannot be closer than to the origin. Consider a square packing of circles, with centers for all and radii . If the rabbit begins on one of the tangency points, it can only move to other tangency points and thus will always be at least away from the origin.
Now we prove that can always be achieved. Firstly, we reduce the distance to . Denote the origin by and the rabbit's position by . Let and suppose that . Consider the circles and which intersect at two points, and .
Claim. No landmine can fully contain the red arc . Proof. If a landmine were to exist, consider the center of the landmine. Since it is closer to and than , it must be in the blue region bounded by the perpendicular bisectors of and . But since it is also closer to and than , it must be in the green region bounded by the perpendicular bisectors of and . Notice that the two regions are disjoint, meaning the center of the landmine cannot exist.
Hence, the rabbit can hop onto the arc. Notice that the maximum distance from the arc to is at . Hence the squared distance between the rabbit and decreases by at least every move and thus the rabbit can eventually achieve a distance of at most from .
Now, if the distance is still greater than , then . Thus we consider the circles and . Since , is acute, thus and lie on opposite sides of the line . Therefore, similar to before, the perpendicular bisectors form two disjoint regions, no landmine fully contains the red arc . Therefore, the rabbit can hop onto the red arc and will be of distance at most from .
Final answer
1/sqrt(2)
Techniques
TangentsDistance chasingOptimization in geometry