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]

A particle moves on a circle with center $O$, starting from rest at a point $P$ and coming to rest again at a point $Q$, without coming to rest at any intermediate point. Prove that the acceleration vector of the particle does not vanish at any point between $P$ and $ Q$ and that, at some point $R$ between $P$ and $Q$, the acceleration vector points in along the radius $RO.$

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 $v \in \mathbb{R}^2$ a vector of length 1 and $A$ a $2 \times 2$ matrix with real entries such that: (i) The vectors $A v, A^2 v$ y $A^3 v$ are also of length 1. (ii) The vector $A^2 v$ isn't equal to $\pm v$ nor to $\pm A v$. Prove that $A^t A=I_2$.

Let $A$ be an $n\times n$ matrix of real numbers for some $n\ge 1.$ For each positive integer $k,$ let $A^{[k]}$ be the matrix obtained by raising each entry to the $k$th power. Show that if $A^k=A^{[k]}$ for $k=1,2,\cdots,n+1,$ then $A^k=A^{[k]}$ for all $k\ge 1.$

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 are given a set $S=\{z_1,z_2,\cdots ,z_{1993}\}$, where $z_1,z_2,\cdots ,z_{1993}$ are nonzero complex numbers (also viewed as nonzero vectors in the plane). Prove that we can divide $S$ into some groups such that the following conditions are satisfied: (1) Each element in $S$ belongs and only belongs to one group; (2) For any group $p$, if we use $T(p)$ to denote the sum of all memebers in $p$, then for any memeber $z_i (1\le i \le 1993)$ of $p$, the angle between $z_i$ and $T(p)$ does not exceed $90^{\circ}$; (3) For any two groups $p$ and $q$, the angle between $T(p)$ and $T(q)$ exceeds $90^{\circ}$ (use the notation introduced in (2)).

A block of mass $m$ on a frictionless inclined plane of angle $\theta$ is connected by a cord over a small frictionless, massless pulley to a second block of mass $M$ hanging vertically, as shown. If $M=1.5m$, and the acceleration of the system is $\frac{g}{3}$, where $g$ is the acceleration of gravity, what is $\theta$, in degrees, rounded to the nearest integer? [asy]size(12cm); pen p=linewidth(1), dark_grey=gray(0.25), ll_grey=gray(0.90), light_grey=gray(0.75); pair B = (-1,-1); pair C = (-1,-7); pair A = (-13,-7); path inclined_plane = A--B--C--cycle; draw(inclined_plane, p); real r = 1; // for marking angles draw(arc(A, r, 0, degrees(B-A))); // mark angle label("$\theta$", A + r/1.337*(dir(C-A)+dir(B-A)), (0,0), fontsize(16pt)); // label angle as theta draw((C+(-r/2,0))--(C+(-r/2,r/2))--(C+(0,r/2))); // draw right angle real h = 1.2; // height of box real w = 1.9; // width of box path box = (0,0)--(0,h)--(w,h)--(w,0)--cycle; // the box // box on slope with label picture box_on_slope; filldraw(box_on_slope, box, light_grey, black); label(box_on_slope, "$m$", (w/2,h/2)); pair V = A + rotate(90) * (h/2 * dir(B-A)); // point with distance l/2 from AB pair T1 = dir(125); // point of tangency with pulley pair X1 = intersectionpoint(T1--(T1 - rotate(-90)*(2013*dir(T1))), V--(V+B-A)); // construct midpoint of right side of box draw(T1--X1); // string add(shift(X1-(w,h/2))*rotate(degrees(B-A), (w,h/2)) * box_on_slope); // picture for the hanging box picture hanging_box; filldraw(hanging_box, box, light_grey, black); label(hanging_box, "$M$", (w/2,h/2)); pair T2 = (1,0); pair X2 = (1,-3); draw(T2--X2); // string add(shift(X2-(w/2,h)) * hanging_box); // Draws the actual pulley filldraw(unitcircle, grey, p); // outer boundary of pulley wheel filldraw(scale(0.4)*unitcircle, light_grey, p); // inner boundary of pulley wheel path pulley_body=arc((0,0),0.3,-40,130)--arc((-1,-1),0.5,130,320)--cycle; // defines "arm" of pulley filldraw(pulley_body, ll_grey, dark_grey+p); // draws the arm filldraw(scale(0.18)*unitcircle, ll_grey, dark_grey+p); // inner circle of pulley[/asy][i](Proposed by Ahaan Rungta)[/i]

Denote by $\mathbb{V}$ the real vector space of all real polynomials in one variable, and let $\gamma :\mathbb{V}\to \mathbb{R}$ be a linear map. Suppose that for all $f,g\in \mathbb{V}$ with $\gamma(fg)=0$ we have $\gamma(f)=0$ or $\gamma(g)=0$. Prove that there exist $c,x_0\in \mathbb{R}$ such that \[ \gamma(f)=cf(x_0)\quad \forall f\in \mathbb{V}\]

Let $ x_1,x_2,..,x_n$ be non-negative numbers whose sum is $ 1$ . Show that there exist numbers $ a_1,a_2,\ldots ,a_n$ chosen from amongst $ 0,1,2,3,4$ such that $ a_1,a_2,\ldots ,a_n$ are different from $ 2,2,\ldots ,2$ and $ 2\leq a_1x_1\plus{}a_2x_2\plus{}\ldots\plus{}a_nx_n\leq 2\plus{}\frac{2}{3^n\minus{}1}$.

Let $ ABCD $ be a sqare and $ E $ be a point situated on the segment $ BD, $ but not on the mid. Denote by $ H $ and $ K $ the orthocenters of $ ABE, $ respectively, $ ADE. $ Show that $ \overrightarrow{BH}=\overrightarrow{KD} . $

On a $4 \times 4 \times 3$ rectangular parallelepiped, vertices $A$, $B$, and $C$ are adjacent to vertex $D$. The perpendicular distance from $D$ to the plane containing $A$, $B$, and $C$ is closest to $\text{(A)}\ 1.6 \qquad \text{(B)}\ 1.9 \qquad \text{(C)}\ 2.1 \qquad \text{(D)}\ 2.7 \qquad \text{(E)}\ 2.9$

We define a [i]pseudo-inverse[/i] $B\in \mathcal M_n(\mathbb C)$ of a matrix $A\in\mathcal M_n(\mathbb C)$ a matrix which fulfills the relations \[ A = ABA \quad \text{ and } \quad B=BAB. \] a) Prove that any square matrix has at least a pseudo-inverse. b) For which matrix $A$ is the pseudo-inverse unique? [i]Marius Cavachi[/i]

In an acute triangle $\triangle{ABC}$, let $AE$ and $BF$ be highs of it, and $H$ its orthocenter. The symmetric line of $AE$ with respect to the angle bisector of $\sphericalangle{A}$ and the symmetric line of $BF$ with respect to the angle bisector of $\sphericalangle{B}$ intersect each other on the point $O$. The lines $AE$ and $AO$ intersect again the circuncircle to $\triangle{ABC}$ on the points $M$ and $N$ respectively. Let $P$ be the intersection of $BC$ with $HN$; $R$ the intersection of $BC$ with $OM$; and $S$ the intersection of $HR$ with $OP$. Show that $AHSO$ is a paralelogram.