The squares of an n×n chessboard are numbered in an arbitrary manner from 1 to n2 (every square has a different number). Show that there are two squares with a common side whose numbers differ by at least n.
Sign in to check your answer and unlock the solution.