Let $n\ge 3$ be an integer. Two players, Ana and Beto, play the following game. Ana tags the vertices of a regular $n$- gon with the numbers from $1$ to $n$, in any order she wants. Every vertex must be tagged with a different number. Then, we place a turkey in each of the $n$ vertices. These turkeys are trained for the following. If Beto whistles, each turkey moves to the adjacent vertex with greater tag. If Beto claps, each turkey moves to the adjacent vertex with lower tag. Beto wins if, after some number of whistles and claps, he gets to move all the turkeys to the same vertex. Ana wins if she can tag the vertices so that Beto can't do this. For each $n\ge 3$, determine which player has a winning strategy. [i]Proposed by Victor and Isaías de la Fuente[/i]

Let $ABC$ be a triangle with orthocenter $H$, incenter $I$ and centroid $S$, and let $d$ be the diameter of the circumcircle of triangle $ABC$. Prove the inequality \[9\cdot HS^2+4\left(AH\cdot AI+BH\cdot BI+CH\cdot CI\right)\geq 3d^2,\] and determine when equality holds.

On a board are drawn the points $A,B,C,D$. Yetti constructs the points $A^\prime,B^\prime,C^\prime,D^\prime$ in the following way: $A^\prime$ is the symmetric of $A$ with respect to $B$, $B^\prime$ is the symmetric of $B$ wrt $C$, $C^\prime$ is the symmetric of $C$ wrt $D$ and $D^\prime$ is the symmetric of $D$ wrt $A$. Suppose that Armpist erases the points $A,B,C,D$. Can Yetti rebuild them? $\star \, \, \star \, \, \star$ [b]Note.[/b] [i]Any similarity to real persons is purely accidental.[/i]

We attach to the vertices of a regular hexagon the numbers $1$, $0$, $0$, $0$, $0$, $0$. Now, we are allowed to transform the numbers by the following rules: (a) We can add an arbitrary integer to the numbers at two opposite vertices. (b) We can add an arbitrary integer to the numbers at three vertices forming an equilateral triangle. (c) We can subtract an integer $t$ from one of the six numbers and simultaneously add $t$ to the two neighbouring numbers. Can we, just by acting several times according to these rules, get a cyclic permutation of the initial numbers? (I. e., we started with $1$, $0$, $0$, $0$, $0$, $0$; can we now get $0$, $1$, $0$, $0$, $0$, $0$, or $0$, $0$, $1$, $0$, $0$, $0$, or $0$, $0$, $0$, $1$, $0$, $0$, or $0$, $0$, $0$, $0$, $1$, $0$, or $0$, $0$, $0$, $0$, $0$, $1$ ?)

Three equilateral triangles $ABC, CDE, EHK$ (the vertices are mentioned counterclockwise) are lying in the plane so, that the vectors $\overrightarrow{AD}$ and $\overrightarrow{DK}$ are equal. Prove that the triangle $BHD$ is also equilateral

In convex hexagon $ABCDEF$, $AB \parallel DE$, $BC \parallel EF$, $CD \parallel FA$, and \[ AB+DE = BC+EF = CD+FA. \] The midpoints of sides $AB$, $BC$, $DE$, $EF$ are $A_1$, $B_1$, $D_1$, $E_1$, and segments $A_1D_1$ and $B_1E_1$ meet at $O$. Prove that $\angle D_1OE_1 = \frac12 \angle DEF$.

From a $n\times (n-1)$ rectangle divided into unit squares, we cut the [i]corner[/i], which consists of the first row and the first column. (that is, the corner has $2n-2$ unit squares). For the following, when we say [i]corner[/i] we reffer to the above definition, along with rotations and symmetry. Consider an infinite lattice of unit squares. We will color the squares with $k$ colors, such that for any corner, the squares in that corner are coloured differently (that means that there are no squares coloured with the same colour). Find out the minimum of $k$. [i]Proposed by S. Berlov[/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 $n \geq 2$ be a positive integer and, for all vectors with integer entries $$X=\begin{pmatrix} x_1 \\ x_2 \\ \vdots \\ x_n \end{pmatrix}$$ let $\delta(X) \geq 0$ be the greatest common divisor of $x_1,x_2, \dots, x_n.$ Also, consider $A \in \mathcal{M}_n(\mathbb{Z}).$ Prove that the following statements are equivalent: $\textbf{i) }$ $|\det A | = 1$ $\textbf{ii) }$ $\delta(AX)=\delta(X),$ for all vectors $X \in \mathcal{M}_{n,1}(\mathbb{Z}).$ [i]Romeo Raicu[/i]

Let $ABCD$ and $A'B'C'D'$ be two arbitrary squares in the plane that are oriented in the same direction. Prove that the quadrilateral formed by the midpoints of $AA',BB',CC',DD'$ is a square.

On the plane are given unit vectors $\overrightarrow{a_1},\overrightarrow{a_2},\overrightarrow{a_3}$. Show that one can choose numbers $c_1,c_2,c_3 \in \{-1,1\}$ such that the length of the vector $c_1\overrightarrow{a_1}+c_2\overrightarrow{a_2}+c_3\overrightarrow{a_3}$ is at least $2$.

