MathDB
grasshopper jumping in [0,1]x[0,1]

Source: TOT 500 1996 Spring S A2 Tournament Of Towns

August 16, 2024
combinatoricscombinatorial geometry

Problem Statement

The square 0x10\le x\le 1, 0y10\le y\le 1 is drawn in the plane OxyOxy. A grasshopper sitting at a point MM with noninteger coordinates outside this square jumps to a new point which is symmetrical to MM with respect to the leftmost (from the grasshopper’s point of view) vertex of the square. Prove that no matter how many times the grasshopper jumps, it will never reach the distance more than 10d10 d from the center CC of the square, where dd is the distance between the initial position MM and the center CC.
(A Kanel)