Let $\mathcal M$ be the set of $n\times n$ matrices with integer entries. Find all $A\in\mathcal M$ such that $\det(A+B)+\det(B)$ is even for all $B\in\mathcal M$. [i]Proposed by Ethan Tan[/i]

Solve with full solution: \[\left\{\begin{matrix}\sqrt{(\sin x)^2+\frac{1}{(\sin x)^2}}+\sqrt{(\cos y)^2+\frac{1}{(\cos y)^2}}=\sqrt\frac{20y}{x+y} \\\sqrt{(\sin y)^2+\frac{1}{(\sin y)^2}}+\sqrt{(\cos x)^2+\frac{1}{(\cos x)^2}}=\sqrt\frac{20x}{x+y}\end{matrix}\right. \]

A real symmetric $2018\times 2018$ matrix $A=(a_{ij})$ satisfies $|a_{ij}-2018|\leq 1$ for every $1\leq i,j\leq 2018$. Denote the largest eigenvalue of $A$ by $\lambda(A)$. Find maximum and minumum value of $\lambda(A)$.

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 be two $ 2\times 2 $ real matrices $A,B$ having the property that all their natural powers are not real multiples of the identity. Prove that if some natural power of $ A $ is equal to some natural power of $ B, $ then, $ A,B $ commute. Is the converse statement true? [i]Cosmin Nitu[/i]

In a tournament, 2011 players meet 2011 times to play a multiplayer game. Every game is played by all 2011 players together and ends with each of the players either winning or losing. The standings are kept in two $2011\times 2011$ matrices, $T=(T_{hk})$ and $W=(W_{hk}).$ Initially, $T=W=0.$ After every game, for every $(h,k)$ (including for $h=k),$ if players $h$ and $k$ tied (that is, both won or both lost), the entry $T_{hk}$ is increased by $1,$ while if player $h$ won and player $k$ lost, the entry $W_{hk}$ is increased by $1$ and $W_{kh}$ is decreased by $1.$ Prove that at the end of the tournament, $\det(T+iW)$ is a non-negative integer divisible by $2^{2010}.$

Let $a, b, c > 0$. Prove that $(a^5 - a^2 + 3)(b^5 - b^2 + 3)(c^5 - c^2 + 3) \geq (a + b + c)^3$.

Let $A$ be a $n\times n$ matrix with complex elements and let $A^\star$ be the classical adjoint of $A$. Prove that if there exists a positive integer $m$ such that $(A^\star)^m = 0_n$ then $(A^\star)^2 = 0_n$. [i]Marian Ionescu, Pitesti[/i]

Suppose from $(m+2)\times(n+2)$ rectangle we cut $4$, $1\times1$ corners. Now on first and last row first and last columns we write $2(m+n)$ real numbers. Prove we can fill the interior $m\times n$ rectangle with real numbers that every number is average of it's $4$ neighbors.

Let $M$ be a matrix with $r$ rows and $c$ columns. Each entry of $M$ is a nonnegative integer. Let $a$ be the average of all $rc$ entries of $M$. If $r > {(10 a + 10)}^c$, prove that $M$ has two identical rows.

Twenty-one rectangles of size $3\times 1$ are placed on an $8\times 8$ chessboard, leaving only one free unit square. What position can the free square lie at?

The absolute value of the sum of the elements of a real orthogonal matrix is at most the order of the matrix.

We consider the nonzero matrices $A_0, A_1, \ldots, A_n \in \mathcal{M}_2(\mathbb{R}),$ $n \ge 2,$ with the properties: $A_0 \neq aI_2$ for any $a \in \mathbb{R}$ and $A_0A_k=A_kA_0$ for $k= \overline{1,n}.$ Prove that a) $\det \left(\sum\limits_{k=1}^n A_k^2 \right) \ge 0$; b) If $\det \left(\sum\limits_{k=1}^n A_k^2 \right) = 0$ and $A_2 \ne aA_1$ for any $a \in \mathbb{R},$ then $\sum\limits_{k=1}^n A_k^2=O_2.$

Consider a finite set of vectors in space $\{a_1, a_2, ... , a_n\}$ and the set $E$ of all vectors of the form $x=\sum_{i=1}^{n}{\lambda _i a_i}$, where $\lambda _i \in \mathbb{R}^{+}\cup \{0\}$. Let $F$ be the set consisting of all the vectors in $E$ and vectors parallel to a given plane $P$. Prove that there exists a set of vectors $\{b_1, b_2, ... , b_p\}$ such that $F$ is the set of all vectors $y$ of the form $y=\sum_{i=1}^{p}{\mu _i b_i}$, where $\mu _i \in \mathbb{R}^{+}\cup \{0\}$.

