Let be a $ 2\times 2 $ real matrix such that $ \det \left( A^6+64I \right) =0. $ Show that $ \det A=4. $ [i]Viorel Botea[/i]

Let real numbers $ a,b,c$. Prove that $ \sqrt{2(a^2\plus{}b^2)}\plus{}\sqrt{2(b^2\plus{}c^2)}\plus{}\sqrt{2(c^2\plus{}a^2)}\ge \sqrt{3(a\plus{}b)^2\plus{}3(b\plus{}c)^2\plus{}3(c\plus{}a)^2}$.

Twenty-one girls and twenty-one boys took part in a mathematical competition. It turned out that each contestant solved at most six problems, and for each pair of a girl and a boy, there was at least one problem that was solved by both the girl and the boy. Show that there is a problem that was solved by at least three girls and at least three boys.

Calculate the sum of matrix commutators $[A, [B, C]] + [B, [C, A]] + [C, [A, B]]$, where $[A, B] = AB-BA$

The scores of this problem were: one time 17/20 (by the runner-up) one time 4/20 (by Andrei Negut) one time 1/20 (by the winner) the rest had zero... just to give an idea of the difficulty. Let $A_{i},B_{i},S_{i}$ ($i=1,2,3$) be invertible real $2\times 2$ matrices such that [list][*]not all $A_{i}$ have a common real eigenvector, [*]$A_{i}=S_{i}^{-1}B_{i}S_{i}$ for $i=1,2,3$, [*]$A_{1}A_{2}A_{3}=B_{1}B_{2}B_{3}=I$.[/list] Prove that there is an invertible $2\times 2$ matrix $S$ such that $A_{i}=S^{-1}B_{i}S$ for all $i=1,2,3$.

$n\geq 2$ is a given integer. For two permuations $(\alpha_1,\cdots,\alpha_n)$ and $(\beta_1,\cdots,\beta_n)$ of $1,\cdots,n$, consider $n\times n$ matrix $A= \left(a_{ij} \right)_{1\leq i,j\leq n}$ defined by $a_{ij} = (1+\alpha_i \beta_j )^{n-1}$. Find every possible value of $\det(A)$.

a)Prove that any matrix $A\in \mathcal{M}_4(\mathbb{C})$ can be written as a sum of four matrices $B_1,B_2,B_3,B_4\in \mathcal{M}_4(\mathbb{C})$ with the rank equal to $1$. b)$I_4$ can't be written as a sum of less than four matrices with the rank equal to $1$. [i]Manuela Prajea & Ion Savu[/i]

Let $A,B\in \mathcal{M}_n(\mathbb{R})$. Prove that $\text{rank}\ A+\text{rank}\ B\le n$ if and only if there exists an invertible matrix $X\in \mathcal{M}_n(\mathbb{R})$ such that $AXB=O_n$.

In a certain city, age is reckoned in terms of real numbers rather than integers. Every two citizens $x$ and $x'$ either know each other or do not know each other. Moreover, if they do not, then there exists a chain of citizens $x = x_0, x_1, \ldots, x_n = x'$ for some integer $n \geq 2$ such that $ x_{i-1}$ and $x_i$ know each other. In a census, all male citizens declare their ages, and there is at least one male citizen. Each female citizen provides only the information that her age is the average of the ages of all the citizens she knows. Prove that this is enough to determine uniquely the ages of all the female citizens.

Let $M_n$ be the $n\times n$ matrix with entries as follows: for $1\leq i \leq n$, $m_{i,i}=10$; for $1\leq i \leq n-1, m_{i+1,i}=m_{i,i+1}=3$; all other entries in $M_n$ are zero. Let $D_n$ be the determinant of matrix $M_n$. Then $\displaystyle \sum_{n=1}^{\infty} \dfrac{1}{8D_n+1}$ can be represented as $\frac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$. Note: The determinant of the $1\times 1$ matrix $[a]$ is $a$, and the determinant of the $2\times 2$ matrix $\left[ \begin{array}{cc} a & b \\ c & d \end{array} \right]=ad-bc$; for $n\geq 2$, the determinant of an $n\times n$ matrix with first row or first column $a_1\ a_2\ a_3 \dots\ a_n$ is equal to $a_1C_1 - a_2C_2 + a_3C_3 - \dots + (-1)^{n+1} a_nC_n$, where $C_i$ is the determinant of the $(n-1)\times (n-1)$ matrix found by eliminating the row and column containing $a_i$.

Let be a natural number $ n. $ Solve in the set of $ 2\times 2 $ complex matrices the equation $$ \begin{pmatrix} -2& 2007\\ 0&-2 \end{pmatrix} =X^{3n}-3X^n. $$ [i]Petru Vlad[/i]

Prove that if $A{}$ is an $n\times n$ matrix with complex entries such that $A+A^*=A^2A^*$ then $A=A^*$. (Here, we denote by $M^*$ the conjugate transpose $\overline{M}^t$ of the matrix $M{}$).

Let $H$ be an $n\times n$ matrix all of whose entries are $\pm1$ and whose rows are mutually orthogonal. Suppose $H$ has an $a\times b$ submatrix whose entries are all $1.$ Show that $ab\le n.$

Suppose that $A$ and $B$ are $n\times n$ matrices with integer entries, and $\det B\ne0$. Prove that there exists $m\in\mathbb N$ such that the product $AB^{-1}$ can be represented as $$AB^{-1}=\sum_{k=1}^mN_k^{-1},$$where $N_k$ are $n\times n$ matrices with integer entries for all $k=1,\ldots,m$, and $N_i\ne N_j$ for $i\ne j$.

