IMC 2023, Day 2, Problem 6
Ivan writes the matrix on the board. Then he performs the following operation on the matrix several times:
- he chooses a row or a column of the matrix, and
- he multiplies or divides the chosen row or column entry-wise by the other row or column, respectively.
Can Ivan end up with the matrix after finitely many steps?
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
(proposed by Alex Avdiushenko, Neapolis University Paphos, Cyprus)
Hint: Construct an invariant quantity that does not change during Ivan's prcedure.
Solution. We show that starting from , Ivan cannot reach the matrix .
Notice first that the allowed operations preserve the positivity of entries; all matrices Ivan can reach have only positive entries.
For every matrix with positive entries, let . By taking logarithms of the entries, the steps in Ivan game will be replaced by adding or subtracting a row or column to the other row. Such standard row and column operations preserve the determinant.
Hence, if the matrices in the game are , then we have , and it suffices to verify that .
Indeed,
Transcribed from the official solutions, pages 1–2. 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.