Let $A,B \in \mathcal{M}_n(\mathbb{C})$ be two matrices such that $A+B=AB+BA$. Prove that: a) if $n$ is odd, then $\det(AB-BA)=0$; b) if $\text{tr}(A)\neq \text{tr}(B)$, then $\det(AB-BA)=0$.

In triangle $ABC$, we have $\angle ABC=60$. The line through $B$ perpendicular to side $AB$ intersects angle bisector of $\angle BAC$ in $D$ and the line through $C$ perpendicular $BC$ intersects angle bisector of $\angle ABC$ in $E$. prove that $\angle BED\le 30$.

[list=a] [*]Give an example of matrices $A$ and $B$ from $\mathcal{M}_{2}(\mathbb{R})$, such that $ A^{2}+B^{2}=\left( \begin{array} [c]{cc} 2 & 3\\ 3 & 2 \end{array} \right) . $ [*]Let $A$ and $B$ be matrices from $\mathcal{M}_{2}(\mathbb{R})$, such that $\displaystyle A^{2}+B^{2}=\left( \begin{array} [c]{cc} 2 & 3\\ 3 & 2 \end{array} \right) $. Prove that $AB\neq BA$.[/list]

Determine all real numbers $a$ such that the two polynomials $x^2+ax+1$ and $x^2+x+a$ have at least one root in common.

[asy] real t=pi/12;real u=8*t; real cu=cos(u);real su=sin(u); draw(unitcircle); draw((cos(-t),sin(-t))--(cos(13*t),sin(13*t))); draw((cu,su)--(cu,-su)); label("A",(cos(13*t),sin(13*t)),W); label("B",(cos(-t),sin(-t)),E); label("C",(cu,su),N); label("D",(cu,-su),S); label("E",(cu,sin(-t)),NE); label("2",((cu-1)/2,sin(-t)),N); label("6",((cu+1)/2,sin(-t)),N); label("3",(cu,(sin(-t)-su)/2),E); //Credit to Zimbalono for the diagram[/asy] Chords $AB$ and $CD$ in the circle above intersect at $E$ and are perpendicular to each other. If segments $AE$, $EB$, and $ED$ have measures $2$, $3$, and $6$ respectively, then the length of the diameter of the circle is $\textbf{(A) }4\sqrt{5}\qquad\textbf{(B) }\sqrt{65}\qquad\textbf{(C) }2\sqrt{17}\qquad\textbf{(D) }3\sqrt{7}\qquad \textbf{(E) }6\sqrt{2}$

Let be a natural number $ n\ge 2 $ and the $ n\times n $ matrix whose entries at the $ \text{i-th} $ line and $ \text{j-th} $ column is $ \min (i,j) . $ Calculate: [b]a)[/b] its determinant. [b]b)[/b] its inverse.

Show that any real coefficient polynomial $f(x,y)$ is a linear combination of polynomials of the form $(x+ay)^k$. ($a$ is a real number and $k$ is a non-negative integer.)

suppose that $p$ is a prime number. find that smallest $n$ such that there exists a non-abelian group $G$ with $|G|=p^n$. SL is an acronym for Special Lesson. this year our special lesson was Groups and Symmetries. the exam time was 5 hours.

Let $1\leq a_1 < a_2 <... < a_{2n} \leq 4n-2$ be integers, such that their sum is even. Prove that for all sufficiently large n, there exist $\varepsilon_1 , ..., \varepsilon_{2n} = \pm1$ such that $$\sum\varepsilon_i = \sum\varepsilon_i a_i = 0$$

Let $\mathbb{M}$ be the vector space of $m \times p$ real matrices. For a vector subspace $S\subseteq \mathbb{M}$, denote by $\delta(S)$ the dimension of the vector space generated by all columns of all matrices in $S$. Say that a vector subspace $T\subseteq \mathbb{M}$ is a $\emph{covering matrix space}$ if \[ \bigcup_{A\in T, A\ne \mathbf{0}} \ker A =\mathbb{R}^p \] Such a $T$ is minimal if it doesn't contain a proper vector subspace $S\subset T$ such that $S$ is also a covering matrix space. [list] (a) (8 points) Let $T$ be a minimal covering matrix space and let $n=\dim (T)$ Prove that \[ \delta(T)\le \dbinom{n}{2} \] (b) (2 points) Prove that for every integer $n$ we can find $m$ and $p$, and a minimal covering matrix space $T$ as above such that $\dim T=n$ and $\delta(T)=\dbinom{n}{2}$[/list]

Consider all $ m \times n$ matrices whose all entries are $ 0$ or $ 1$. Find the number of such matrices for which the number of $ 1$-s in each row and in each column is even.

Given \( b > 0 \), consider the following matrix: \[ B = \begin{pmatrix} b & b^2 \\ b^2 & b^3 \end{pmatrix} \] Denote by \( e_i \) the top left entry of \( B^i \). Prove that the following limit exists and calculate its value: \[ \lim_{i \to \infty} \sqrt[i]{e_i}. \]

