$A = \begin{pmatrix} 2019 & 2020 & 2021 \\ 2020 & 2021 & 2022 \\ 2021 & 2022 & 2023 \end{pmatrix}$. Find $\text{rank}(A)$.

Let $x_1,\ldots, x_n$ and $y_1,\ldots, y_n$ be real numbers. Let $A = (a_{ij})_{1\leq i,j\leq n}$ be the matrix with entries \[a_{ij} = \begin{cases}1,&\text{if }x_i + y_j\geq 0;\\0,&\text{if }x_i + y_j < 0.\end{cases}\] Suppose that $B$ is an $n\times n$ matrix with entries $0$, $1$ such that the sum of the elements in each row and each column of $B$ is equal to the corresponding sum for the matrix $A$. Prove that $A=B$.

The following figure shows a [i]walk[/i] of length 6: [asy] unitsize(20); for (int x = -5; x <= 5; ++x) for (int y = 0; y <= 5; ++y) dot((x, y)); label("$O$", (0, 0), S); draw((0, 0) -- (1, 0) -- (1, 1) -- (0, 1) -- (-1, 1) -- (-1, 2) -- (-1, 3)); [/asy] This walk has three interesting properties: [list] [*] It starts at the origin, labelled $O$. [*] Each step is 1 unit north, east, or west. There are no south steps. [*] The walk never comes back to a point it has been to.[/list] Let's call a walk with these three properties a [i]northern walk[/i]. There are 3 northern walks of length 1 and 7 northern walks of length 2. How many northern walks of length 6 are there?

Let $n \ge 2$ be an integer, and let $O$ be the $n \times n$ matrix whose entries are all equal to $0$. Two distinct entries of the matrix are chosen uniformly at random, and those two entries are changed from $0$ to $1$. Call the resulting matrix $A$. Determine the probability that $A^2 = O$, as a function of $n$.

Let $ d_n$ be the determinant of the $ n\times n$ matrix whose entries, from left to right and then from top to bottom, are $ \cos 1,\cos 2,\dots,\cos n^2.$ (For example, $ d_3 \equal{} \begin{vmatrix}\cos 1 & \cos2 & \cos3 \\ \cos4 & \cos5 & \cos 6 \\ \cos7 & \cos8 & \cos 9\end{vmatrix}.$ The argument of $ \cos$ is always in radians, not degrees.) Evaluate $ \lim_{n\to\infty}d_n.$

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

Let $A=\left( \begin{array}{ccc} 1 & 1& 0 \\ 0 & 1& 0 \\ 0 &0 & 2 \end{array} \right),\ B=\left( \begin{array}{ccc} a & 1& 0 \\ b & 2& c \\ 0 &0 & a+1 \end{array} \right)\ (a,\ b,\ c\in{\mathbb{C}}).$ (1) Find the condition for $a,\ b,\ c$ such that ${\text{rank} (AB-BA})\leq 1.$ (2) Under the condition of (1), find the condition for $a,\ b,\ c$ such that $B$ is diagonalizable.

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 $ A,B,S $ be three $ 3\times 3 $ complex matrices with $ B=S^{-1}AS , $ and $ S $ nonsingular. Show: $$ \text{tr} \left( B^2\right) +2\text{tr}(C(B)) = \left(\text{tr} (A)\right)^2 , $$ where $ C(B) $ is the cofactor of $ B. $ [i]Mihai Haivas[/i]

Sequences $(x_n)_{n\ge1}$, $(y_n)_{n\ge1}$ satisfy the relations $x_n=4x_{n-1}+3y_{n-1}$ and $y_n=2x_{n-1}+3y_{n-1}$ for $n\ge1$. If $x_1=y_1=5$ find $x_n$ and $y_n$. Calculate $\lim_{n\rightarrow\infty}\frac{x_n}{y_n}$.

Let $ n > 1$ be an odd positive integer and $ A = (a_{ij})_{i, j = 1..n}$ be the $ n \times n$ matrix with \[ a_{ij}= \begin{cases}2 & \text{if }i = j \\ 1 & \text{if }i-j \equiv \pm 2 \pmod n \\ 0 & \text{otherwise}\end{cases}.\] Find $ \det A$.

a magical $3\times3$ square is a $3\times3$ matrix containing all number from 1 to 9, and of which the sum of every row, every column, every diagonal, are all equal. Determine all magical $3\times3$ square

Prove that the determinant of the matrix $$\begin{pmatrix} a_{1}^{2}+k & a_1 a_2 & a_1 a_3 &\ldots & a_1 a_n\\ a_2 a_1 & a_{2}^{2}+k & a_2 a_3 &\ldots & a_2 a_n\\ \ldots & \ldots & \ldots & \ldots & \ldots \\ a_n a_1& a_n a_2 & a_n a_3 & \ldots & a_{n}^{2}+k \end{pmatrix}$$ is divisible by $k^{n-1}$ and find its other factor.

Given two distinct elements $a,b \in \{-1,0,1\}$, consider the matrix $A$ . Find a subset $S$ of the set of the rows of $A$, of minimum size, such that every other row of $A$ is a linear combination of the rows in $S$ with integer coefficients.

