Let $A$ be a $n\times n$ matrix with complex elements and let $A^\star$ be the classical adjoint of $A$. Prove that if there exists a positive integer $m$ such that $(A^\star)^m = 0_n$ then $(A^\star)^2 = 0_n$. [i]Marian Ionescu, Pitesti[/i]

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.

Consider a finite set of vectors in space $\{a_1, a_2, ... , a_n\}$ and the set $E$ of all vectors of the form $x=\sum_{i=1}^{n}{\lambda _i a_i}$, where $\lambda _i \in \mathbb{R}^{+}\cup \{0\}$. Let $F$ be the set consisting of all the vectors in $E$ and vectors parallel to a given plane $P$. Prove that there exists a set of vectors $\{b_1, b_2, ... , b_p\}$ such that $F$ is the set of all vectors $y$ of the form $y=\sum_{i=1}^{p}{\mu _i b_i}$, where $\mu _i \in \mathbb{R}^{+}\cup \{0\}$.

Equilateral $\triangle ABC$ has side length $\sqrt{111}$. There are four distinct triangles $AD_1E_1$, $AD_1E_2$, $AD_2E_3$, and $AD_2E_4$, each congruent to $\triangle ABC$, with $BD_1 = BD_2=\sqrt{11}$. Find $\sum^4_{k=1}(CE_k)^2$.

Zeroes and ones are arranged in all the squares of $n\times n$ table. All the squares of the left column are filled by ones, and the sum of numbers in every figure of the form [asy]size(50); draw((2,1)--(0,1)--(0,2)--(2,2)--(2,0)--(1,0)--(1,2));[/asy] (consisting of a square and its neighbours from left and from below) is even. Prove that no two rows of the table are identical. [i]Proposed by O. Vanyushina[/i]

Let $n,k$ be positive integers such that $n\ge k$. $n$ lamps are placed on a circle, which are all off. In any step we can change the state of $k$ consecutive lamps. In the following three cases, how many states of lamps are there in all $2^n$ possible states that can be obtained from the initial state by a certain series of operations? i)$k$ is a prime number greater than $2$; ii) $k$ is odd; iii) $k$ is even.

Three unit vectors $a,b,c$ are given on the plane. Prove that one can choose the signs in the expression $x=\pm a\pm b\pm c$ so as to obtain a vector $x$ with $|x|\le\sqrt2$.

Let $ f$ be an entire function on $ \mathbb C$ and $ \omega_1,\omega_2$ are complex numbers such that $ \frac {\omega_1}{\omega_2}\in{\mathbb C}\backslash{\mathbb Q}$. Prove that if for each $ z\in \mathbb C$, $ f(z) \equal{} f(z \plus{} \omega_1) \equal{} f(z \plus{} \omega_2)$ then $ f$ is constant.

Assume that the bisecting plane of the dihedral angle at edge $AB$ of the tetrahedron $ABCD$ meets the edge $CD$ at point $E$. Denote by $S_1, S_2, S_3$, respectively the areas of the triangles $ABC, ABE$, and $ABD$. Prove that no tetrahedron exists for which $S_1, S_2, S_3$ (in this order) form an arithmetic or geometric progression.

Let $P_i$ $i=1,2,......n$ be $n$ points on the plane , $M$ is a point on segment $AB$ in the same plane , prove : $\sum_{i=1}^{n} |P_iM| \le \max( \sum_{i=1}^{n} |P_iA| , \sum_{i=1}^{n} |P_iB| )$. (Here $|AB|$ means the length of segment $AB$) .

Show that every positive rational number can be written as a quotient of products of factorials of (not necessarily distinct) primes. For example, $ \frac{10}9\equal{}\frac{2!\cdot 5!}{3!\cdot 3!\cdot 3!}.$

On sides $AB, BC$ and $CA$ of triangle $ABC$ are located points $P, M$ and $K$, respectively, so that $AM, BK$ and $CP$ intersect in one point and the sum of the vectors $\overrightarrow{AM}, \overrightarrow{BK}$ and $\overrightarrow{CP}$ equals $ \overrightarrow{0}$. Prove that $K, M$ and $P$ are midpoints of the sides of triangle $ABC$ on which they are located.

[asy] real t=pi/12;real u=8*t; real cu=cos(u);real su=sin(u); draw(unitcircle); draw((cos(-t),sin(-t))--(cos(13*t),sin(13*t))); draw((cu,su)--(cu,-su)); label("A",(cos(13*t),sin(13*t)),W); label("B",(cos(-t),sin(-t)),E); label("C",(cu,su),N); label("D",(cu,-su),S); label("E",(cu,sin(-t)),NE); label("2",((cu-1)/2,sin(-t)),N); label("6",((cu+1)/2,sin(-t)),N); label("3",(cu,(sin(-t)-su)/2),E); //Credit to Zimbalono for the diagram[/asy] Chords $AB$ and $CD$ in the circle above intersect at $E$ and are perpendicular to each other. If segments $AE$, $EB$, and $ED$ have measures $2$, $3$, and $6$ respectively, then the length of the diameter of the circle is $\textbf{(A) }4\sqrt{5}\qquad\textbf{(B) }\sqrt{65}\qquad\textbf{(C) }2\sqrt{17}\qquad\textbf{(D) }3\sqrt{7}\qquad \textbf{(E) }6\sqrt{2}$

