olymmath

ISL 2017 C5

A hunter and an invisible rabbit play a game in the Euclidean plane. The hunter's starting point H0H_{0} coincides with the rabbit's starting point R0R_{0}. In the nth n^{\text {th }} round of the game ( n⩾1n \geqslant 1 ), the following happens. (1) First the invisible rabbit moves secretly and unobserved from its current point Rn−1R_{n-1} to some new point RnR_{n} with Rn−1Rn=1R_{n-1} R_{n}=1. (2) The hunter has a tracking device (e.g. dog) that returns an approximate position Rn′R_{n}^{\prime} of the rabbit, so that RnRn′⩽1R_{n} R_{n}^{\prime} \leqslant 1. (3) The hunter then visibly moves from point Hn−1H_{n-1} to a new point HnH_{n} with Hn−1Hn=1H_{n-1} H_{n}=1. Is there a strategy for the hunter that guarantees that after 10910^{9} 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.

Locator isl/2017/c5 · Tag SGGA7VJQ0D · Edit this page on GitHub · Keys: j next, k previous