The sequence $a_0$, $a_1$, $a_2$, $\ldots\,$ satisfies the recurrence equation \[ a_n = 2 a_{n-1} - 2 a_{n - 2} + a_{n - 3} \] for every integer $n \ge 3$. If $a_{20} = 1$, $a_{25} = 10$, and $a_{30} = 100$, what is the value of $a_{1331}$?

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 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. \]

What is the biggest shadow that a cube of side length $1$ can have, with the sun at its peak? Note: "The biggest shadow of a figure with the sun at its peak" is understood to be the biggest possible area of the orthogonal projection of the figure on a plane.

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

Consider a matrix whose entries are integers. Adding a same integer to all entries on a same row, or on a same column, is called an operation. It is given that, for infinitely many positive integers $n$, one can obtain, through a finite number of operations, a matrix having all entries divisible by $n$. Prove that, through a finite number of operations, one can obtain the null matrix.

Let $A$ be a square matrix of odd order (at least $3$) whose entries are odd integers. Prove that if $A$ is invertible, then it is not possible for all the minors of the entries of a row to have equal absolute values.

[b]a)[/b] Prove that for any natural number $ n\ge 1, $ there is a set $ \mathcal{M} $ of $ n $ points from the Cartesian plane such that the barycenter of every subset of $ \mathcal{M} $ has integral coordinates (both coordinates are integer numbers). [b]b)[/b] Show that if a set $ \mathcal{N} $ formed by an infinite number of points from the Cartesian plane is given such that no three of them are collinear, then there exists a finite subset of $ \mathcal{N} , $ the barycenter of which has non-integral coordinates.

Let $G= \{ A \in \mathcal M_2 \left( \mathbb C \right) \mid |\det A| = 1 \}$ and $H =\{A \in \mathcal M_2 \left( \mathbb C \right) \mid \det A = 1 \}$. Prove that $G$ and $H$ together with the operation of matrix multiplication are two non-isomorphical groups.

For an arbitrary square matrix $M$, define $$\exp(M)=I+\frac M{1!}+\frac{M^2}{2!}+\frac{M^3}{3!}+\ldots.$$Construct $2\times2$ matrices $A$ and $B$ such that $\exp(A+B)\ne\exp(A)\exp(B)$.

Let $n\in\mathbb{N}$, $n\geq 2$. Find all values of $k\in\mathbb{N}$, $k\geq 1$, for which the following statement holds: $$\text{"If }A\in\mathcal{M}_n(\mathbb{C})\text{ is such that }A^kA^*=A\text{, then }A=A^*\text{."}$$ (here, $A^*$ denotes the conjugate transpose of $A$).

Let $Z$ denote the set of points in $\mathbb{R}^{n}$ whose coordinates are $0$ or $1.$ (Thus $Z$ has $2^{n}$ elements, which are the vertices of a unit hypercube in $\mathbb{R}^{n}$.) Given a vector subspace $V$ of $\mathbb{R}^{n},$ let $Z(V)$ denote the number of members of $Z$ that lie in $V.$ Let $k$ be given, $0\le k\le n.$ Find the maximum, over all vector subspaces $V\subseteq\mathbb{R}^{n}$ of dimension $k,$ of the number of points in $V\cap Z.$

We are given a finite, simple, non-directed graph. Ann writes positive real numbers on each edge of the graph such that for all vertices the following is true: the sum of the numbers written on the edges incident to a given vertex is less than one. Bob wants to write non-negative real numbers on the vertices in the following way: if the number written at vertex $v$ is $v_0$, and Ann's numbers on the edges incident to $v$ are $e_1,e_2,\ldots,e_k$, and the numbers on the other endpoints of these edges are $v_1,v_2,\ldots,v_k$, then $v_0=\sum_{i=1}^k e_iv_i+2022$. Prove that Bob can always number the vertices in this way regardless of the graph and the numbers chosen by Ann. Proposed by [i]Boldizsár Varga[/i], Verőce