Let $v_1, v_2, \ldots, v_m$ be vectors in $\mathbb{R}^n$, such that each has a strictly positive first coordinate. Consider the following process. Start with the zero vector $w = (0, 0, \ldots, 0) \in \mathbb{R}^n$. Every round, choose an $i$ such that $1 \le i \le m$ and $w \cdot v_i \le 0$, and then replace $w$ with $w + v_i$. Show that there exists a constant $C$ such that regardless of your choice of $i$ at each step, the process is guaranteed to terminate in (at most) $C$ rounds. The constant $C$ may depend on the vectors $v_1, \ldots, v_m$.

Let $\vec{v_1},\vec{v_2},\vec{v_3},\vec{v_4}$ and $\vec{v_5}$ be vectors in three dimensions. Show that for some $i,j$ in $1,2,3,4,5$, $\vec{v_i}\cdot \vec{v_j}\ge 0$.

Let $\mathbb{M}$ be the vector space of $m \times p$ real matrices. For a vector subspace $S\subseteq \mathbb{M}$, denote by $\delta(S)$ the dimension of the vector space generated by all columns of all matrices in $S$. Say that a vector subspace $T\subseteq \mathbb{M}$ is a $\emph{covering matrix space}$ if \[ \bigcup_{A\in T, A\ne \mathbf{0}} \ker A =\mathbb{R}^p \] Such a $T$ is minimal if it doesn't contain a proper vector subspace $S\subset T$ such that $S$ is also a covering matrix space. [list] (a) (8 points) Let $T$ be a minimal covering matrix space and let $n=\dim (T)$ Prove that \[ \delta(T)\le \dbinom{n}{2} \] (b) (2 points) Prove that for every integer $n$ we can find $m$ and $p$, and a minimal covering matrix space $T$ as above such that $\dim T=n$ and $\delta(T)=\dbinom{n}{2}$[/list]

Consider all $ m \times n$ matrices whose all entries are $ 0$ or $ 1$. Find the number of such matrices for which the number of $ 1$-s in each row and in each column is even.

The base of a regular pyramid is a regular $2n$-gon $A_1A_2...A_{2n}$. A sphere passing through the top vertex $S$ of the pyramid cuts the edge $SA_i$ at $B_i$ (for $i = 1, 2, ... , 2n$). Show that $\sum\limits_{i=1}^n SB_{2i-1} = \sum\limits_{i=1}^n SB_{2i}$.

On a $49\times 69$ rectangle formed by a grid of lattice squares, all $50\cdot 70$ lattice points are colored blue. Two persons play the following game: In each step, a player colors two blue points red, and draws a segment between these two points. (Different segments can intersect in their interior.) Segments are drawn this way until all formerly blue points are colored red. At this moment, the first player directs all segments drawn - i. e., he takes every segment AB, and replaces it either by the vector $\overrightarrow{AB}$, or by the vector $\overrightarrow{BA}$. If the first player succeeds to direct all the segments drawn in such a way that the sum of the resulting vectors is $\overrightarrow{0}$, then he wins; else, the second player wins. Which player has a winning strategy?

Prove that the sum of an odd number of vectors of length 1, of common origin $O$ and all situated in the same semi-plane determined by a straight line which goes through $O,$ is at least 1.

Prove that for every positive integer $n \geq 3$ there exist two sets $A =\{ x_1, x_2,\ldots, x_n\}$ and $B =\{ y_1, y_2,\ldots, y_n\}$ for which [b]i)[/b] $A \cap B = \varnothing.$ [b]ii)[/b] $x_1+ x_2+\cdots+ x_n= y_1+ y_2+\cdots+ y_n.$ [b]ii)[/b] $x_1^2+ x_2^2+\cdots+ x_n^2= y_1^2+ y_2^2+\cdots+ y_n^2.$

Let $a_{ij}$ $i=1,2,3$; $j=1,2,3$ be real numbers such that $a_{ij}$ is positive for $i=j$ and negative for $i\neq j$. Prove the existence of positive real numbers $c_{1}$, $c_{2}$, $c_{3}$ such that the numbers \[a_{11}c_{1}+a_{12}c_{2}+a_{13}c_{3},\qquad a_{21}c_{1}+a_{22}c_{2}+a_{23}c_{3},\qquad a_{31}c_{1}+a_{32}c_{2}+a_{33}c_{3}\] are either all negative, all positive, or all zero. [i]Proposed by Kiran Kedlaya, USA[/i]

If $\sin x + \sin y = \frac{96}{65}$ and $\cos x + \cos y = \frac{72}{65}$, then what is the value of $\tan x + \tan y$?

Assume that $\triangle ABC$ is acute. Let $a=BC, b=CA, c=AB$. a) Denote $H$ by the orthocenter of $\triangle ABC$. Prove that:$$a.\frac{{\overrightarrow {HA} }}{{HA}} + b.\frac{{\overrightarrow {HB} }}{{HB}} + c.\frac{{\overrightarrow {HC} }}{{HC}} = \overrightarrow 0 .$$ b) Consider a point $P$ lying on the plane. Prove that the sum:$$aPa+bPB+cPC$$ get its minimum value iff $P\equiv H$.

Let $n$ be a positive integer. Let $S$ be a subset of points on the plane with these conditions: $i)$ There does not exist $n$ lines in the plane such that every element of $S$ be on at least one of them. $ii)$ for all $X \in S$ there exists $n$ lines in the plane such that every element of $S - {X} $ be on at least one of them. Find maximum of $\mid S\mid$. [i]Proposed by Erfan Salavati[/i]