Problem B. 4686. (January 2015)
B. 4686. A flea is jumping on the points of the plane with integer coordinates. Is it possible for the flea to follow a route touching every lattice point exactly once, in which each jump has an integer length, and each integer jump length occurs exactly once?
Deadline expired on 10 February 2015.