where A× is the adjugate matrix of A, i.e., the matrix whose elements are aij=(−1)i+jdji, where dji is the determinant obtained from A, eliminating the line j and the column i.
Find the maximum number of matrices verifying (1) such that any two of them are not similar.
Original from the official PDF
This transcription was compared symbol by symbol with the original, but not yet by a person.
Time on this problem
Work for at least 45 minutes before opening the solution.
Official solution
Solution. It is known that
A⋅A×=detA⋅I2020,
hence, from the second relation we get detA=1, so A is invertible. Next, multiplying in the first relation by A, we get
A2−A+I2020=O2020.
It follows that the minimal polynomial of A divides
X2−X+1=(X−ω)(X−ωˉ),
where
ω=21+i23=cos3π+isin3π.
Because the factors of the minimal polynomial of A are of degree 1, it follows that A is diagonalizable, so A is similar to a matrix of the form
Two matrices that verify the given relations are not similar if and only if the numbers k1,k2 corresponding to those matrices are different, so the required maximum number of matrices is 673.
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.