Problem

Source: 2013 Cuba 1.1

Tags: combinatorics



Determine the smallest integer $n \ge 2012$ for which it is possible to have $16$ consecutive integers on a $4 \times 4$ board so that, if we select $4$ elements of which there are not two in the same row or in the same column, the sum of them is always equal to $n$. For the $n$ found, show how to fill the board.