Let $n$ be a positive integer. For $i$ and $j$ in $\{1,2, \ldots, n\}$, let $s(i, j)$ be the number of pairs $(a, b)$ of nonnegative integers satisfying $a i+b j=n$. Let $S$ be the $n$-by-n matrix whose $(i, j)$-entry is $s(i, j)$. For example, when $n=5$, we have $S=\left[\begin{array}{lllll}6 & 3 & 2 & 2 & 2 \\ 3 & 0 & 1 & 0 & 1 \\ 2 & 1 & 0 & 0 & 1 \\ 2 & 0 & 0 & 0 & 1 \\ 2 & 1 & 1 & 1 & 2\end{array}\right]$. Compute the determinant of $S$.

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

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.

Do exist pairwise distinct matrices $ A,B,C\in \mathcal{M}_2(\mathbb{R}) $ verifying the following properties? $ \text{(i)} \det A=\det C$ $ \text{(ii)} AB=C,BC=A,CA=B $ $ \text{(iii)} \text{tr} A,\text{tr} B\neq 0 $ [i]Robert Pop[/i]

Given a matrix $\{a_{ij}\}_{i,j=0}^{9}$, $a_{ij}=10i+j+1$. Andrei is going to cover its entries by $50$ rectangles $1\times 2$ (each such rectangle contains two adjacent entries) so that the sum of $50$ products in these rectangles is minimal possible. Help him. [i]A. Badzyan[/i]

Let $A,B \in M_{n}(\mathbb{R}).$ Show that $rank(A) = rank(B)$ if and only if there exist nonsingular matrices $X,Y,Z \in M_{n}(\mathbb{R})$ such that \[ AX + YB = AZB. \]

Let $x_1,x_2,\ldots,x_n$ be real numbers satisfying $x_1^2+x_2^2+\ldots+x_n^2=1$. Prove that for every integer $k\ge2$ there are integers $a_1,a_2,\ldots,a_n$, not all zero, such that $|a_i|\le k-1$ for all $i$, and $|a_1x_1+a_2x_2+\ldots+a_nx_n|\le{(k-1)\sqrt n\over k^n-1}$. [i](IMO Problem 3)[/i] [i]Proposed by Germany, FR[/i]

Let $A\in\mathcal{M}_n(\mathbb{C})$ such that $A^*A^2 = AA^*$. Prove that $A^2=A$. (Here we denote by $A^*$ the conjugate transpose of $A$.)

Determine all complex numbers $\lambda$ for which there exists a positive integer $n$ and a real $n\times n$ matrix $A$ such that $A^2=A^T$ and $\lambda$ is an eigenvalue of $A$.

Suppose that every integer has been given one of the colours red, blue, green or yellow. Let $x$ and $y$ be odd integers so that $|x| \neq |y|$. Show that there are two integers of the same colour whose difference has one of the following values: $x,y,x+y$ or $x-y$.

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 $n$ and $k$ be positive integers, where $n > 1$ is odd. Suppose $n$ voters are to elect one of the $k$ cadidates from a set $A$ according to the rule of "majoritarian compromise" described below. After each voter ranks the candidates in a column according to his/her preferences, these columns are concatenated to form a $k$ x $n$ voting matrix. We denote the number of ccurences of $a \in A$ in the $i$-th row of the voting matrix by $a_{i}$ . Let $l_{a}$ stand for the minimum integer $l$ for which $\sum^{l}_{i=1}{a_{i}}> \frac{n}{2}$. Setting $l'= min \{l_{a} | a \in A\}$, we will regard the voting matrices which make the set $\{a \in A | l_{a} = l' \}$ as admissible. For each such matrix, the single candidate in this set will get elected according to majoritarian compromise. Moreover, if $w_{1} \geq w_{2} \geq ... \geq
w_{k} \geq 0$ are given, for each admissible voting matrix, $\sum^{k}_{i=1}{w_{i}a_{i}}$ is called the total weighted score of $a \in A$. We will say that the system $(w_{1},w_{2}, . . . , w_{k})$ of weights represents majoritarian compromise if the total score of the elected candidate is maximum among the scores of all candidates. (a) Determine whether there is a system of weights representing majoritarian compromise if $k = 3$. (b) Show that such a system of weights does not exist for $k > 3$.