We call an $n\times n$ matrix [i]well groomed[/i] if it only contains elements $0$ and $1$, and it does not contain the submatrix $\begin{pmatrix} 1& 0\\ 0 & 1 \end{pmatrix}.$ Show that there exists a constant $c>0$ such that every well groomed, $n\times n$ matrix contains a submatrix of size at least $cn\times cn$ such that all of the elements of the submatrix are equal. (A well groomed matrix may contain the submatrix $\begin{pmatrix} 0& 1\\ 1 & 0 \end{pmatrix}.$ )

Set $T$ consists of $66$ points in plane, and $P$ consists of $16$ lines in plane. Pair $(A,l)$ is [i]good[/i] if $A \in T$, $l \in P$ and $A \in l$. Prove that maximum number of good pairs is no greater than $159$, and prove that there exits configuration with exactly $159$ good pairs.

Show that there exists a $2 \times 2$ matrix of order 6 with rational entries, such that the sum of its entries is 2018. Note: The order of a matrix (if it exists) is the smallest positive integer $n$ such that $A^n = I$, where $I$ is the identity matrix.

Let $n>k$ and let $A_1,\ldots,A_k$ be real $n\times n$ matrices of rank $n-1$. Prove that $$A_1\cdots A_k\ne0.$$

Let $a_{ij}$ $i=1,2,3$; $j=1,2,3$ be real numbers such that $a_{ij}$ is positive for $i=j$ and negative for $i\neq j$. Prove the existence of positive real numbers $c_{1}$, $c_{2}$, $c_{3}$ such that the numbers \[a_{11}c_{1}+a_{12}c_{2}+a_{13}c_{3},\qquad a_{21}c_{1}+a_{22}c_{2}+a_{23}c_{3},\qquad a_{31}c_{1}+a_{32}c_{2}+a_{33}c_{3}\] are either all negative, all positive, or all zero. [i]Proposed by Kiran Kedlaya, USA[/i]

For any square matrix $\mathcal{A}$ we define $\sin {\mathcal{A}}$ by the usual power series. \[ \sin {\mathcal{A}}=\sum_{n=0}^{\infty}\frac{(-1)^n}{(2n+1)!}\mathcal{A}^{2n+1} \] Prove or disprove : $\exists 2\times 2$ matrix $A\in \mathcal{M}_2(\mathbb{R})$ such that \[ \sin{A}=\left(\begin{array}{cc}1 & 1996 \\0 & 1 \end{array}\right) \]

A $m\times n$ matrix $(a_{ij})$ of real numbers satisfies $|a_{ij}| <1$ and $\sum_{i=1}^m a_{ij}= 0$ for all$ j$. Show that one can permute the entries in each column in such a way that the obtained matrix $(b_{ij})$ satisfies $\sum_{j=1}^n b_{ij} < 2$ for all $i$.

Let $n \in \mathbb{N},n \ge 2,$ and $A,B \in \mathcal{M}_n(\mathbb{R}).$ Prove that there exists a complex number $z,$ such that $|z|=1$ and $$\Re \left( {\det(A+zB)} \right) \ge \det(A)+\det(B),$$ where $\Re(w)$ is the real part of the complex number $w.$

Consider the set \[M = \left\{ \begin{pmatrix} a & b \\ c & d \end{pmatrix} \in\mathcal{M}_2(\mathbb{C})\ |\ ab = cd \right\}.\] a) Give an example of matrix $A\in M$ such that $A^{2017}\in M$ and $A^{2019}\in M$, but $A^{2018}\notin M$. b) Show that if $A\in M$ and there exists the integer number $k\ge 1$ such that $A^k \in M$, $A^{k + 1}\in M$ si $A^{k + 2} \in M$, then $A^n\in M$, for any integer number $n\ge 1$.

Let be the matrix $ A=\begin{pmatrix} 1& 2& -1\\ 2&2 &0\\1& 4& -3 \end{pmatrix} . $ [b]a)[/b] Show that the equation $ AX=\begin{pmatrix} 2\\ 1\\5 \end{pmatrix} $ has infinite solutions in $ \mathcal{M}_1^3\left( \mathbb{C} \right) . $ [b]b)[/b] Find the rank of the adugate of $ A. $

In a finite sequence of real numbers the sum of any seven successive terms is negative and the sum of any eleven successive terms is positive. Determine the maximum number of terms in the sequence.

Let $M_2(\mathbb{Z})$ be the set of $2 \times 2$ matrices with integer entries. Let $A \in M_2(\mathbb{Z})$ such that $$A^2+5I=0,$$ where $I \in M_2(\mathbb{Z})$ and $0 \in M_2(\mathbb{Z})$ denote the identity and null matrices, respectively. Prove that there exists an invertible matrix $C \in M_2(\mathbb{Z})$ with $C^{-1} \in M_2(\mathbb{Z})$ such that $$CAC^{-1} = \begin{pmatrix} 1 & 2\\ -3 & -1 \end{pmatrix} \text{ ou } CAC^{-1} = \begin{pmatrix} 0 & 1\\ -5 & 0 \end{pmatrix}.$$

Let $A,B,C$ be real square matrices of order $n$ such that $A^3=-I$, $BA^2+BA=C^6+C+I$ and $C$ is symmetric. Is it possible that $n=2005$?