We attach to the vertices of a regular hexagon the numbers $1$, $0$, $0$, $0$, $0$, $0$. Now, we are allowed to transform the numbers by the following rules: (a) We can add an arbitrary integer to the numbers at two opposite vertices. (b) We can add an arbitrary integer to the numbers at three vertices forming an equilateral triangle. (c) We can subtract an integer $t$ from one of the six numbers and simultaneously add $t$ to the two neighbouring numbers. Can we, just by acting several times according to these rules, get a cyclic permutation of the initial numbers? (I. e., we started with $1$, $0$, $0$, $0$, $0$, $0$; can we now get $0$, $1$, $0$, $0$, $0$, $0$, or $0$, $0$, $1$, $0$, $0$, $0$, or $0$, $0$, $0$, $1$, $0$, $0$, or $0$, $0$, $0$, $0$, $1$, $0$, or $0$, $0$, $0$, $0$, $0$, $1$ ?)

There are ten coins a line, which are indistinguishable. It is known that two of them are false and have consecutive positions on the line. For each set of positions, you may ask how many false coins it contains. Is it possible to identify the false coins by making only two of those questions, without knowing the answer to the first question before making the second?

Let $R$ be a commutative ring with $1$ such that the number of elements of $R$ is equal to $p^3$ where $p$ is a prime number. Prove that if the number of elements of $\text{zd}(R)$ be in the form of $p^n$ ($n \in \mathbb{N^*}$) where $\text{zd}(R) = \{a \in R \mid \exists 0 \neq b \in R, ab = 0\}$, then $R$ has exactly one maximal ideal.

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]

A circle $K$ centered at $(0,0)$ is given. Prove that for every vector $(a_1,a_2)$ there is a positive integer $n$ such that the circle $K$ translated by the vector $n(a_1,a_2)$ contains a lattice point (i.e., a point both of whose coordinates are integers).

For $m\ge 3,$ a list of $\binom m3$ real numbers $a_{ijk}$ $(1\le i<j<k\le m)$ is said to be [i]area definite[/i] for $\mathbb{R}^n$ if the inequality \[\sum_{1\le i<j<k\le m}a_{ijk}\cdot\text{Area}(\triangle A_iA_jA_k)\ge0\] holds for every choice of $m$ points $A_1,\dots,A_m$ in $\mathbb{R}^n.$ For example, the list of four numbers $a_{123}=a_{124}=a_{134}=1, a_{234}=-1$ is area definite for $\mathbb{R}^2.$ Prove that if a list of $\binom m3$ numbers is area definite for $\mathbb{R}^2,$ then it is area definite for $\mathbb{R}^3.$

Let $ a_1$, $ a_2$, ..., $ a_n$ and $ b_1$, $ b_2$, ..., $ b_n$ be $ 2 \cdot n$ real numbers. Prove that the following two statements are equivalent: [b]i)[/b] For any $ n$ real numbers $ x_1$, $ x_2$, ..., $ x_n$ satisfying $ x_1 \leq x_2 \leq \ldots \leq x_ n$, we have $ \sum^{n}_{k \equal{} 1} a_k \cdot x_k \leq \sum^{n}_{k \equal{} 1} b_k \cdot x_k,$ [b]ii)[/b] We have $ \sum^{s}_{k \equal{} 1} a_k \leq \sum^{s}_{k \equal{} 1} b_k$ for every $ s\in\left\{1,2,...,n\minus{}1\right\}$ and $ \sum^{n}_{k \equal{} 1} a_k \equal{} \sum^{n}_{k \equal{} 1} b_k$.

$ ABC$ and $ A'B'C'$ are two triangles in the same plane such that the lines $ AA',BB',CC'$ are mutually parallel. Let $ [ABC]$ denotes the area of triangle $ ABC$ with an appropriate $ \pm$ sign, etc.; prove that \[ 3([ABC] \plus{} [A'B'C']) \equal{} [AB'C'] \plus{} [BC'A'] \plus{} [CA'B'] \plus{} [A'BC] \plus{} [B'CA] \plus{} [C'AB].\]

In a scalene triangle $ ABC, H$ and $ M$ are the orthocenter an centroid respectively. Consider the triangle formed by the lines through $ A,B$ and $ C$ perpendicular to $ AM,BM$ and $ CM$ respectively. Prove that the centroid of this triangle lies on the line $ MH$.

A bug starts at a vertex of an equilateral triangle. On each move, it randomly selects one of the two vertices where it is not currently located, and crawls along a side of the triangle to that vertex. Given that the probability that the bug moves to its starting vertex on its tenth move is $m/n,$ where $m$ and $n$ are relatively prime positive integers, find $m+n.$

Let $ABC$ be a triangle. Triangles $PAB$ and $QAC$ are constructed outside of triangle $ABC$ such that $AP = AB$ and $AQ = AC$ and $\angle{BAP}= \angle{CAQ}$. Segments $BQ$ and $CP$ meet at $R$. Let $O$ be the circumcenter of triangle $BCR$. Prove that $AO \perp PQ.$

Let $ABCD$ be a convex quadrilateral and points $E$ and $F$ on sides $AB,CD$ such that \[\tfrac{AB}{AE}=\tfrac{CD}{DF}=n\] If $S$ is the area of $AEFD$ show that ${S\leq\frac{AB\cdot CD+n(n-1)AD^2+n^2DA\cdot BC}{2n^2}}$

Find the index of the singular point $0$ of the vector field \[(xy+yz+xz)\]

Let $S$ be a set of positive integers, each of them having exactly $100$ digits in base $10$ representation. An element of $S$ is called [i]atom[/i] if it is not divisible by the sum of any two (not necessarily distinct) elements of $S$. If $S$ contains at most $10$ atoms, at most how many elements can $S$ have?