On the sides $BC,CA$ and $AB$ of a triangle $ABC$ of area $S$ are taken points $A' ,B' ,C'$ respectively such that $AC' /AB = BA' /BC = CB' /CA = p$, where $0 < p < 1$ is variable. (a) Find the area of triangle $A' B' C'$ in terms of $ p$. (b) Find the value of $p$ which minimizes this area. (c) Find the locus of the intersection point $P$ of the lines through $A' $ and $C'$ parallel to $AB$ and $AC$ respectively.

Find minimum of $x+y+z$ where $x$, $y$ and $z$ are real numbers such that $x \geq 4$, $y \geq 5$, $z \geq 6$ and $x^2+y^2+z^2 \geq 90$

Let $a$ and $b$ be natural numbers such that $2a-b$, $a-2b$ and $a+b$ are all distinct squares. What is the smallest possible value of $b$ ?

What is the least positive integer $k$ such that, in every convex $101$-gon, the sum of any $k$ diagonals is greater than or equal to the sum of the remaining diagonals?

Let $P$ be an interior point of triangle $ABC$. Let $a,b,c$ be the sidelengths of triangle $ABC$ and let $p$ be it's semiperimeter. Find the maximum possible value of $$ \min\left(\frac{PA}{p-a},\frac{PB}{p-b},\frac{PC}{p-c}\right)$$ taking into consideration all possible choices of triangle $ABC$ and of point $P$. by Elton Bojaxhiu, Albania

A class has $25$ students. The teacher wants to stock $N$ candies, hold the Olympics and give away all $N$ candies for success in it (those who solve equally tasks should get equally, those who solve less get less, including, possibly, zero candies). At what smallest $N$ this will be possible, regardless of the number of tasks on Olympiad and the student successes?

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

Given regular pentagon $ABCDE$. $M$ is an arbitrary point inside $ABCDE$ or on its side. Let the distances $|MA|, |MB|, ... , |ME|$ be renumerated and denoted with $$r_1\le r_2\le r_3\le r_4\le r_5.$$ Find all the positions of the $M$, giving $r_3$ the minimal possible value. Find all the positions of the $M$, giving $r_3$ the maximal possible value.

Let $n$ be a fixed positive integer and let $x, y$ be positive integers such that $xy = nx+ny$. Determine the minimum and the maximum of $x$ in terms of $n$.

Given real $a$. Find the least possible area of the rectangle with the sides parallel to the coordinate axes and containing the figure determined by the system of inequalities $$y \le -x^2 \,\,\, and \,\,\, y \ge x^2 - 2x + a$$

Show that $1 \le n^{1/n} \le 2$ for all positive integers $n$. Find the smallest $k$ such that $1 \le n ^{1/n} \le k$ for all positive integers $n$.

$X$ is a set with $100$ members. What is the smallest number of subsets of $X$ such that every pair of elements belongs to at least one subset and no subset has more than $50$ members? What is the smallest number if we also require that the union of any two subsets has at most $80$ members?

(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)

The point $M$ belongs to the side $[AC]$ of the acute-angle triangle $ABC$. Two circles are circumscribed around triangles $ABM$ and $BCM$ . What $M$ position corresponds to the minimal area of those circles intersection?

The natural numbers $x_1$ and $x_2$ are less than $1000$. We construct a sequence: $$x_3 = |x_1 - x_2|$$ $$x_4 = min \{ |x_1 - x_2|, |x_1 - x_3|, |x_2 - x_3|\}$$ $$...$$ $$x_k = min \{ |x_i - x_j|, 0 <i < j < k\}$$ $$...$$ Prove that $x_{21} = 0$.

Mary and Pat play the following number game. Mary picks an initial integer greater than $2017$. She then multiplies this number by $2017$ and adds $2$ to the result. Pat will add $2019$ to this new number and it will again be Mary’s turn. Both players will continue to take alternating turns. Mary will always multiply the current number by $2017$ and add $2$ to the result when it is her turn. Pat will always add $2019$ to the current number when it is his turn. Pat wins if any of the numbers obtained by either player is divisible by $2018$. Mary wants to prevent Pat from winning the game. Determine, with proof, the smallest initial integer Mary could choose in order to achieve this.

The positive numbers $a, b, c,d,e$ are such that the following identity hold for all real number $x$: $(x + a)(x + b)(x + c) = x^3 + 3dx^2 + 3x + e^3$. Find the smallest value of $d$.

Prove that among all triangles with inradius $1$, the equilateral one has the smallest perimeter .

Arnaldo and Bernardo play a Super Naval Battle. Each has a board $n \times n$. Arnaldo puts boats on his board (at least one but not known how many). Each boat occupies the $n$ houses of a line or a column and the boats they can not overlap or have a common side. Bernardo marks $m$ houses (representing shots) on your board. After Bernardo marked the houses, Arnaldo says which of them correspond to positions occupied by ships. Bernardo wins, and then discovers the positions of all Arnaldo's boats. Determine the lowest value of $m$ for which Bernardo can guarantee his victory.

You are traveling in a foreign country whose currency consists of five different-looking kinds of coins. You have several of each coin in your pocket. You remember that the coins are worth $1, 2, 5, 10$, and $20$ florins, but you have no idea which coin is which and you don’t speak the local language. You find a vending machine where a single candy can be bought for $1$ florin: you insert any kind of coin, and receive $1$ candy plus any change owed. You can only buy one candy at a time, but you can buy as many as you want, one after the other. What is the least number of candies that you must buy to ensure that you can determine the values of all the coins? Prove that your answer is correct.

A switch has two inputs $1, 2$ and two outputs $1, 2$. It either connects $1$ to $1$ and $2$ to $2$, or $1$ to $2$ and $2$ to 1. If you have three inputs $1, 2, 3$ and three outputs $1, 2, 3$, then you can use three switches, the first across $1$ and $2$, then the second across $2$ and $3$, and finally the third across $1$ and $2$. It is easy to check that this allows the output to be any permutation of the inputs and that at least three switches are required to achieve this. What is the minimum number of switches required for $4$ inputs, so that by suitably setting the switches the output can be any permutation of the inputs?

Let $m,n$ be positive integers with $1 \le n < m$. A box is locked with several padlocks which must all be opened to open the box, and which all have different keys. The keys are distributed among $m$ people. Suppose that among these people, no $n$ can open the box, but any $n+1$ can open it. Find the smallest possible number $l$ of locks and then the total number of keys for which this is possible.

Let $a, b, c$ be side lengths of a right triangle. Determine the minimum possible value of $\frac{a^3 + b^3 + c^3}{abc}$.

A unit square has a circle of radius $r$ with center at it's midpoint. The four quarter circles are centered on the vertices of the square and are tangent to the central circle (see figure). Find the maximum and minimum possible value of the area of the striped figure in the figure and the corresponding values of $r$ such these, the maximum and minimum are achieved. [img]https://2.bp.blogspot.com/-DOT4_B5Mx-8/XnmsTlWYfyI/AAAAAAAALgs/TVYkrhqHYGAeG8eFuqFxGDCTnogVbQFUwCK4BGAYYCw/s400/96%2Bestonia%2Bopen%2Bs1.4.png[/img]

What is the smallest possible natural number $n$ for which the equation $x^2 -nx + 2014 = 0$ has integer roots?