olymmath

SEEMOUS 2020

South Eastern European Mathematical Olympiad for University Students 2020.

Other problems

Problem 1

Consider A∈M2020(C)A\in \mathcal{M}_{2020}(\mathbb{C}) such that (1){A+A×=I2020,A⋅A×=I2020,(1)\begin{cases} A+A^{\times} =I_{2020}, A\cdot A^{\times} =I_{2020}, \end{cases} where A×A^{\times} is the adjugate matrix of AA , i.e., the matrix whose elements are aij=(−1)i+jdjia_{ij}=(-1)^{i+j}d_{ji} , where djid_{ji} is the determinant obtained from AA , eliminating the line jj and the column ii . Find the maximum number of matrices verifying (1)(1) such that any two of them are not similar.

Problem 3

Let nn be a positive integer, k∈Ck\in \mathbb{C} and A∈Mn(C)A\in \mathcal{M}_n(\mathbb{C}) such that Tr A≠0\text{Tr } A\neq 0 and rank A+rank ((Tr A)⋅In−kA)=n.\text{rank } A +\text{rank } ((\text{Tr } A) \cdot I_n - kA) =n. Find rank A\text{rank } A .