KöMaL 2015 B4686
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?
Official text KöMaL. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.
Similar problems
These problems have the most words in common with this statement.