Difference between revisions of "2017 IMO Problems/Problem 3"
Sleepypuppy (talk | contribs) (→Solution) |
|||
| Line 9: | Line 9: | ||
Is it always possible, no matter how the rabbit moves, and no matter what points are reported by the tracking device, for the hunter to choose her moves so that after <math>10^9</math> rounds she can ensure that the distance between her and the rabbit is at most 100? | Is it always possible, no matter how the rabbit moves, and no matter what points are reported by the tracking device, for the hunter to choose her moves so that after <math>10^9</math> rounds she can ensure that the distance between her and the rabbit is at most 100? | ||
| + | |||
| + | ==Solution== | ||
| + | {{solution}} | ||
| + | |||
| + | ==See Also== | ||
| + | |||
| + | {{IMO box|year=2017|num-b=2|num-a=4}} | ||
Revision as of 00:40, 19 November 2023
Problem
A hunter and an invisible rabbit play a game in the Euclidean plane. The rabbit's starting point, 
, and the hunter's starting point, 
, are the same. After 
rounds of the game, the rabbit is at point 
and the hunter is at point 
. In the nth round of the game, three things occur in order.
(i) The rabbit moves invisibly to a point 
such that the distance between and is exactly 1.
(ii) A tracking device reports a point 
to the hunter. The only guarantee provided by the tracking device is that the distance between and is at most 1.
(iii) The hunter moves visibly to a point 
such that the distance between and is exactly 1.
Is it always possible, no matter how the rabbit moves, and no matter what points are reported by the tracking device, for the hunter to choose her moves so that after 
rounds she can ensure that the distance between her and the rabbit is at most 100?
Solution
This problem needs a solution. If you have a solution for it, please help us out by adding it.
See Also
| 2017 IMO (Problems) • Resources | ||
| Preceded by Problem 2 |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 4 |
| All IMO Problems and Solutions | ||
