The triangle $ABC$ has angle $A = 30^o$ and $AB = \frac{3}{4} AC$. Find the point $P$ inside the triangle which minimizes $5 PA + 4 PB + 3 PC$.

(a) On each square of a squared sheet of paper of size $20 \times 20$ there is a soldier. Vanya chooses a number $d$ and Petya moves the soldiers to new squares in such a way that each soldier is moved through a distance of at least $d$ (the distance being measured between the centres of the initial and the new squares) and each square is occupied by exactly one soldier. For which $d$ is this possible? (Give the maximum possible $d$, prove that it is possible to move the soldiers through distances not less than $d$ and prove that there is no greater $d$ for which this procedure may be carried out.) (b) Answer the same question as (a), but with a sheet of size $21 \times 21$. (SS Krotov, Moscow)

An ant, which is on an edge of a cube of side $8$, must travel on the surface and return to the starting point. It's path must contain interior points of the six faces of the cube and should visit only once each face of the cube. Find the length of the path that the ant can carry out and justify why it is the shortest path.

Let $a, b$ be two real numbers that satisfy $a^3 + b^3 = 8-6ab$. Find the maximum value and the minimum value that $a + b$ can take.

The three sides and the area of a triangle are integers. What is the smallest value of the area of this triangle?

Consider all sets $A$ of one hundred different natural numbers with the property that any three elements $a,b,c \in A$ (not necessarily different) are the sides of a non-obtuse triangle. Denote by $S(A)$ the sum of the perimeters of all such triangles. Compute the smallest possible value of $S(A)$.

For any set of points $A_1, A_2,...,A_n$ on the plane, one defines $r( A_1, A_2,...,A_n)$ as the radius of the smallest circle that contains all of these points. Prove that if $n \ge 3$, there are indices $i,j,k$ such that $r( A_1, A_2,...,A_n)=r( A_i, A_j,A_k)$

What is the smallest $n$ for which there is a solution to $$\begin{cases} \sin x_1 + \sin x_2 + ... + \sin x_n = 0 \\ \sin x_1 + 2 \sin x_2 + ... + n \sin x_n = 100 \end{cases}$$ ?

In a country with $n$ towns, all the direct flights are of double destinations (back and forth). There are $r>2014$ rootes between different pairs of towns, that include no more than one intermediate stop (direction of each root matters). Find the minimum possible value of $n$ and the minimum possible $r$ for that value of $n$.

For each positive integer $n$, let $S(n)$ be the sum of the digits of $n$. Determines the smallest positive integer $a$ such that there are infinite positive integers $n$ for which you have $S (n) -S (n + a) = 2018$.

$ABC$ is a triangle with $\angle A = 90^o$. For a point $D$ on the side $BC$, the feet of the perpendiculars to $AB$ and $AC$ are $E$ and$ F$. For which point $D$ is $ EF$ a minimum?

Points $A_1,A_2,...,A_n$ are selected from the equilateral triangle with a side that is equal to $1$. Denote by $d_k$ the least distance from $A_k$ to all other selected points. Prove that $d_1^2+...+d_n^2 \le 3,5$.

Consider sequences $a_1, a_2, a_3,...$ of positive integers. Determine the smallest possible value of $a_{2010}$ if (i) $a_n < a_{n+1}$ for all $n\ge 1$, (ii) $a_i + a_l > a_j + a_k$ for all quadruples $ (i, j, k, l)$ which satisfy $1 \le i < j \le k < l$.

Into an angle $A$ of size $a$, a circle is inscribed tangent to its sides at points $B$ and $C$. A line tangent to this circle at a point M meets the segments $AB$ and $AC$ at points $P$ and $Q$ respectively. What is the minimum $a$ such that the inequality $S_{PAQ}<S_{BMC}$ is possible?

Let $ABC$ be an acute triangle. A line, parallel to $BC$, intersects sides $AB$ and $AC$ at points $M$ and $P$, respectively. At which placement of points $M$ and $P$, is the radius of the circumcircle of the triangle $BMP$ is the smallest?

Let $a$ and $b$ be positive whole numbers such that $\frac{4.5}{11}<\frac{a}{b}<\frac{5}{11}$. Find the fraction $\frac{a}{b}$ for which the sum $a+b$ is as small as possible. Justify your answer

Let $x_1, x_2, ..., x_n$ be positive reals with sum $1$. Show that $$\frac{x_1^2}{x_1 + x_2}+ \frac{x_2^2}{x_2 + x_3} +... + \frac{x_{n-1}^2}{x_{n-1} + x_n} + \frac{x_n^2}{x_n + x_1} \ge \frac12$$

An infinite squared sheet is given, with squares of side length $1$. The “distance” between two squares is defined as the length of the shortest path from one of these squares to the other if moving between them like a chess rook (measured along the trajectory of the centre of the rook). Determine the minimum number of colours with which it is possible to colour the sheet (each square being given a single colour) in such a way that each pair of squares with distance between them equal to $6$ units is given different colours. Give an example of such a colouring and prove that using a smaller number of colours we cannot achieve this goal. (AG Pechkovskiy, IV Itenberg)

Let $a, b, c$ be the side-lengths of triangle $ABC$ with $a+b+c = 12$. Determine the smallest value of $M =\frac{a}{b + c - a}+\frac{4b}{c + a - b}+\frac{9c}{a + b - c}$.

Write $2013$ as a sum of $m$ prime numbers. The smallest value of $m$ is: (A): $2$, (B): $3$, (C): $4$, (D): $1$, (E): None of the above.

In a unit cube, $CG$ is the edge perpendicular to the face $ABCD$. Let $O_1$ be the incircle of square $ABCD$ and $O_2$ be the circumcircle of triangle $BDG$. Determine min$\{XY|X\in O_1,Y\in O_2\}$.

A triangle $ABC$ is inscribed in a circle $G$. For any point $M$ inside the triangle, $A_1$ denotes the intersection of the ray $AM$ with $G$. Find the locus of point $M$ for which $\frac{BM\cdot CM}{MA_1}$ is minimal, and find this minimum value.

Let $n$ be a natural number. Determine the minimal number of equilateral triangles of side $1$ to cover the surface of an equilateral triangle of side $n +\frac{1}{2n}$.

Let Akbar and Birbal together have $n$ marbles, where $n > 0$. Akbar says to Birbal, “ If I give you some marbles then you will have twice as many marbles as I will have.” Birbal says to Akbar, “ If I give you some marbles then you will have thrice as many marbles as I will have.” What is the minimum possible value of $n$ for which the above statements are true?

Find the minimum value of $S = |x + 1| + |x + 5|+ |x + 14| + |x + 97| + |x + 1920|$.