$P\in A_n(\mathbb R)=\{M_{n\times n}|M^2=M\}$. Which of the following are true? $\textbf{(A)}~P^T=P,\forall P\in A_n(\mathbb R)$ $\textbf{(B)}~\exists P\ne0,P\in A_n(\mathbb R)\text{ with }\operatorname{tr}(P)=0$ $\textbf{(C)}~\exists X_{n\times r}\text{ such that }Px=X\text{ for }r=\operatorname{rank}(P)$

In what case does the system of equations $\begin{matrix} x + y + mz = a \\ x + my + z = b \\ mx + y + z = c \end{matrix}$ have a solution? Find conditions under which the unique solution of the above system is an arithmetic progression.

Each square of a $(2^n-1) \times (2^n-1)$ board contains either $1$ or $-1$. Such an arrangement is called [i]successful[/i] if each number is the product of its neighbors. Find the number of successful arrangements.

Let $A{}$ and $B$ be invertible $n\times n$ matrices with real entries. Suppose that the inverse of $A+B^{-1}$ is $A^{-1}+B$. Prove that $\det(AB)=1$. Does this property hold for $2\times 2$ matrices with complex entries?

Let $A$ be the set of $n$-digit integers whose digits are all from $\{ 1, 2, 3, 4, 5 \}$. $B$ is subset of $A$ such that it contains digit $5$, and there is no digit $3$ in front of digit $5$ (i.e. for $n = 2$, $35$ is not allowed, but $53$ is allowed). How many elements does set $B$ have?

[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]

Let $ a,b_0,b_1,b_2,...,b_{n\minus{}1}$ be complex numbers, $ A$ a complex square matrix of order $ p$, and $ E$ the unit matrix of order $ p$. Assuming that the eigenvalues of $ A$ are given, determine the eigenvalues of the matrix \[ B\equal{}\begin{pmatrix} b_0E&b_1A&b_2A^2&\cdots&b_{n\minus{}1}A^{n\minus{}1} \\ ab_{n\minus{}1}A^{n\minus{}1}&b_0E&b_1A&\cdots&b_{n\minus{}2}A^{n\minus{}2}\\ ab_{n\minus{}2}A^{n\minus{}2}&ab_{n\minus{}1}A^{n\minus{}1}&b_0E&\cdots&b_{n\minus{}3}A^{n\minus{}3}\\ \vdots&\vdots&\vdots&\ddots&\vdots&\\ ab_1A&ab_2A^2&ab_3A^3&\cdots&b_0E \end{pmatrix}\quad\]

If $A,B\in M_2(C)$ such that $AB-BA=B^2$ then prove that \[AB=BA\]

Let $A$ be a $2\,x\,2$ matrix with real numbers. Prove that if $A^3=\mathbb{O}$ then $A^2=\mathbb{O}$.

[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]

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 $

Assume $m\times n$ matrix which is filled with just 0, 1 and any two row differ in at least $n/2$ members, show that $m \leq 2n$. ( for example the diffrence of this two row is only in one index 110 100) [i]Edited by Myth[/i]

Let $A=(a_{ij})$ be an $m\times n$ real matrix with at least one non-zero element. For each $i\in\{1,\ldots,m\}$, let $R_i=\sum_{j=1}^na_{ij}$ be the sum of the $i$-th row of the matrix $A$, and for each $j\in\{1,\ldots,n\}$, let $C_j =\sum_{i=1}^ma_{ij}$ be the sum of the $j$-th column of the matrix $A$. Prove that there exist indices $k\in\{1,\ldots,m\}$ and $l\in\{1,\ldots,n\}$ such that $$a_{kl}>0,\qquad R_k\ge0,\qquad C_l\ge0,$$or $$a_{kl}<0,\qquad R_k\le0,\qquad C_l\le0.$$

Given a square matrix $M$ of order $n$ over the field of numbers real, find, as a function of $M$, two matrices, one symmetric and one antisymmetric, such that their sum is precisely $ M$.

Given such positive real numbers $a, b$ and $c$, that the system of equations: $ \{\begin{matrix}a^2x+b^2y+c^2z=1&&\\xy+yz+zx=1&&\end{matrix} $ has exactly one solution of real numbers $(x, y, z)$. Prove, that there is a triangle, which borders lengths are equal to $a, b$ and $c$.

Nonnegative real numbers $p_{1},\ldots,p_{n}$ and $q_{1},\ldots,q_{n}$ are such that $p_{1}+\cdots+p_{n}=q_{1}+\cdots+q_{n}$ Among all the matrices with nonnegative entries having $p_i$ as sum of the $i$-th row's entries and $q_j$ as sum of the $j$-th column's entries, find the maximum sum of the entries on the main diagonal.

We consider graphs with vertices colored black or white. "Switching" a vertex means: coloring it black if it was formerly white, and coloring it white if it was formerly black. Consider a finite graph with all vertices colored white. Now, we can do the following operation: Switch a vertex and simultaneously switch all of its neighbours (i. e. all vertices connected to this vertex by an edge). Can we, just by performing this operation several times, obtain a graph with all vertices colored black? [It is assumed that our graph has no loops (a [i]loop[/i] means an edge connecting one vertex with itself) and no multiple edges (a [i]multiple edge[/i] means a pair of vertices connected by more than one edge).]

Let $x>0$ be a real number and $A$ a square $2\times 2$ matrix with real entries such that $\det {(A^2+xI_2 )} = 0$. Prove that $\det{ (A^2+A+xI_2) } = x$.

Consider a matrix of size $n\times n$ whose entries are real numbers of absolute value not exceeding $1$. The sum of all entries of the matrix is $0$. Let $n$ be an even positive integer. Determine the least number $C$ such that every such matrix necessarily has a row or a column with the sum of its entries not exceeding $C$ in absolute value. [i]Proposed by Marcin Kuczma, Poland[/i]

Twenty-one girls and twenty-one boys took part in a mathematical competition. It turned out that each contestant solved at most six problems, and for each pair of a girl and a boy, there was at least one problem that was solved by both the girl and the boy. Show that there is a problem that was solved by at least three girls and at least three boys.

Let $p>2$ be a prime number and let $L=\{0,1,\dots,p-1\}^2$. Prove that we can find $p$ points in $L$ with no three of them collinear.

Let $n\geq 2$ and $A,B\in\mathcal{M}_n(\mathbb{C})$ such that $$\{\text{rank}(A^k)\mid k\geq 1\}=\{\text{rank}(B^k)\mid k\geq 1\}.$$ Prove that $\text{rank}(A^k)=\text{rank}(B^k)$ for all $k\geq 1$. [i]Cristi Săvescu[/i]

Let $d$ be a positive integer and let $A$ be a $d\times d$ matrix with integer entries. Suppose $I+A+A_2+\ldots+A_{100}=0$ (where $I$ denotes the identity $d\times d$ matrix, and $0$ denotes the zero matrix, which has all entries $0$). Determine the positive integers $n\le100$ for which $A_n+A_{n+1}+\ldots+A_{100}$ has determinant $\pm1$.

Let $Q$ be an $n$-by-$n$ real orthogonal matrix, and let $u\in \mathbb{R}^n$ be a unit column vector (that is, $u^Tu=1$). Let $P=I-2uu^T$, where $I$ is the $n$-by-$n$ identity matrix. Show that if $1$ is not an eigenvalue of $Q$, then $1$ is an eigenvalue of $PQ$.

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.