For an $n\times n$ matrix with real entries let $||M||=\sup_{x\in \mathbb{R}^{n}\setminus\{0\}}\frac{||Mx||_{2}}{||x||_{2}}$, where $||\cdot||_{2}$ denotes the Euclidean norm on $\mathbb{R}^{n}$. Assume that an $n\times n$ matrxi $A$ with real entries satisfies $||A^{k}-A^{k-1}||\leq\frac{1}{2002k}$ for all positive integers $k$. Prove that $||A^{k}||\leq 2002$ for all positive integers $k$.

Let $n,k$ be positive integers such that $n\ge k$. $n$ lamps are placed on a circle, which are all off. In any step we can change the state of $k$ consecutive lamps. In the following three cases, how many states of lamps are there in all $2^n$ possible states that can be obtained from the initial state by a certain series of operations? i)$k$ is a prime number greater than $2$; ii) $k$ is odd; iii) $k$ is even.

Given $5n$ real numbers $r_i, s_i, t_i, u_i, v_i \geq 1 (1 \leq i \leq n)$, let $R = \frac {1}{n} \sum_{i=1}^{n} r_i$, $S = \frac {1}{n} \sum_{i=1}^{n} s_i$, $T = \frac {1}{n} \sum_{i=1}^{n} t_i$, $U = \frac {1}{n} \sum_{i=1}^{n} u_i$, $V = \frac {1}{n} \sum_{i=1}^{n} v_i$. Prove that $\prod_{i=1}^{n}\frac {r_i s_i t_i u_i v_i + 1}{r_i s_i t_i u_i v_i - 1} \geq \left(\frac {RSTUV +1}{RSTUV - 1}\right)^n$.

Solve in $(\mathbb{R}_{+}^{*})^{4}$ the following system : $\left\{\begin{matrix} x+y+z+t=4\\ \frac{1}{x}+\frac{1}{y}+\frac{1}{z}+\frac{1}{t}=5-\frac{1}{xyzt} \end{matrix}\right.$

A Sudoku matrix is defined as a $ 9\times9$ array with entries from $ \{1, 2, \ldots , 9\}$ and with the constraint that each row, each column, and each of the nine $ 3 \times 3$ boxes that tile the array contains each digit from $ 1$ to $ 9$ exactly once. A Sudoku matrix is chosen at random (so that every Sudoku matrix has equal probability of being chosen). We know two of the squares in this matrix, as shown. What is the probability that the square marked by ? contains the digit $ 3$? $ \setlength{\unitlength}{6mm} \begin{picture}(9,9)(0,0) \multiput(0,0)(1,0){10}{\line(0,1){9}} \multiput(0,0)(0,1){10}{\line(1,0){9}} \linethickness{1.2pt} \multiput(0,0)(3,0){4}{\line(0,1){9}} \multiput(0,0)(0,3){4}{\line(1,0){9}} \put(0,8){\makebox(1,1){1}} \put(1,7){\makebox(1,1){2}} \put(3,6){\makebox(1,1){?}} \end{picture}$

Differentiable functions $f_1,\ldots,f_n:\mathbb R\to\mathbb R$ are linearly independent. Prove that there exist at least $n-1$ linearly independent functions among $f_1',\ldots,f_n'$.

6. If $ p,q$ are rationals, $r=p+\sqrt{7}q$, then prove there exists a matrix $\left(\begin{array}{cc}a&b\\c&d\end{array}\right) \in M_{2}(Z)- ( \pm I_{2})$ for which $\frac{ar+b}{cr+d}=r$ and $det(A)=1$

Solve the following system of equations, in which $a$ is a given number satisfying $|a| > 1$: $\begin{matrix} x_{1}^2 = ax_2 + 1 \\ x_{2}^2 = ax_3 + 1 \\ \ldots \\ x_{999}^2 = ax_{1000} + 1 \\ x_{1000}^2 = ax_1 + 1 \\ \end{matrix}$

Let $S = \{x_0, x_1,\dots , x_n\}$ be a finite set of numbers in the interval $[0, 1]$ with $x_0 = 0$ and $x_1 = 1$. We consider pairwise distances between numbers in $S$. If every distance that appears, except the distance $1$, occurs at least twice, prove that all the $x_i$ are rational.

Let $G$ be an abelian group with $n$ elements, and let \[\{g_1=e,g_2,\dots,g_k\}\subsetneq G\] be a (not necessarily minimal) set of distinct generators of $G.$ A special die, which randomly selects one of the elements $g_1,g_2,\dots,g_k$ with equal probability, is rolled $m$ times and the selected elements are multiplied to produce an element $g\in G.$ Prove that there exists a real number $b\in(0,1)$ such that \[\lim_{m\to\infty}\frac1{b^{2m}}\sum_{x\in G}\left(\mathrm{Prob}(g=x)-\frac1n\right)^2\] is positive and finite.

Let $A\in\mathbb{R}^{n\times n}$ such that $3A^3=A^2+A+I$. Show that the sequence $A^k$ converges to an idempotent matrix. (idempotent: $B^2=B$)