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$.

There are $n$ people standing on a circular track. We want to perform a number of [i]moves[/i] so that we end up with a situation where the distance between every two neighbours is the same. The [i]move[/i] that is allowed consists in selecting two people and asking one of them to walk a distance $d$ on the circular track clockwise, and asking the other to walk the same distance on the track anticlockwise. The two people selected and the quantity $d$ can vary from move to move. Prove that it is possible to reach the desired situation (where the distance between every two neighbours is the same) after at most $n-1$ moves.

Let $K$ be a convex planar set, symmetric about a point $O$, and let $X, Y , Z$ be three points in $K$. Show that $K$ contains the head of one of the vectors $\overrightarrow{OX} \pm \overrightarrow{OY} , \overrightarrow{OX} \pm \overrightarrow{OZ}, \overrightarrow{OY} \pm \overrightarrow{OZ}$.

Let $H$ be an $n\times n$ matrix all of whose entries are $\pm1$ and whose rows are mutually orthogonal. Suppose $H$ has an $a\times b$ submatrix whose entries are all $1.$ Show that $ab\le n.$

Given vectors $\overline a,\overline b,\overline c\in\mathbb R^n$, show that $$(\lVert\overline a\rVert\langle\overline b,\overline c\rangle)^2+(\lVert\overline b\rVert\langle\overline a,\overline c\rangle)^2\le\lVert\overline a\rVert\lVert\overline b\rVert(\lVert\overline a\rVert\lVert\overline b\rVert+|\langle\overline a,\overline b\rangle|)\lVert\overline c\rVert^2$$where $\langle\overline x,\overline y\rangle$ denotes the scalar (inner) product of the vectors $\overline x$ and $\overline y$ and $\lVert\overline x\rVert^2=\langle\overline x,\overline x\rangle$.

Let $ABCD$ be a convex quadrilateral with $AD\not\parallel BC$. Define the points $E=AD \cap BC$ and $I = AC\cap BD$. Prove that the triangles $EDC$ and $IAB$ have the same centroid if and only if $AB \parallel CD$ and $IC^{2}= IA \cdot AC$. [i]Virgil Nicula[/i]

Given vectors $v_1, \dots, v_n$ and the string $v_1v_2 \dots v_n$, we consider valid expressions formed by inserting $n-1$ sets of balanced parentheses and $n-1$ binary products, such that every product is surrounded by a parentheses and is one of the following forms: 1. A "normal product'' $ab$, which takes a pair of scalars and returns a scalar, or takes a scalar and vector (in any order) and returns a vector. \\ 2. A "dot product'' $a \cdot b$, which takes in two vectors and returns a scalar. \\ 3. A "cross product'' $a \times b$, which takes in two vectors and returns a vector. \\ An example of a [i]valid [/i] expression when $n=5$ is $(((v_1 \cdot v_2)v_3) \cdot (v_4 \times v_5))$, whose final output is a scalar. An example of an [i] invalid [/i] expression is $(((v_1 \times (v_2 \times v_3)) \times (v_4 \cdot v_5))$; even though every product is surrounded by parentheses, in the last step one tries to take the cross product of a vector and a scalar. \\ Denote by $T_n$ the number of valid expressions (with $T_1 = 1$), and let $R_n$ denote the remainder when $T_n$ is divided by $4$. Compute $R_1 + R_2 + R_3 + \ldots + R_{1,000,000}$. [i] Proposed by Ashwin Sah [/i]

Let $ ABC$ be a triangle, and $ H$ its orthocenter. Let $ P$ be a point on the circumcircle of triangle $ ABC$ (distinct from the vertices $ A$, $ B$, $ C$), and let $ E$ be the foot of the altitude of triangle $ ABC$ from the vertex $ B$. Let the parallel to the line $ BP$ through the point $ A$ meet the parallel to the line $ AP$ through the point $ B$ at a point $ Q$. Let the parallel to the line $ CP$ through the point $ A$ meet the parallel to the line $ AP$ through the point $ C$ at a point $ R$. The lines $ HR$ and $ AQ$ intersect at some point $ X$. Prove that the lines $ EX$ and $ AP$ are parallel.

$1992$ vectors are given in the plane. Two players pick unpicked vectors alternately. The winner is the one whose vectors sum to a vector with larger magnitude (or they draw if the magnitudes are the same). Can the first player always avoid losing?

Let $a,b,c \in \left[ \frac 12, 1 \right]$. Prove that \[ 2 \leq \frac{ a+b}{1+c} + \frac{ b+c}{1+a} + \frac{ c+a}{1+b} \leq 3 . \] [i]selected by Mircea Lascu[/i]

Prove that these two statements are equivalent for an $n$ dimensional vector space $V$: [b]$\cdot$[/b] For the linear transformation $T:V\longrightarrow V$ there exists a base for $V$ such that the representation of $T$ in that base is an upper triangular matrix. [b]$\cdot$[/b] There exist subspaces $\{0\}\subsetneq V_1 \subsetneq ...\subsetneq V_{n-1}\subsetneq V$ such that for all $i$, $T(V_i)\subseteq V_i$.

Two equal-sized regular $n$-gons intersect to form a $2n$-gon $C$. Prove that the sum of the sides of $C$ which form part of one $n$-gon equals half the perimeter of $C$. [i]Alternative formulation:[/i] Let two equal regular $n$-gons $S$ and $T$ be located in the plane such that their intersection $S\cap T$ is a $2n$-gon (with $n\ge 3$). The sides of the polygon $S$ are coloured in red and the sides of $T$ in blue. Prove that the sum of the lengths of the blue sides of the polygon $S\cap T$ is equal to the sum of the lengths of its red sides.

On a coordinate plane are placed four counters, each of whose centers has integer coordinates. One can displace any counter by the vector joining the centers of two of the other counters. Prove that any two preselected counters can be made to coincide by a finite sequence of moves. [i]Р. Sadykov[/i]