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 , is drawn in the plane . A grasshopper sitting at a point with noninteger coordinates outside this square jumps to a new point which is symmetrical to 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 from the center of the square, where is the distance between the initial position and the center . (A Kanel)