In some squares of a $2012\times 2012$ grid there are some beetles, such that no square contain more than one beetle. At one moment, all the beetles fly off the grid and then land on the grid again, also satisfying the condition that there is at most one beetle standing in each square. The vector from the centre of the square from which a beetle $B$ flies to the centre of the square on which it lands is called the [i]translation vector[/i] of beetle $B$. For all possible starting and ending configurations, find the maximum length of the sum of the [i]translation vectors[/i] of all beetles.

Let $\mathcal P$ denote the set of planes in three-dimensional space with positive $x$, $y$, and $z$ intercepts summing to one. A point $(x,y,z)$ with $\min \{x,y,z\} > 0$ lies on exactly one plane in $\mathcal P$. What is the maximum possible integer value of $\left(\frac{1}{4} x^2 + 2y^2 + 16z^2\right)^{-1}$? [i]Proposed by Sammy Luo[/i]

Let $V$ be the set of non-collinear pairs of vectors in $\mathbb{R}^3$, and $H$ be the set of lines passing through the origin. Is is true that for every continuous map $f\colon V\rightarrow H$ there exists a continuous map $g\colon V\rightarrow \mathbb{R}^3\,\backslash\,\{ 0\}$ such that $g(v)\in f(v)$ for all $v\in V$? (translated by Miklós Maróti)

Let $1,2,3,\dots,2005,2006,2007,2009,2012,2016,\dots$ be a sequence defined by $x_{k}=k$ for $k=1,2\dots,2006$ and $x_{k+1}=x_{k}+x_{k-2005}$ for $k\ge 2006.$ Show that the sequence has 2005 consecutive terms each divisible by 2006.

We consider graphs with vertices colored black or white. "Switching" a vertex means: coloring it black if it was formerly white, and coloring it white if it was formerly black. Consider a finite graph with all vertices colored white. Now, we can do the following operation: Switch a vertex and simultaneously switch all of its neighbours (i. e. all vertices connected to this vertex by an edge). Can we, just by performing this operation several times, obtain a graph with all vertices colored black? [It is assumed that our graph has no loops (a [i]loop[/i] means an edge connecting one vertex with itself) and no multiple edges (a [i]multiple edge[/i] means a pair of vertices connected by more than one edge).]

On the sides $AB,AD$ of the rhombus $ABCD$ are the points $E,F$ such that $AE=DF$. The lines $BC,DE$ intersect at $P$ and $CD,BF$ intersect at $Q$. Prove that: (a) $\frac{PE}{PD} + \frac{QF}{QB} = 1$; (b) $P,A,Q$ are collinear. [i]Virginia Tica, Vasile Tica[/i]

Let $\rho:G\to GL(V)$ be a representation of a finite $p$-group $G$ over a field of characteristic $p$. Prove that if the restriction of the linear map $\sum_{g\in G} \rho(g)$ to a finite dimensional subspace $W$ of $V$ is injective, then the subspace spanned by the subspaces $\rho(g)W$ $(g\in G)$ is the direct sum of these subspaces.

Let $\alpha_{1}, \alpha_{2}, \cdots , \alpha_{n}$ be numbers in the interval $[0, 2\pi]$ such that the number $\displaystyle\sum_{i=1}^n (1 + \cos \alpha_{i})$ is an odd integer. Prove that \[\displaystyle\sum_{i=1}^n \sin \alpha_i \ge 1\]

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]

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 $n$ be a given positive integer. Say that a set $K$ of points with integer coordinates in the plane is connected if for every pair of points $R, S\in K$, there exists a positive integer $\ell$ and a sequence $R=T_0,T_1, T_2,\ldots ,T_{\ell}=S$ of points in $K$, where each $T_i$ is distance $1$ away from $T_{i+1}$. For such a set $K$, we define the set of vectors \[\Delta(K)=\{\overrightarrow{RS}\mid R, S\in K\}\] What is the maximum value of $|\Delta(K)|$ over all connected sets $K$ of $2n+1$ points with integer coordinates in the plane? [i]Grigory Chelnokov, Russia[/i]

Let $ABCD$ be a parallelogram of center $O$. Prove that for any point $M\in (AB)$, there exist unique points $N\in (OC)$ and $P\in (OD)$ such that $O$ is the center of mass of $\triangle MNP$.

Given $n$ vectors of unit length in the plane. The length of their total sum is less than one. Prove that you can rearrange them to provide the property: [i]for every[/i] $k, k\le n$[i], the length of the sum of the first[/i] $k$ [i]vectors is less than[/i] $2$.

Let $P$ and $Q$ be two convex polygons. Let $h$ be the length of the projection of $Q$ onto a line perpendicular to a side of $P$ which is of length $p$. Define $f(P,Q)$ to be the sum of the products $hp$ over all sides of $P$. Prove that $f(P,Q) = f(Q, P)$.

Let $Z$ denote the set of points in $\mathbb{R}^{n}$ whose coordinates are $0$ or $1.$ (Thus $Z$ has $2^{n}$ elements, which are the vertices of a unit hypercube in $\mathbb{R}^{n}$.) Given a vector subspace $V$ of $\mathbb{R}^{n},$ let $Z(V)$ denote the number of members of $Z$ that lie in $V.$ Let $k$ be given, $0\le k\le n.$ Find the maximum, over all vector subspaces $V\subseteq\mathbb{R}^{n}$ of dimension $k,$ of the number of points in $V\cap Z.$