IMC / 2023 / Problems / Day 2, P6
IMC 2023 · Day 2 · P6
mediumIvan 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.
(proposed by Alex Avdiushenko, Neapolis University Paphos, Cyprus)
Solution (official)
Hint: Construct an invariant quantity that does not change during Ivan's prcedure.
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,
= \log_2 (4/3) > 0 and similarly , so .
How the field did
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.