On a chess table $n\times m$ we call a [i]move [/i] the following succesion of operations (i) choosing some unmarked squares, any two not lying on the same row or column; (ii) marking them with 1; (iii) marking with 0 all the unmarked squares which lie on the same line and column with a square marked with the number 1 (even if the square has been marked with 1 on another move). We call a [i]game [/i]a succession of moves that end in the moment that we cannot make any more moves. What is the maximum possible sum of the numbers on the table at the end of a game?

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

In a magic square $n \times n$ composed from the numbers $1,2,\cdots,n^2$, the centers of any two squares are joined by a vector going from the smaller number to the bigger one. Prove that the sum of all these vectors is zero. (A magic square is a square matrix such that the sums of entries in all its rows and columns are equal.)

Let $ A\equal{}(a_{ij})_{1\leq i,j\leq n}$ be a real $ n\times n$ matrix, such that $ a_{ij} \plus{} a_{ji} \equal{} 0$, for all $ i,j$. Prove that for all non-negative real numbers $ x,y$ we have \[ \det(A\plus{}xI_n)\cdot \det(A\plus{}yI_n) \geq \det (A\plus{}\sqrt{xy}I_n)^2.\]

Two cubical dice each have removable numbers $ 1$ through $ 6$. The twelve numbers on the two dice are removed, put into a bag, then drawn one at a time and randomly reattached to the faces of the cubes, one number to each face. The dice are then rolled and the numbers on the two top faces are added. What is the probability that the sum is $ 7$? $ \textbf{(A)}\ \frac{1}{9} \qquad \textbf{(B)}\ \frac{1}{8} \qquad \textbf{(C)}\ \frac{1}{6} \qquad \textbf{(D)}\ \frac{2}{11} \qquad \textbf{(E)}\ \frac{1}{5}$

Let $P_1,P_2,\dots,P_n$ be $n$ distinct points over a line in the plane ($n\geq2$). Consider all the circumferences with diameters $P_iP_j$ ($1\leq{i,j}\leq{n}$) and they are painted with $k$ given colors. Lets call this configuration a ($n,k$)-cloud. For each positive integer $k$, find all the positive integers $n$ such that every possible ($n,k$)-cloud has two mutually exterior tangent circumferences of the same color.

For each positive integer $n$, let $M(n)$ be the $n\times n$ matrix whose $(i,j)$ entry is equal to $1$ if $i+1$ is divisible by $j$, and equal to $0$ otherwise. Prove that $M(n)$ is invertible if and only if $n+1$ is square-free. (An integer is [i]square-free[/i] if it is not divisible by a square of an integer larger than $1$.)

Tessa the hyper-ant has a 2019-dimensional hypercube. For a real number $k$, she calls a placement of nonzero real numbers on the $2^{2019}$ vertices of the hypercube [i]$k$-harmonic[/i] if for any vertex, the sum of all 2019 numbers that are edge-adjacent to this vertex is equal to $k$ times the number on this vertex. Let $S$ be the set of all possible values of $k$ such that there exists a $k$-harmonic placement. Find $\sum_{k \in S} |k|$.

2500 chess kings have to be placed on a $100 \times 100$ chessboard so that [b](i)[/b] no king can capture any other one (i.e. no two kings are placed in two squares sharing a common vertex); [b](ii)[/b] each row and each column contains exactly 25 kings. Find the number of such arrangements. (Two arrangements differing by rotation or symmetry are supposed to be different.) [i]Proposed by Sergei Berlov, Russia[/i]

We call a matrix $\textsl{binary matrix}$ if all its entries equal to $0$ or $1$. A binary matrix is $\textsl{Good}$ if it simultaneously satisfies the following two conditions: (1) All the entries above the main diagonal (from left to right), not including the main diagonal, are equal. (2) All the entries below the main diagonal (from left to right), not including the main diagonal, are equal. Given positive integer $m$, prove that there exists a positive integer $M$, such that for any positive integer $n>M$ and a given $n \times n$ binary matrix $A_n$, we can select integers $1 \leq i_1 <i_2< \cdots < i_{n-m} \leq n$ and delete the $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th rows and $i_i$-th, $i_2$-th,$\cdots$, $i_{n-m}$-th columns of $A_n$, then the resulting binary matrix $B_m$ is $\textsl{Good}$.

Suppose that $\displaystyle{{v_1},{v_2},...,{v_d}}$ are unit vectors in $\displaystyle{{{\Bbb R}^d}}$. Prove that there exists a unitary vector $\displaystyle{u}$ such that $\displaystyle{\left| {u \cdot {v_i}} \right| \leq \frac{1}{{\sqrt d }}}$ for $\displaystyle{i = 1,2,...,d}$. [b]Note.[/b] Here $\displaystyle{ \cdot }$ denotes the usual scalar product on $\displaystyle{{{\Bbb R}^d}}$. [i]Proposed by Tomasz Tkocz, University of Warwick.[/i]