Let $ U$ be an $ n \times n$ orthogonal matrix. Prove that for any $ n \times n$ matrix $ A$, the matrices \[ A_m=\frac{1}{m+1} \sum_{j=0}^m U^{-j}AU^j\] converge entrywise as $ m \rightarrow \infty.$ [i]L. Kovacs[/i]

Let $ A\in M_2\left( \mathbb{R}\right) $ be a matrix having (strictly) positive numbers as its elements. Show that there is no natural number $ n $ such that $ A^n=I_2. $

Let $A$ be the $n\times n$ matrix whose entry in the $i$-th row and $j$-th column is \[\frac1{\min(i,j)}\] for $1\le i,j\le n.$ Compute $\det(A).$

Let $P_i (x_i, y_i)$ (with $i = 1, 2, 3, 4, 5$) be five points with integer coordinates, no three collinear. Show that among all triangles with vertices at these points, at least three have integer areas.

For which positive integers $n$ does there exist an $n \times n$ matrix $A$ whose entries are all in $\{0,1\}$, such that $A^2$ is the matrix of all ones?

At the vertices $A, B, C, D, E, F, G, H$ of a cube, $2001, 2002, 2003, 2004, 2005, 2008, 2007$ and $2006$ stones respectively are placed. It is allowed to move a stone from a vertex to each of its three neighbours, or to move a stone to a vertex from each of its three neighbours. Which of the following arrangements of stones at $A, B, \ldots , H$ can be obtained? $(\text{a})\quad 2001, 2002, 2003, 2004, 2006, 2007, 2008, 2005;$ $(\text{b})\quad 2002, 2003, 2004, 2001, 2006, 2005, 2008, 2007;$ $(\text{c})\quad 2004, 2002, 2003, 2001, 2005, 2008, 2007, 2006.$

Given A, non-inverted matrices of order n with real elements, $n\ge 2$ and given ${{A}^{*}}$adjoin matrix A. Prove that $tr({{A}^{*}})\ne -1$ if and only if the matrix ${{I}_{n}}+{{A}^{*}}$ is invertible.

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.

For matrices $A=[a_{ij}]_{m \times m}$ and $B=[b_{ij}]_{m \times m}$ where $A,B \in \mathbb{Z} ^{m \times m}$ let $A \equiv B \pmod{n}$ only if $a_{ij} \equiv b_{ij} \pmod{n}$ for every $i,j \in \{ 1,2,...,m \}$, that's $A-B=nZ$ for some $Z \in \mathbb{Z}^{m \times m}$. (The symbol $A \in \mathbb{Z} ^{m \times m}$ means that every element in $A$ is an integer.) Prove that for $A \in \mathbb{Z} ^{m \times m}$ there is $B \in \mathbb{Z} ^{m \times m}$ , where $AB \equiv I \pmod{n }$ only if $(\det (A),n)=1$ and find the value of $B$ in the form of $A$ where $I$ represents the dimensional identity matrix $m \times m$. [i](PP-nine)[/i]

Let $ABC$ be a triangle and $P$ an exterior point in the plane of the triangle. Suppose the lines $AP$, $BP$, $CP$ meet the sides $BC$, $CA$, $AB$ (or extensions thereof) in $D$, $E$, $F$, respectively. Suppose further that the areas of triangles $PBD$, $PCE$, $PAF$ are all equal. Prove that each of these areas is equal to the area of triangle $ABC$ itself.

Let $n$ be a positive integer, and let $M_n$ be the set of invertible matrices with integer entries and size $n \times n$. (a) Find the largest possible value of $n$ such that there exists a symmetric matrix $A \in M_n$ satisfying \[ \det(A^{20} + A^{24}) < 2024. \] (b) Prove that for every $n$, there exists a matrix $B \in M_n$ such that \[ \det(B^{20} + B^{24}) < 2024. \]

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$.

Let \( A \) and \( B \) be two square matrices with complex entries such that \( A + B = AB \), \( A = A^* \), and \( A \) has all distinct eigenvalues. Prove that there exists a polynomial \( P \) with complex coefficients such that \( P(A) = B \).

$p=3k+1$ is a prime number. For each $m \in \mathbb Z_p$, define function $L$ as follow: $L(m) = \sum_{x \in \mathbb{Z}_p}^{ } \left ( \frac{x(x^3 + m)}{p} \right )$ [i]a)[/i] For every $m \in \mathbb Z_p$ and $t \in {\mathbb Z_p}^{*}$ prove that $L(m) = L(mt^3)$. (5 points) [i]b)[/i] Prove that there is a partition of ${\mathbb Z_p}^{*} = A \cup B \cup C$ such that $|A| = |B| = |C| = \frac{p-1}{3}$ and $L$ on each set is constant. Equivalently there are $a,b,c$ for which $L(x) = \left\{\begin{matrix} a & & &x \in A \\ b& & &x \in B \\ c& & & x \in C \end{matrix}\right.$ . (7 points) [i]c)[/i] Prove that $a+b+c = -3$. (4 points) [i]d)[/i] Prove that $a^2 + b^2 + c^2 = 6p+3$. (12 points) [i]e)[/i] Let $X= \frac{2a+b+3}{3},Y= \frac{b-a}{3}$, show that $X,Y \in \mathbb Z$ and also show that :$p= X^2 + XY +Y^2$. (2 points) (${\mathbb Z_p}^{*} = \mathbb Z_p \setminus \{0\}$)

