ISL 2017 C5
A hunter and an invisible rabbit play a game in the Euclidean plane. The hunter's starting point coincides with the rabbit's starting point . In the round of the game ( ), the following happens. (1) First the invisible rabbit moves secretly and unobserved from its current point to some new point with . (2) The hunter has a tracking device (e.g. dog) that returns an approximate position of the rabbit, so that . (3) The hunter then visibly moves from point to a new point with . Is there a strategy for the hunter that guarantees that after such rounds the distance between the hunter and the rabbit is below 100 ? (Austria)
Dataset text NuminaMath olympiads. Quoted with source.
Official text: IMO 2017 Shortlist booklet, page 8.
Solutions
Official solution Solution 1 by the IMO Problem Selection Committee
The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).
Similar problems
These problems have the most words in common with this statement.