Let $n>1$ be an integer. Hippo chooses a list of $n$ points in the plane $P_1, \dots, P_n$; some of these points may coincide, but not all of them can be identical. After this, Wombat picks a point from the list $X$ and measures the distances from it to the other $n-1$ points in the list. The average of the resulting $n-1$ numbers will be denoted $m(X)$. Find all values of $n$ for which Hippo can prepare the list in such a way, that for any point $X$ Wombat may pick, he can point to a point $Y$ from the list such that $XY=m(X)$.

Tom, Dorothy, and Sammy went on a vacation and agreed to split the costs evenly. During their trip Tom paid $\$105$, Dorothy paid $\$125$, and Sammy paid $\$175$. In order to share the costs equally, Tom gave Sammy $t$ dollars, and Dorothy gave Sammy $d$ dollars. What is $t-d$? $ \textbf{(A)}\ 15\qquad\textbf{(B)}\ 20\qquad\textbf{(C)}\ 25\qquad\textbf{(D)}\ 30\qquad\textbf{(E)}\ 35 $

Let $ABC$ a triangle inscribed in a circle $(O)$ with orthocenter $H$. Two lines $d_1$ and $d_2$ are mutually perpendicular at $H$. Let $d_1$ meet $BC,CA,AB$ at $X_1, Y_1,Z_1$ respectively. Let $A_1B_1C_1$ be a triangle formed by the line through $X_1$ perpendicular to $BC$, the line through $Y_1$ perpendicular to CA, the line through $Z_1$ perpendicular perpendicular to $AB$. Triangle $A_2B_2C_2$ is defined in the same manner. Prove that the circumcircles of triangles $A_1B_1C_1$ and $A_2B_2C_2$ touch each other at a point on $(O)$. Nguyễn Văn Linh

In his bag, Salman has a number of stones. The weight of each stone is not greater than $0.5$ kg and the total weight of the stones is not greater than $2.5$ kg. Prove that Salman can divide his stones into $4$ groups, each group has a total weight not greater than $1$ kg Trần Nam Dũng

$\boxed{N1}$ find all positive integers $n$ for which $1^3+2^3+\cdots+{16}^3+{17}^n$ is a perfect square.

In each cell of $5 \times 5$ table there is one number from $1$ to $5$ such that every number occurs exactly once in every row and in every column. Number in one column is [i]good positioned[/i] if following holds: - In every row, every number which is left from [i]good positoned[/i] number is smaller than him, and every number which is right to him is greater than him, or vice versa. - In every column, every number which is above from [i]good positoned[/i] number is smaller than him, and every number which is below to him is greater than him, or vice versa. What is maximal number of good positioned numbers that can occur in this table?

If $a$, $b$, and $c$ are positive numbers, determine the least possible value of the following expression: $\frac{1}{\frac{a}{b}+\frac{b}{c}+\frac{c}{a}}-\frac{2}{\frac{a}{c}+\frac{c}{b}+\frac{b}{a}}$.

Let $ABC$ be a triangle. The incircle of triangle $ABC$ touches the side $BC$ at $A^{\prime}$, and the line $AA^{\prime}$ meets the incircle again at a point $P$. Let the lines $CP$ and $BP$ meet the incircle of triangle $ABC$ again at $N$ and $M$, respectively. Prove that the lines $AA^{\prime}$, $BN$ and $CM$ are concurrent.

$ABCDA'B'C'D'$ is a cube (with $ABCD$ and $A'B'C'D'$ faces, and $AA', BB', CC', DD'$ edges). $L$ is a line which intersects or is parallel to the lines $AA', BC$ and $DB'$. $L$ meets the line $BC$ at $M$ (which may be the point at infinity). Let $m = |BM|$. The plane $MAA'$ meets the line $B'C'$ at $E$. Show that $|B'E| = m$. The plane $MDB'$ meets the line $A'D'$ at $F$. Show that $|D'F| = m$. Hence or otherwise show how to construct the point $P$ at the intersection of $L$ and the plane $A'B'C'D'$. Find the distance between $P$ and the line $A'B'$ and the distance between $P$ and the line $A'D'$ in terms of $m$. Find a relation between these two distances that does not depend on $m$. Find the locus of $M$. Let $S$ be the envelope of the line $L$ as $M$ varies. Find the intersection of $S$ with the faces of the cube.

a) A game is played on an infinite plane. There are fifty one pieces, one “wolf” and $50$ “sheep”. There are two players. The first commences by moving the wolf. Then the second player moves one of the sheep, the first player moves the wolf, the second player moves a sheep, and so on. The wolf and the sheep can move in any direction through a distance of up to one metre per move. Is it true that for any starting position the wolf will be able to capture at least one sheep? b) A game is played on an infinite plane. There are two players. One has a piece known as a “wolf”, while the other has $K$ pieces known as “sheep”. The first player moves the wolf, then the second player moves a sheep, the first player moves the wolf again, the second player moves a sheep, and so on. The wolf and the sheep can move in any direction, with a maximum distance of one metre per move. Is it true that for any value of $K$ there exists an initial position from which the wolf can not capture any sheep? PS. (a) was the junior version, (b) the senior one

