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.

Two particles move along the edges of equilateral triangle $ \triangle ABC$ in the direction \[ A\rightarrow B\rightarrow C\rightarrow A \]starting simultaneously and moving at the same speed. One starts at $ A$, and the other starts at the midpoint of $ \overline{BC}$. The midpoint of the line segment joining the two particles traces out a path that encloses a region $ R$. What is the ratio of the area of $ R$ to the area of $ \triangle ABC$? $ \textbf{(A)}\ \frac {1}{16}\qquad \textbf{(B)}\ \frac {1}{12}\qquad \textbf{(C)}\ \frac {1}{9}\qquad \textbf{(D)}\ \frac {1}{6}\qquad \textbf{(E)}\ \frac {1}{4}$

Determine whether or not there exist two different sets $A,B$, each consisting of at most $2011^2$ positive integers, such that every $x$ with $0 < x < 1$ satisfies the following inequality: \[\left| \sum_{a \in A} x^a - \sum_{b \in B} x^b \right| < (1-x)^{2011}.\]

We define a binary operation $\star$ in the plane as follows: Given two points $A$ and $B$ in the plane, $C = A \star B$ is the third vertex of the equilateral triangle ABC oriented positively. What is the relative position of three points $I, M, O$ in the plane if $I \star (M \star O) = (O \star I)\star M$ holds?

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

Triangle $ABC$ lies in the Cartesian Plane and has an area of 70. The coordinates of $B$ and $C$ are $(12,19)$ and $(23,20)$, respectively, and the coordinates of $A$ are $(p,q)$. The line containing the median to side $BC$ has slope $-5$. Find the largest possible value of $p+q$.

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

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

Find the derivatives of the lengths of the semiaxes of the ellipsoid $x^2 + y^2 + z^2 + xy + yz + zx = 1 + \epsilon xy$ with respect to $\epsilon$ at $\epsilon = 0$.

Let $P$ and $Q$ be points on the sides $BC$ and $CD$ of a convex quadrilateral $ABCD$, respectively, such that $\angle{BAP}=\angle{ DAQ}$. Prove that the triangles $ABP$ and $ADQ$ have equal area if and only if the line joining their orthocenters is perpendicular to $AC.$

Let $P,Q,R,S$ be the midpoints of the sides $BC,CD,DA,AB$ of a convex quadrilateral, respectively. Prove that \[4(AP^2+BQ^2+CR^2+DS^2)\le 5(AB^2+BC^2+CD^2+DA^2)\]

Let $\mathcal A = A_0A_1A_2A_3 \cdots A_{2013}A_{2014}$ be a [i]regular 2014-simplex[/i], meaning the $2015$ vertices of $\mathcal A$ lie in $2014$-dimensional Euclidean space and there exists a constant $c > 0$ such that $A_iA_j = c$ for any $0 \le i < j \le 2014$. Let $O = (0,0,0,\dots,0)$, $A_0 = (1,0,0,\dots,0)$, and suppose $A_iO$ has length $1$ for $i=0,1,\dots,2014$. Set $P=(20,14,20,14,\dots,20,14)$. Find the remainder when \[PA_0^2 + PA_1^2 + \dots + PA_{2014}^2 \] is divided by $10^6$. [i]Proposed by Robin Park[/i]

Find the number of positive and negative squares in the canonical form of the quadratic form $\sum_{i<j}(x_i-x_j)^2$ in $n$ variables. The same for the form $\sum_{i<j}x_i x_j$.

Given vector $\mathbf{u}=\left(\frac{1}{3}, \frac{1}{3}, \frac{1}{3} \right)\in\mathbb{R}^3$ and recursively defined sequence of vectors $\{\mathbf{v}_n\}_{n\geq 0}$ $$\mathbf{v}_0 = (1,2,3),\quad \mathbf{v}_n = \mathbf{u}\times\mathbf{v}_{n-1}$$ Evaluate the value of infinite series $\sum_{n=1}^\infty (3,2,1)\cdot \mathbf{v}_{2n}$.

Suppose $A\subset \{(a_1,a_2,\dots,a_n)\mid a_i\in \mathbb{R},i=1,2\dots,n\}$. For any $\alpha=(a_1,a_2,\dots,a_n)\in A$ and $\beta=(b_1,b_2,\dots,b_n)\in A$, we define \[ \gamma(\alpha,\beta)=(|a_1-b_1|,|a_2-b_2|,\dots,|a_n-b_n|), \] \[ D(A)=\{\gamma(\alpha,\beta)\mid\alpha,\beta\in A\}. \] Please show that $|D(A)|\geq |A|$.

