Let $ ABC$ be an isosceles right triangle and $M$ be the midpoint of its hypotenuse $AB$. Points $D$ and $E$ are taken on the legs $AC$ and $BC$ respectively such that $AD=2DC$ and $BE=2EC$. Lines $AE$ and $DM$ intersect at $F$. Show that $FC$ bisects the $\angle DFE$.

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

In a matrix $2n \times 2n$, $n \in N$, are $4n^2$ real numbers with a sum equal zero. The absolute value of each of these numbers is not greater than $1$. Prove that the absolute value of a sum of all the numbers from one column or a row doesn't exceed $n$.

Consider the sytem of equations \[ a_{11}x_1+a_{12}x_2+a_{13}x_3 = 0 \]\[a_{21}x_1+a_{22}x_2+a_{23}x_3 =0\]\[a_{31}x_1+a_{32}x_2+a_{33}x_3 = 0 \] with unknowns $x_1, x_2, x_3$. The coefficients satisfy the conditions: a) $a_{11}, a_{22}, a_{33}$ are positive numbers; b) the remaining coefficients are negative numbers; c) in each equation, the sum ofthe coefficients is positive. Prove that the given system has only the solution $x_1=x_2=x_3=0$.

How many of the integers between 1 and 1000, inclusive, can be expressed as the difference of the squares of two nonnegative integers?

Let $n$ be a nonzero natural number and $f:\mathbb R\to\mathbb R\setminus\{0\}$ be a function such that $f(2014)=1-f(2013)$. Let $x_1,x_2,x_3,\ldots,x_n$ be real numbers not equal to each other. If $$\begin{vmatrix}1+f(x_1)&f(x_2)&f(x_3)&\cdots&f(x_n)\\f(x_1)&1+f(x_2)&f(x_3)&\cdots&f(x_n)\\f(x_1)&f(x_2)&1+f(x_3)&\cdots&f(x_n)\\\vdots&\vdots&\vdots&\ddots&\vdots\\f(x_1)&f(x_2)&f(x_3)&\cdots&1+f(x_n)\end{vmatrix}=0,$$prove that $f$ is not continuous.

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

There is a $2n \times 2n$ array (matrix) consisting of $0's$ and $1's$ and there are exactly $3n$ zeroes. Show that it is possible to remove all the zeroes by deleting some $n$ rows and some $n$ columns.

The point $ P \equal{} (1,2,3)$ is reflected in the $ xy$-plane, then its image $ Q$ is rotated by $ 180^\circ$ about the $ x$-axis to produce $ R$, and finally, $ R$ is translated by 5 units in the positive-$ y$ direction to produce $ S$. What are the coordinates of $ S$? $ \textbf{(A)}\ (1,7, \minus{} 3) \qquad \textbf{(B)}\ ( \minus{} 1,7, \minus{} 3) \qquad \textbf{(C)}\ ( \minus{} 1, \minus{} 2,8) \qquad \textbf{(D)}\ ( \minus{} 1,3,3) \qquad \textbf{(E)}\ (1,3,3)$

A real number with absolute value less than $1$ is written in each cell of an $n\times n$ array, so that the sum of the numbers in each $2\times 2$ square is zero. Show that for odd $n$ the sum of all the numbers is less than $n$.

