Math in chessboard

There is a \(16\times16\) chessboard. Put the numbers 1 to \(16^2\) arbitrarily in those squares. Then there must exist 2 adjacent squares (sharing a common vertex or side) the difference of the numbers put in those 2 squares is at least \(n\). Find \(n\).

×

Problem Loading...

Note Loading...

Set Loading...