Let $ABC$ be an acute triangle, and let $M$ and $N$ be two points on the line $AC$ such that the vectors $MN$ and $AC$ are identical. Let $X$ be the orthogonal projection of $M$ on $BC$, and let $Y$ be the orthogonal projection of $N$ on $AB$. Finally, let $H$ be the orthocenter of triangle $ABC$. Show that the points $B$, $X$, $H$, $Y$ lie on one circle.

Let $ABCD$ and $A^{\prime }B^{\prime}C^{\prime }D^{\prime }$ be two arbitrary parallelograms in the space, and let $M,$ $N,$ $P,$ $Q$ be points dividing the segments $AA^{\prime },$ $BB^{\prime },$ $CC^{\prime },$ $DD^{\prime }$ in equal ratios. [b]a.)[/b] Prove that the quadrilateral $MNPQ$ is a parallelogram. [b]b.)[/b] What is the locus of the center of the parallelogram $MNPQ,$ when the point $M$ moves on the segment $AA^{\prime }$ ? (Consecutive vertices of the parallelograms are labelled in alphabetical order.

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.

Draw a $2004 \times 2004$ array of points. What is the largest integer $n$ for which it is possible to draw a convex $n$-gon whose vertices are chosen from the points in the array?

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?

We define $(x_1, x_2, \ldots , x_n) \Delta (y_1, y_2, \ldots , y_n) = \left( \sum_{i=1}^{n}x_iy_{2-i}, \sum_{i=1}^{n}x_iy_{3-i}, \ldots , \sum_{i=1}^{n}x_iy_{n+1-i} \right)$, where the indices are taken modulo $n$. Besides this, if $v$ is a vector, we define $v^k = v$, if $k=1$, or $v^k = v \Delta v^{k-1}$, otherwise. Prove that, if $(x_1, x_2, \ldots , x_n)^k = (0, 0, \ldots , 0)$, for some natural number $k$, then $x_1 = x_2 = \ldots = x_n = 0$.

When the IMO is over and students want to relax, they all do the same thing: download movies from the internet. There is a positive number of rooms with internet routers at the hotel, and each student wants to download a positive number of bits. The load of a room is defined as the total number of bits to be downloaded from that room. Nobody likes slow internet, and in particular each student has a displeasure equal to the product of her number of bits and the load of her room. The misery of the group is defined as the sum of the students’ displeasures. Right after the contest, students gather in the hotel lobby to decide who goes to which room. After much discussion they reach a balanced configuration: one for which no student can decrease her displeasure by unilaterally moving to another room. The misery of the group is computed to be $M_1$, and right when they seemed satisfied, Gugu arrived with a serendipitous smile and proposed another configuration that achieved misery $M_2$. What is the maximum value of $M_1/M_2$ taken over all inputs to this problem? [i]Proposed by Victor Reis (proglote), Brazil.[/i]

Let $F:\mathbb{R}^2\to\mathbb{R}$ and $g:\mathbb{R}\to\mathbb{R}$ be twice continuously differentiable functions with the following properties: • $F(u,u)=0$ for every $u\in\mathbb{R};$ • for every $x\in\mathbb{R},g(x)>0$ and $x^2g(x)\le 1;$ • for every $(u,v)\in\mathbb{R}^2,$ the vector $\nabla F(u,v)$ is either $\mathbf{0}$ or parallel to the vector $\langle g(u),-g(v)\rangle.$ Prove that there exists a constant $C$ such that for every $n\ge 2$ and any $x_1,\dots,x_{n+1}\in\mathbb{R},$ we have \[\min_{i\ne j}|F(x_i,x_j)|\le\frac{C}{n}.\]

$S$ is a sphere center $O. G$ and $G'$ are two perpendicular great circles on $S$. Take $A, B, C$ on $G$ and $D$ on $G'$ such that the altitudes of the tetrahedron $ABCD$ intersect at a point. Find the locus of the intersection.

Let $G$ be a group, with operation $*$. Suppose that (i) $G$ is a subset of $\mathbb{R}^3$ (but $*$ need not be related to addition of vectors); (ii) For each $\mathbf{a},\mathbf{b}\in G,$ either $\mathbf{a}\times\mathbf{b}=\mathbf{a}*\mathbf{b}$ or $\mathbf{a}\times\mathbf{b}=\mathbf{0}$ (or both), where $\times$ is the usual cross product in $\mathbb{R}^3.$ Prove that $\mathbf{a}\times\mathbf{b}=\mathbf{0}$ for all $\mathbf{a},\mathbf{b}\in G.$