Let $n$ be a positive integer. Given a sequence $\varepsilon_1$, $\dots$, $\varepsilon_{n - 1}$ with $\varepsilon_i = 0$ or $\varepsilon_i = 1$ for each $i = 1$, $\dots$, $n - 1$, the sequences $a_0$, $\dots$, $a_n$ and $b_0$, $\dots$, $b_n$ are constructed by the following rules: \[a_0 = b_0 = 1, \quad a_1 = b_1 = 7,\] \[\begin{array}{lll} a_{i+1} = \begin{cases} 2a_{i-1} + 3a_i, \\ 3a_{i-1} + a_i, \end{cases} & \begin{array}{l} \text{if } \varepsilon_i = 0, \\ \text{if } \varepsilon_i = 1, \end{array} & \text{for each } i = 1, \dots, n - 1, \\[15pt] b_{i+1}= \begin{cases} 2b_{i-1} + 3b_i, \\ 3b_{i-1} + b_i, \end{cases} & \begin{array}{l} \text{if } \varepsilon_{n-i} = 0, \\ \text{if } \varepsilon_{n-i} = 1, \end{array} & \text{for each } i = 1, \dots, n - 1. \end{array}\] Prove that $a_n = b_n$. [i]Proposed by Ilya Bogdanov, Russia[/i]

Let be a $ 2\times 2 $ real matrix $ A $ whose primary diagonal has positive elements and whose secondary diagonal has negative elements. If $ \det A>0, $ show that [b]a)[/b] for any $ 2\times 2 $ matrix $ X $ of positive real numbers there exists a $ 2\times 2 $ matrix of positive real numbers such that $ AY=X. $ [b]b)[/b] there is a $ 2\times 2 $ matrix $ Z $ of positive real numbers having the property that all elements of $ AZ $ are positive. [i]Vasile Pop[/i]

Let $n$ be a positive integer. Find the smallest positive integer $k$ with the property that for any colouring nof the squares of a $2n$ by $k$ chessboard with $n$ colours, there are $2$ columns and $2$ rows such that the $4$ squares in their intersections have the same colour.

Let $A,B\in \mathcal{M}_n(\mathbb{C})$ such that $AB=BA$ and $\det B\neq 0$. a) If $|\det(A+zB)|=1$ for any $z\in \mathbb{C}$ such that $|z|=1$, then $A^n=O_n$. b) Is the question from a) still true if $AB\neq BA$ ?

Start with a finite sequence $ a_1,a_2,\dots,a_n$ of positive integers. If possible, choose two indices $ j < k$ such that $ a_j$ does not divide $ a_k$ and replace $ a_j$ and $ a_k$ by $ \gcd(a_j,a_k)$ and $ \text{lcm}\,(a_j,a_k),$ respectively. Prove that if this process is repeated, it must eventually stop and the final sequence does not depend on the choices made. (Note: $ \gcd$ means greatest common divisor and lcm means least common multiple.)

Let be four $ n\times n $ real matrices $ A,B,C,D $ having the property that $ C+D\sqrt{-1} $ is the inverse of $ A+B\sqrt{-1} . $ Show that $ \left| \det\left( A+B\sqrt{-1} \right) \right|^2\cdot\left| \det C \right| =\det A. $ [i]Vasile Pop[/i]

Let $1,2,3,\dots,2005,2006,2007,2009,2012,2016,\dots$ be a sequence defined by $x_{k}=k$ for $k=1,2\dots,2006$ and $x_{k+1}=x_{k}+x_{k-2005}$ for $k\ge 2006.$ Show that the sequence has 2005 consecutive terms each divisible by 2006.

Calculate the determinant of the $ n\times n $ complex matrix $ \left(a_j^i\right)_{1\le j\le n}^{1\le i\le n} $ defined by $$ a_j^i=\left\{\begin{matrix} 1+x^2,\quad i=j\\x,\quad |i-j|=1\\0,\quad |i-j|\ge 2\end{matrix}\right. , $$ where $ n $ is a natural number greater than $ 2. $

[b]Problem 1. [/b]In the cells of square table are written the numbers $1$, $0$ or $-1$ so that in every line there is exactly one $1$, amd exactly one $-1$. Each turn we change the places of two columns or two rows. Is it possible, from any such table, after finite number of turns to obtain its opposite table (two tables are opposite if the sum of the numbers written in any two corresponding squares is zero)? [i] Emil Kolev[/i]

$33$ horsemen are riding in the same direction along a circular road. Their speeds are constant and pairwise distinct. There is a single point on the road where the horsemen can surpass one another. Can they ride in this fashion for arbitrarily long time ?

Denote by $ H_n$ the linear space of $ n\times n$ self-adjoint complex matrices, and by $ P_n$ the cone of positive-semidefinite matrices in this space. Let us consider the usual inner product on $ H_n$ \[ \langle A,B\rangle \equal{} {\rm tr} AB\qquad (A,B\in H_n)\] and its derived metric. Show that every $ \phi: P_n\to P_n$ isometry (that is a not necessarily surjective, distance preserving map with respect to the above metric) can be expressed as \[ \phi(A) \equal{} UAU^* \plus{} X\qquad (A\in H_n)\] or \[ \phi(A) \equal{} UA^TU^* \plus{} X\qquad (A\in H_n)\] where $ U$ is an $ n\times n$ unitary matrix, $ X$ is a positive-semidefinite matrix, and $ ^T$ and $ ^*$ denote taking the transpose and the adjoint, respectively.