How many solutions does the system have: $ \{\begin{matrix}&(3x+2y) *(\frac{3}{x}+\frac{1}{y})=2\\ & x^2+y^2\leq 2012\\ \end{matrix} $ where $ x,y $ are non-zero integers

A country has $n$ cities, labelled $1,2,3,\dots,n$. It wants to build exactly $n-1$ roads between certain pairs of cities so that every city is reachable from every other city via some sequence of roads. However, it is not permitted to put roads between pairs of cities that have labels differing by exactly $1$, and it is also not permitted to put a road between cities $1$ and $n$. Let $T_n$ be the total number of possible ways to build these roads. (a) For all odd $n$, prove that $T_n$ is divisible by $n$. (b) For all even $n$, prove that $T_n$ is divisible by $n/2$.

For an ${n\times n}$ matrix $A$, let $X_{i}$ be the set of entries in row $i$, and $Y_{j}$ the set of entries in column $j$, ${1\leq i,j\leq n}$. We say that $A$ is [i]golden[/i] if ${X_{1},\dots ,X_{n},Y_{1},\dots ,Y_{n}}$ are distinct sets. Find the least integer $n$ such that there exists a ${2004\times 2004}$ golden matrix with entries in the set ${\{1,2,\dots ,n\}}$.

In Determinant Tic-Tac-Toe, Player $1$ enters a $1$ in an empty $3 \times 3$ matrix. Player $0$ counters with a $0$ in a vacant position and play continues in turn intil the $ 3 \times 3 $ matrix is completed with five $1$’s and four $0$’s. Player $0$ wins if the determinant is $0$ and player $1$ wins otherwise. Assuming both players pursue optimal strategies, who will win and how?

$A$ and $B$ are $2\times 2$ real valued matrices satisfying $$\det A = \det B = 1,\quad \text{tr}(A)>2,\quad \text{tr}(B)>2,\quad \text{tr}(ABA^{-1}B^{-1}) = 2$$ Prove that $A$ and $B$ have a common eigenvector.

Determine all pairs $(a, b)$ of real numbers for which there exists a unique symmetric $2\times 2$ matrix $M$ with real entries satisfying $\mathrm{trace}(M)=a$ and $\mathrm{det}(M)=b$. (Proposed by Stephan Wagner, Stellenbosch University)

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 $p$ be a prime number. Prove that from a $p^2\times p^2$ array of squares, we can select $p^3$ of the squares such that the centers of any four of the selected squares are not the vertices of a rectangle with sides parallel to the edges of the array.

Let $A$ be a $5\times10$ matrix with real entries, and let $A^{\text T}$ denote its transpose. Suppose every $5\times1$ matrix with real entries can be written in the form $A\mathbf u$ where $\mathbf u$ is a $10\times1$ matrix with real entries. Prove that every $5\times1$ matrix with real entries can be written in the form $AA^{\text T}\mathbf v$ where $\mathbf v$ is a $5\times1$ matrix with real entries.

Let $X$ be a $5\times 5$ matrix with each entry be $0$ or $1$. Let $x_{i,j}$ be the $(i,j)$-th entry of $X$ ($i,j=1,2,\hdots,5$). Consider all the $24$ ordered sequence in the rows, columns and diagonals of $X$ in the following: \begin{align*} &(x_{i,1}, x_{i,2},\hdots,x_{i,5}),\ (x_{i,5},x_{i,4},\hdots,x_{i,1}),\ (i=1,2,\hdots,5) \\ &(x_{1,j}, x_{2,j},\hdots,x_{5,j}),\ (x_{5,j},x_{4,j},\hdots,x_{1,j}),\ (j=1,2,\hdots,5) \\ &(x_{1,1},x_{2,2},\hdots,x_{5,5}),\ (x_{5,5},x_{4,4},\hdots,x_{1,1}) \\ &(x_{1,5},x_{2,4},\hdots,x_{5,1}),\ (x_{5,1},x_{4,2},\hdots,x_{1,5}) \end{align*} Suppose that all of the sequences are different. Find all the possible values of the sum of all entries in $X$.

If $ P(x),Q(x),R(x)$, and $ S(x)$ are all polynomials such that \[ P(x^5)\plus{}xQ(x^5)\plus{}x^2R(x^5)\equal{}(x^4\plus{}x^3\plus{}x^2\plus{}x\plus{}1)S(x),\] prove that $ x\minus{}1$ is a factor of $ P(x)$.

A matrix $A=(a_{ij})$ is called [i]nice[/i], if it has the following properties: (i) the set of all entries of $A$ is $\{1,2,\dots,2t\}$ for some integer $t$; (ii) the entries are non-decreasing in every row and in every column: $a_{i,j} \le a_{i,j+1}$ and $a_{i,j} \le a_{i+1,j}$; (iii) equal entries can appear only in the same row or the same column: if $a_{i,j}=a_{k,\ell}$, then either $i=k$ or $j=\ell$; (iv) for each $s=1,2,\dots,2t-1$, there exist $i \ne k$ and $j \ne \ell$ such that $a_{i,j}=s$ and $a_{k,\ell}=s+1$. Prove that for any positive integers $m$ and $n$, the number of nice $m \times n$ matrixes is even. For example, the only two nice $2 \times 3$ matrices are $\begin{pmatrix} 1 & 1 & 1\\2 & 2 & 2 \end{pmatrix}$ and $\begin{pmatrix} 1 & 1 & 3\\2 & 4 & 4 \end{pmatrix}$.

Let $n \geq 2$ and $A, B \in \mathcal{M}_n(\mathbb{C})$ such that there exists an idempotent matrix $C \in \mathcal{M}_n(\mathbb{C})$ for which $C^*=AB-BA.$ Prove that $(AB-BA)^2=0.$ Note: $X^*$ is the [url = https://en.wikipedia.org/wiki/Adjugate_matrix]adjugate[/url] matrix of $X$ (not the conjugate transpose)

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 $\displaystyle{A}$ and $\displaystyle{B}$ be real symmetric matrixes with all eigenvalues strictly greater than $\displaystyle{1}$. Let $\displaystyle{\lambda }$ be a real eigenvalue of matrix $\displaystyle{{\rm A}{\rm B}}$. Prove that $\displaystyle{\left| \lambda \right| > 1}$. [i]Proposed by Pavel Kozhevnikov, MIPT, Moscow.[/i]