Point $C_{1}$ of hypothenuse $AC$ of a right-angled triangle $ABC$ is such that $BC = CC_{1}$. Point $C_{2}$ on cathetus $AB$ is such that $AC_{2} = AC_{1}$; point $A_{2}$ is defined similarly. Find angle $AMC$, where $M$ is the midpoint of $A_{2}C_{2}$.

Integers $1 \le n \le 200$ are written on a blackboard just one by one. We surrounded just $100$ integers with circle. We call a square of the sum of surrounded integers minus the sum of not surrounded integers $score$ of this situation. Calculate the average score in all ways.

Find all pairs of positive integers $(a,b)$ such that $\sqrt{a-1}+\sqrt{b-1}=\sqrt{ab-1}.$

A triangle is given, all the angles of which are smaller than $\phi$, where $\phi <2\pi / 3$. Prove that in space there is a point from which all sides of the triangle are visible at an angle $\phi$.

In any finite grid of squares, some shaded and some not, for each unshaded square, record the number of shaded squares horizontally or vertically adjacent to it; this grid's [i]score[/i] is the sum of all numbers recorded this way. Deyuan shades each square in a blank $n\times n$ grid with probability $k$; he notices that the expected value of the score of the resulting grid is equal to $k$, too! Given that $k > 0.9999$, find the minimum possible value of $n$. [i]Proposed by Andrew Wu[/i]

Let $u_{jk}$ be a real number for each $j=1,2,3$ and each $k=1,2$ and let $N$ be an integer such that \[\max_{1\le k \le 2} \sum_{j=1}^3 |u_{jk}| \leq N\] Let $M$ and $l$ be positive integers such that $l^2 <(M+1)^3$. Prove that there exist integers $\xi_1,\xi_2,\xi_3$ not all zero, such that \[\max_{1\le j \le 3}\xi_j \le M\ \ \ \ \text{and} \ \ \ \left|\sum_{j=1}^3 u_{jk}\xi_k\right| \le \frac{MN}{l} \ \ \ \ \text{for k=1,2}\]

Consider the segment $[0; 1]$. At each step we may split one of the available segments into two new segments and write the product of lengths of these two new segments onto a blackboard. Prove that the sum of the numbers on the blackboard never will exceed $1/2$. [i]Mikhail Lukin[/i]

Kristoff is planning to transport a number of indivisible ice blocks with positive integer weights from the north mountain to Arendelle. He knows that when he reaches Arendelle, Princess Anna and Queen Elsa will name an ordered pair $(p,q)$ of nonnegative integers satisfying $p + q \le 2016$. Kristoff must then give Princess Anna \emph{exactly} $p$ kilograms of ice. Afterward, he must give Queen Elsa $\emph{exactly}$ $q$ kilograms of ice. What is the minimum number of blocks of ice Kristoff must carry to guarantee that he can always meet Anna and Elsa's demands, regardless of which $p$ and $q$ are chosen?

Let $n$ be a positive integer. Find the number of permutations $a_1$, $a_2$, $\dots a_n$ of the sequence $1$, $2$, $\dots$ , $n$ satisfying $$a_1 \le 2a_2\le 3a_3 \le \dots \le na_n$$. Proposed by United Kingdom

Find all functions $u : R \to R$ for which there is a strictly increasing function $f : R \to R$ such that $f(x+y) = f(x)u(y)+ f(y)$ for all $x,y \in R$.

Let $A$ be the set of positive integers of the form $a^2 +2b^2$, where $a$ and $b$ are integers and $b \neq 0$. Show that if $p$ is a prime number and $p^2 \in A$, then $p \in A$.

Compute the smallest positive integer such that, no matter how you rearrange its digits (in base ten), the resulting number is a multiple of $63.$

There are There are $64$ towns in a country, and some pairs of towns are connected by roads but we do not know these pairs. We may choose any pair of towns and find out whether they are connected by a road. Our aim is to determine whether it is possible to travel between any two towns using roads. Prove that there is no algorithm which would enable us to do this in less than $2016$ questions. but we do not know these pairs. We may choose any pair of towns and find out whether they are connected by a road. Our aim is to determine whether it is possible to travel between any two towns using roads. Prove that there is no algorithm which would enable us to do this in less than $2016$ questions.

Let $z = \cos \frac{2\pi}{2011} + i\sin \frac{2\pi}{2011}$, and let \[ P(x) = x^{2008} + 3x^{2007} + 6x^{2006} + \cdots + \frac{2008 \cdot 2009}{2} x + \frac{2009 \cdot 2010}{2} \] for all complex numbers $x$. Evaluate $P(z)P(z^2)P(z^3) \cdots P(z^{2010})$.

Let $m, k$, and $c$ be positive integers with $k > c$, and let $\lambda$ be a positive, non-integer real root of the equation $\lambda^{m+1} - k \lambda^m - c = 0$. Let $f : Z^+ \to Z$ be defined by $f(n) = \lfloor \lambda n \rfloor$ for all $n \in Z^+$. Show that $f^{m+1}(n) \equiv cn - 1$ (mod $k$) for all $n \in Z^+$. (Here, $Z^+$ denotes the set of positive integers, $ \lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$, and $f^{m+1}(n) = f(f(... f(n)...))$ where $f$ appears $m + 1$ times.)