IMC 2007, Day 1, Problem 2
Let be an integer. What is the minimal and maximal possible rank of an matrix whose entries are precisely the numbers ?
Original from the official PDF

This transcription was compared symbol by symbol with the original, but not yet by a person.
Work for at least 45 minutes before opening the solution.
Official solution
Solution. The minimal rank is 2 and the maximal rank is . To prove this, we have to show that the rank can be 2 and but it cannot be 1.
(i) The rank is at least 2. Consider an arbitrary matrix with entries in some order. Since permuting rows or columns of a matrix does not change its rank, we can assume that and . Hence and and at least one of these inequalities is strict. Then so .
(ii) The rank can be 2. Let
(iii) The rank can be , i.e. the matrix can be nonsingular. Put odd numbers into the diagonal, only even numbers above the diagonal and arrange the entries under the diagonal arbitrarily. Then the determinant of the matrix is odd, so the rank is complete.
Transcribed from the official solutions, page 1. This transcription has not been checked a second time; if in doubt, look at the original.
Archive problem: the statement is the official text (transcribed, with the original above). Subject classification and difficulty were estimated automatically; hints and a worked solution are added over time.
How did it go?
Moves you mark come back sooner in triage.