Let $ABC$ a triangle be given with $BC = a$, $CA = b$, $AB = c$ ($a \neq b \neq c \neq a$). In plane ($ABC$) take the points $A'$, $B'$, $C'$ such that: [b]I.[/b] The pairs of points $A$ and $A'$, $B$ and $B'$, $C$ and $C'$ either all lie in one side either all lie in different sides under the lines $BC$, $CA$, $AB$ respectively; [b]II.[/b] Triangles $A'BC$, $B'CA$, $C'AB$ are similar isosceles triangles. Find the value of angle $A'BC$ as function of $a, b, c$ such that lengths $AA', BB', CC'$ are not sides of an triangle. (The word "triangle" must be understood in its ordinary meaning: its vertices are not collinear.)

The [i]cross[/i] of a convex $n$-gon is the quadratic mean of the lengths between the possible pairs of vertices. For example, the cross of a $3 \times 4$ rectangle is $\sqrt{ \dfrac{3^2 + 3^2 + 4^2 + 4^2 + 5^2 + 5^2}{6} } = \dfrac{5}{3} \sqrt{6}$. Suppose $S$ is a dodecagon ($12$-gon) inscribed in a unit circle. Find the greatest possible cross of $S$.

Pairwise distinct points $P_1,P_2,\ldots, P_{16}$ lie on the perimeter of a square with side length $4$ centered at $O$ such that $\lvert P_iP_{i+1} \rvert = 1$ for $i=1,2,\ldots, 16$. (We take $P_{17}$ to be the point $P_1$.) We construct points $Q_1,Q_2,\ldots,Q_{16}$ as follows: for each $i$, a fair coin is flipped. If it lands heads, we define $Q_i$ to be $P_i$; otherwise, we define $Q_i$ to be the reflection of $P_i$ over $O$. (So, it is possible for some of the $Q_i$ to coincide.) Let $D$ be the length of the vector $\overrightarrow{OQ_1} + \overrightarrow{OQ_2} + \cdots + \overrightarrow{OQ_{16}}$. Compute the expected value of $D^2$. [i]Ray Li[/i]

Let $n\ge2$. For any two $n$-vectors $\vec x=(x_1,\ldots,x_n)$ and $\vec y=(y_1,\ldots,y_n)$, we define $$f\left(\vec x,\vec y\right)=x_1\overline{y_1}-\sum_{i=2}^nx_i\overline{y_i}.$$Prove that if $f\left(\vec x,\vec x\right)\ge0$, and $f\left(\vec y,\vec y\right)\ge0$, then $\left|f\left(\vec x,\vec y\right)\right|^2\ge f\left(\vec x,\vec x\right)f\left(\vec y,\vec y\right)$.

Let $ H$ be an arbitrary subgroup of the diffeomorphism group $ \mathsf{Diff}^\infty(M)$ of a differentiable manifold $ M$. We say that an $ \mathcal C^\infty$-vector field $ X$ is [i]weakly tangent[/i] to the group $ H$, if there exists a positive integer $ k$ and a $ \mathcal C^\infty$-differentiable map $ \varphi \mathrel{: } \mathord{]} \minus{} \varepsilon,\varepsilon\mathord{[}^k\times M\to M$ such that (i) for fixed $ t_1,\dots,t_k$ the map \[ \varphi_{t_1,\dots,t_k} : x\in M\mapsto \varphi(t_1,\dots,t_k,x)\] is a diffeomorphism of $ M$, and $ \varphi_{t_1,\dots,t_k}\in H$; (ii) $ \varphi_{t_1,\dots,t_k}\in H \equal{} \mathsf{Id}$ whenever $ t_j \equal{} 0$ for some $ 1\leq j\leq k$; (iii) for any $ \mathcal C^\infty$-function $ f: M\to \mathbb R$ \[ X f \equal{} \left.\frac {\partial^k(f\circ\varphi_{t_1,\dots,t_k})}{\partial t_1\dots\partial t_k}\right|_{(t_1,\dots,t_k) \equal{} (0,\dots,0)}.\] Prove, that the commutators of $ \mathcal C^\infty$-vector fields that are weakly tangent to $ H\subset \textsf{Diff}^\infty(M)$ are also weakly tangent to $ H$.

Let $AA_1,BB_1,CC_1$ be the altitudes of a triangle $ABC$. If $\overrightarrow{AA_1}+\overrightarrow{BB_1}+\overrightarrow{CC_1}=0$ prove that the triangle $ABC$ is equilateral.

Let $ABCD$ be a fixed convex quadrilateral with $BC=DA$ and $BC$ not parallel with $DA$. Let two variable points $E$ and $F$ lie of the sides $BC$ and $DA$, respectively and satisfy $BE=DF$. The lines $AC$ and $BD$ meet at $P$, the lines $BD$ and $EF$ meet at $Q$, the lines $EF$ and $AC$ meet at $R$. Prove that the circumcircles of the triangles $PQR$, as $E$ and $F$ vary, have a common point other than $P$.

$m$ and $n$ are two nonnegative integers. In the Philosopher's Chess, The chessboard is an infinite grid of identical regular hexagons and a new piece named the Donkey moves on it as follows: Starting from one of the hexagons, the Donkey moves $m$ cells in one of the $6$ directions, then it turns $60$ degrees clockwise and after that moves $n$ cells in this new direction until it reaches it's final cell. At most how many cells are in the Philosopher's chessboard such that one cannot go from anyone of them to the other with a finite number of movements of the Donkey? [i]Proposed by Shayan Dashmiz[/i]

Given a table with $2^n * n$ 1*1 squares ( $2^n$ rows and n column). In any square we put a number in {1, -1} such that no two rows are the same. Then we change numbers in some squares by 0. Prove that in new table we can choose some rows such that sum of all numbers in these rows equal to 0.

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?

For $n\geq 1$ let $M$ be an $n\times n$ complex array with distinct eigenvalues $\lambda_1,\lambda_2,\ldots,\lambda_k$, with multiplicities $m_1,m_2,\ldots,m_k$ respectively. Consider the linear operator $L_M$ defined by $L_MX=MX+XM^T$, for any complex $n\times n$ array $X$. Find its eigenvalues and their multiplicities. ($M^T$ denotes the transpose matrix of $M$).

Prove that on the coordinate plane it is impossible to draw a closed broken line such that [i](i)[/i] the coordinates of each vertex are rational; [i](ii)[/i] the length each of its edges is 1; [i](iii)[/i] the line has an odd number of vertices.

Given two equilateral triangles $A_1B_1C_1$ and $A_2B_2C_2$ in the plane. (The vertices are mentioned counterclockwise.) We draw vectors $\overrightarrow{OA}, \overrightarrow{OB}, \overrightarrow{OC}$, from the arbitrary point $O$, equal to $\overrightarrow{A_1A_2}, \overrightarrow{B_1B_2}, \overrightarrow{C_1C_2}$ respectively. Prove that the triangle $ABC$ is equilateral.

Define in the plane the sequence of vectors $v_1, v_2, \ldots$ with initial values $v_1 = (1, 0)$, $v_2 = (-1/\sqrt{2}, 1/\sqrt{2})$ and satisfying the relationship $$v_n=\frac{v_{n-1}+v_{n-2}}{\lVert v_{n-1}+v_{n-2}\rVert},$$ for $n \geq 3$. Show that the sequence is convergent and determine its limit. [b]Note:[/b] The expression $\lVert v \rVert$ denotes the length of the vector $v$.