Do either (1) or (2): (1) Prove that the determinant of the matrix $$\begin{pmatrix} 1+a^2 -b^2 -c^2 & 2(ab+c) & 2(ac-b)\\ 2(ab-c) & 1-a^2 +b^2 -c^2 & 2(bc+a)\\ 2(ac+b)& 2(bc-a) & 1-a^2 -b^2 +c^2 \end{pmatrix}$$ is given by $(1+a^2 +b^2 +c^2)^{3}$. (2) A solid is formed by rotating the first quadrant of the ellipse $\frac{x^{2}}{a^{2}}+\frac{y^{2}}{b^{2}}=1$ around the $x$-axis. Prove that this solid can rest in stable equilibrium on its vertex if and only if $\frac{a}{b}\leq \sqrt{\frac{8}{5}}$.

Let $A,B\in\mathbb{C}^{n\times n}$ with $\rho(AB - BA) = 1$. Show that $(AB - BA)^2 = 0$.

Let us consider a matrix $T$ with n rows denoted $1,\ldots,n$ and $p$ columns $1,\ldots,p$. Its entries $a_{ik}~(1\le i\le n,1\le k\le p)$ are integers such that $1\le a_{ik}\le N$, where $N$ is a given natural number. Let $E_i$ be the set of numbers that appear on the $i$-th row. Answer question (a) or (b). (a) Assume $T$ satisfies the following conditions: $(1)$ $E_i$ has exactly $p$ elements for each $i$, and $(2)$ all $E_i$'s are mutually distinct. Let $m$ be the smallest value of $N$ that permits a construction of such an $n\times p$ table $T$. i. Compute $m$ if $n=p+1$. ii. Compute $m$ if $n=10^{30}$ and $p=1998$. iii. Determine $\lim_{n\to\infty}\frac{m^p}n$, where $p$ is fixed. (b) Assume $T$ satisfies the following conditions instead: $(1)$ $p=n$, $(2)$ whenever $i,k$ are integers with $i+k\le n$, the number $a_{ik}$ is not in the set $E_{i+k}$. i. Prove that all $E_i$'s are mutually distinct. ii. Prove that if $n\ge2^q$ for some integer $q>0$, then $N\ge q+1$. iii. Let $n=2^r-1$ for some integer $r>0$. Prove that $N\ge r$ and show that there is such a table with $N=r$.

Let $n$ be an odd integer greater than $1.$ Let $A$ be an $n\times n$ symmetric matrix such that each row and column consists of some permutation of the integers $1,2, \ldots, n.$ Show that each of the integers $1,2, \ldots, n$ must appear in the main diagonal of $A$.

A triangle is bounded by the lines $a_1 x+ b_1 y +c_1=0$, $a_2 x+ b_2 y +c_2=0$ and $a_2 x+ b_2 y +c_2=0$. Show that its area, disregarding sign, is $$\frac{\Delta^{2}}{2(a_2 b_3- a_3 b_2)(a_3 b_1- a_1 b_3)(a_1 b_2- a_2 b_1)},$$ where $\Delta$ is the discriminant of the matrix $$M=\begin{pmatrix} a_1 & b_1 &c_1\\ a_2 & b_2 &c_2\\ a_3 & b_3 &c_3 \end{pmatrix}.$$

[color=darkred]A row of a matrix belonging to $\mathcal{M}_n(\mathbb{C})$ is said to be [i]permutable[/i] if no matter how we would permute the entries of that row, the value of the determinant doesn't change. Prove that if a matrix has two [i]permutable[/i] rows, then its determinant is equal to $0$ .[/color]

Consider the matrix $X\in\mathcal{M}_2(\mathbb{C})$ which satisfies $X^{2022}=X^{2023}.$ Prove that $X^2=X^3.$

For an invertible $n\times n$ matrix $M$ with integer entries we define a sequence $\mathcal{S}_M=\{M_i\}_{i=0}^{\infty}$ by the recurrence $M_0=M$ ,$M_{i+1}=(M_i^T)^{-1}M_i$ for $i\geq 0$. Find the smallest integer $n\geq 2 $ for wich there exists a normal $n\times n$ matrix with integer entries such that its sequence $\mathcal{S}_M$ is not constant and has period $P=7$ i.e $M_{i+7}=M_i$. ($M^T$ means the transpose of a matrix $M$ . A square matrix is called normal if $M^T M=M M^T$ holds). [i]Proposed by Martin Niepel (Comenius University, Bratislava)..[/i]

Which of the following are true? $\textbf{(A)}~\exists A\in M_3(\mathbb R)\text{ such that }A^2=-I_3$ $\textbf{(B)}~\exists A,B\in M_3(\mathbb R)\text{ such that }AB-BA=I_3$ $\textbf{(C)}~\forall A\in M_4,\det\left(I_4+A^2\right)\ge0$ $\textbf{(D)}~\text{None of the above}$

Solve in the set of $ 2\times 2 $ integer matrices the equation $$ X^2-4\cdot X+4\cdot\left(\begin{matrix}1\quad 0\\0\quad 1\end{matrix}\right) =\left(\begin{matrix}7\quad 8\\12\quad 31\end{matrix}\right) . $$

Let be the sequence of sets $ \left(\left\{ A\in\mathcal{M}_2\left(\mathbb{R} \right) | A^{n+1} =2007^nA\right\}\right)_{n\ge 1} . $ [b]a)[/b] Prove that each term of the above sequence hasn't a finite cardinal. [b]b)[/b] Determine the intersection of the fourth element of the above sequence with the $ 2007\text{th} $ element. [i]Gheorghe Iurea[/i] [hide=Note]Similar with [url]https://artofproblemsolving.com/community/c7h1928039p13233629[/url].[/hide]