Found problems: 638
Let be a $ 5\times 5 $ complex matrix $ A $ whose trace is $ 0, $ and such that $ I_5-A $ is invertible.
Prove that $ A^5\neq I_5. $
Given two vectors $v = (v_1,\dots,v_n)$ and $w = (w_1\dots,w_n)$ in $\mathbb{R}^n$, lets define $v*w$ as the matrix in which the element of row $i$ and column $j$ is $v_iw_j$. Supose that $v$ and $w$ are linearly independent. Find the rank of the matrix $v*w - w*v.$
Consider all parabolas of the form $ y\equal{}x^2\plus{}2px\plus{}q$ for $ p,q \in \mathbb{R}$ which intersect the coordinate axes in three distinct points. For such $ p,q$, denote by $ C_{p,q}$ the circle through these three intersection points. Prove that all circles $ C_{p,q}$ have a point in common.
Let $ f_1,f_2,\dots,f_n$ be regular functions on a domain of the complex plane, linearly independent over the complex field. Prove that the functions $ f_i\overline{f}_k, \;1 \leq i,k \leq n$, are also linearly independent.
[i]L. Lempert[/i]
Let $A$ be a real $n\times n$ Matrix and define $e^{A}=\sum_{k=0}^{\infty} \frac{A^{k}}{k!}$
Prove or disprove that for any real polynomial $P(x)$ and any real matrices $A,B$,
$P(e^{AB})$ is nilpotent if and only if $P(e^{BA})$ is nilpotent.
Let be an $ n\times n $ positive-definite symmetric real matrix $ A. $ Prove the following equality.
$$ \tiny\int_{\mathbb{R}^n} \exp\left( -\begin{pmatrix} x_1\\ x_2\\ \vdots \\ x_n\end{pmatrix}^\intercal A\begin{pmatrix} x_1\\ x_2\\ \vdots \\ x_n\end{pmatrix}\right) dx_1dx_2\cdots dx_n=\normalsize\frac{\pi^{n/2}}{\sqrt{\det A} } $$
A $m \times n$ table is filled with signs $"+"$ and $"-"$. A table is called irreducible if one cannot reduce it to the table filled with $"+"$, applying the following operations (as many times as one wishes).
$a)$ It is allowed to flip all the signs in a row or in a column. Prove that an irreducible table contains an irreducible $2\times 2$ sub table.
$b)$ It is allowed to flip all the signs in a row or in a column or on a diagonal (corner cells are diagonals of length $1$). Prove that an irreducible table contains an irreducible $4\times 4$ sub table.
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)$.
Let $A$ be an $n\times n$ matrix with strictly positive elements and two vectors $u,v\in\mathbb{R}^n$, also with strictly positive elements, such that $$Au=v\text{ and }Av=u.$$ Prove that $u=v$.
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]
In a $999 \times 999$ square table some cells are white and the remaining ones are red. Let $T$ be the number of triples $(C_1,C_2,C_3)$ of cells, the first two in the same row and the last two in the same column, with $C_1,C_3$ white and $C_2$ red. Find the maximum value $T$ can attain.
[i]Proposed by Merlijn Staps, The Netherlands[/i]
Let $p$ be a positive integer, $p>1.$ Find the number of $m\times n$ matrices with entries in the set $\left\{ 1,2,\dots,p\right\} $ and such that the sum of elements on each row and each column is not divisible by $p.$
For a real coefficient cubic polynomial $f(x)=ax^3+bx^2+cx+d$, denote three roots of the equation $f(x)=0$ by $\alpha,\beta,\gamma$. Prove that the three roots $\alpha,\beta,\gamma$ are distinct real numbers iff the real symmetric matrix
$$\begin{pmatrix} 3 & p_1 & p_2 \\ p_1 & p_2 & p_3 \\ p_2 & p_3 & p_4 \end{pmatrix},\quad p_i = \alpha^i + \beta^i + \gamma^i$$
is positive definite.
An $n\times n$ table whose cells are numerated with numbers $1, 2,\cdots, n^2$ in some order is called [i]Naissus[/i] if all products of $n$ numbers written in $n$ [i]scattered[/i] cells give the same residue when divided by $n^2+1$. Does there exist a Naissus table for
$(a) n = 8;$
$(b) n = 10?$
($n$ cells are [i]scattered[/i] if no two are in the same row or column.)
[i]Proposed by Marko Djikic[/i]
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.
A $ 4\times 4$ table is divided into $ 16$ white unit square cells. Two cells are called neighbors if they share a common side. A [i]move[/i] consists in choosing a cell and the colors of neighbors from white to black or from black to white. After exactly $ n$ moves all the $ 16$ cells were black. Find all possible values of $ n$.
Let $A=(a_{ij})$ be the $n\times n$ matrix, where $a_{ij}$ is the remainder of the division of $i^j+j^i$ by $3$ for $i,j=1,2,\ldots,n$. Find the greatest $n$ for which $\det A\ne0$.
Let $ABCD$ be a convex quadrilateral such that \[\begin{array}{rl} E,F \in [AB],& AE = EF = FB \\ G,H \in [BC],& BG = GH = HC \\ K,L \in [CD],& CK = KL = LD \\ M,N \in [DA],& DM = MN = NA \end{array}\] Let \[[NG] \cap [LE] = \{P\}, [NG]\cap [KF] = \{Q\},\] \[{[}MH] \cap [KF] = \{R\}, [MH]\cap [LE]=\{S\}\]
Prove that [list=a][*]$Area(ABCD) = 9 \cdot Area(PQRS)$ [*] $NP=PQ=QG$ [/list]
Let points $ A = (0,0) , \ B = (1,2), \ C = (3,3), $ and $ D = (4,0) $. Quadrilateral $ ABCD $ is cut into equal area pieces by a line passing through $ A $. This line intersects $ \overline{CD} $ at point $ \left (\frac{p}{q}, \frac{r}{s} \right ) $, where these fractions are in lowest terms. What is $ p + q + r + s $?
$ \textbf{(A)} \ 54 \qquad \textbf{(B)} \ 58 \qquad \textbf{(C)} \ 62 \qquad \textbf{(D)} \ 70 \qquad \textbf{(E)} \ 75 $
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.
Solve the system of equations:
$
\begin{matrix}
|x+y| + |1-x| = 6 \\ |x+y+1| + |1-y| = 4.
\end{matrix}
$
Let be two $ 3\times 3 $ real matrices that have the property that
$$ AX=\begin{pmatrix}0\\0\\0\end{pmatrix}\implies BX=\begin{pmatrix}0\\0\\0\end{pmatrix} , $$
for any three-dimensional vectors $ X. $
Prove that there exists a $ 3\times 3 $ real matrix $ C $ such that $ B=CA. $
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.
Here is a problem we (me and my colleagues) suggested and was given at the competition this year. The problem statement is very natural and short. However, we have not seen such a problem before.
A real $2024 \times 2024$ matrix $A$ is called nice if $(Av, v) = 1$ for every vector $v\in \mathbb{R}^{2024}$ with unit norm.
a) Prove that the only nice matrix such that all of its eigenvalues are real is the identity matrix.
b) Find an example of a nice non-identity matrix
$n$ teams take part in a tournament, in which every two teams compete exactly once, and that no draws are possible. It is known that for any two teams, there exists another team which defeated both of the two teams. Find all $n$ for which this is possible.