Let $ABC$ be an acute triangle with the perimeter of $2s$. We are given three pairwise disjoint circles with pairwise disjoint interiors with the centers $A, B$, and $C$, respectively. Prove that there exists a circle with the radius of $s$ which contains all the three circles. [i]Proposed by Josef Tkadlec, Czechia[/i]

Let $A_1, A_2,\dots,A_m\in \mathcal{M}_n(\mathbb{R})$. Prove that there exist $\varepsilon_1,\varepsilon_2,\dots,\varepsilon_m\in \{-1,1\}$ such that: $$\rm{tr}\left( (\varepsilon_1 A_1+\varepsilon_2A_2+\dots+\varepsilon_m A_m)^2\right)\geq \rm{tr}(A_1^2)+\rm{tr}(A_2^2)+\dots+\rm{tr}(A_m^2) $$

Let $A$ be a set consisting of 6 points in the plane. denoted $n(A)$ as the number of the unit circles which meet at least three points of $A$. Find the maximum of $n(A)$

A circle of radius $5$ is inscribed in an isosceles right triangle, $ABC$. The length of the hypotenuse of $ABC$ can be expressed as $a+a\sqrt{2}$ for some $a$. What is $a$?

A table with $m$ rows and $n$ columns is given. At any move one chooses some empty cells such that any two of them lie in different rows and columns, puts a white piece in any of those cells and then puts a black piece in the cells whose rows and columns contain white pieces. The game is over if it is not possible to make a move. Find the maximum possible number of white pieces that can be put on the table.

Solve over non-negative integers the system $$ \begin{cases} x+y+z^2=xyz, \\ z\leq min(x,y). \end{cases} $$

Prove that, for all $n \in \mathbb{N}$ \begin{align*} \frac{1}{1}+\frac{1}{3}+\frac{1}{5}+\ldots+\frac{1}{2n+1} \not\in \mathbb{Z} \end{align*}

Consider all possible functions defined for $x = 1, 2, ..., M$ and taking values $​​y = 1, 2, ..., n$. We denote the set of such functions by $T.$ By $T_0$ we denote the subset of $T$ consisting of functions whose value changes exactly by $ 1$ (in one direction or another) when the argument changes by $1$. Prove that if $M\ge 2n-4$, then among the functions from of the set $T$, there is a function that coincides at least at one point with any function from $T_0$. Specify at least one such function. Prove that if $M <2n-4$, then there is no such function.

Let a [i]triplet [/i] be some set of three distinct pairwise parallel lines. $20$ triplets are drawn on a plane. Find the maximum number of regions these $60$ lines can divide the plane into.

Consider an $m$-by-$n$ grid of unit squares, indexed by $(i, j)$ with $1 \leq i \leq m$ and $1 \leq j \leq n$. There are $(m-1)(n-1)$ coins, which are initially placed in the squares $(i, j)$ with $1 \leq i \leq m-1$ and $1 \leq j \leq n-1$. If a coin occupies the square $(i, j)$ with $i \leq m-1$ and $j \leq n-1$ and the squares $(i+1, j),(i, j+1)$, and $(i+1, j+1)$ are unoccupied, then a legal move is to slide the coin from $(i, j)$ to $(i+1, j+1)$. How many distinct configurations of coins can be reached starting from the initial configuration by a (possibly empty) sequence of legal moves?

Suppose that $1985$ points are given inside a unit cube. Show that one can always choose $32$ of them in such a way that every (possibly degenerate) closed polygon with these points as vertices has a total length of less than $8 \sqrt 3.$

Let $ABC$ be an equilateral triangle. For a point $M$ inside $\vartriangle ABC$, let $D,E,F$ be the feet of the perpendiculars from $M$ onto $BC,CA,AB$, respectively. Find the locus of all such points $M$ for which $\angle FDE$ is a right angle.

The base of a prism is an $n$-gon. We wish to colour its $2n$ vertices in three colours in such a way that every vertex is connected by edges to vertices of all three colours. (a) Prove that if $n$ is divisible by $3$, then the task is possible. {b) Prove that if the task is possible, then $n$ is divisible by $3$. (A Shapovalov)

Find minimal number of divisors that can number $|2016^m-36^n|$ have,where $m$ and $n$ are natural numbers.

Let $A_1A_2 \ldots A_n$ be a convex polygon. Point $P$ inside this polygon is chosen so that its projections $P_1, \ldots , P_n$ onto lines $A_1A_2, \ldots , A_nA_1$ respectively lie on the sides of the polygon. Prove that for arbitrary points $X_1, \ldots , X_n$ on sides $A_1A_2, \ldots , A_nA_1$ respectively, \[\max \left\{ \frac{X_1X_2}{P_1P_2}, \ldots, \frac{X_nX_1}{P_nP_1} \right\} \geq 1.\] [i]Proposed by Nairi Sedrakyan, Armenia[/i]

Let $k,m,n$ be positive integers such that $k > n > 1$ and $(k,n) = 1$. If $k-n | k^m - n^{m-1}$, prove that $k \le 2n - 1$.

Let $ \mathcal{H} \equal{} A_1A_2\ldots A_n$ be a convex $ n$-gon. For $ i \equal{} 1, 2, \ldots, n$, let $ A'_{i}$ be the point symmetric to $ A_i$ with respect to the midpoint of $ A_{i \minus{} 1}A_{i \plus{} 1}$ (where $ A_{n \plus{} 1} \equal{} A_1$). We say that the vertex $ A_i$ is [i]good[/i] if $ A'_{i}$ lies inside $ \mathcal{H}$. Show that at least $ n \minus{} 3$ vertices of $ \mathcal{H}$ are [i]good[/i].

A right-angled triangle has property that, when a square is drawn externally on each side of the triangle, the six vertices of the squares that are not vertices of the triangle are concyclic. Assume that the area of the triangle is $9$ cm$^2$. Determine the length of sides of the triangle.

In an acute triangle $ABC$ the points $D,E$ and $F$ are the feet of the altitudes through $A,B$ and $C$ respectively. The incenters of the triangles $AEF$ and $BDF$ are $I_1$ and $I_2$ respectively; the circumcenters of the triangles $ACI_1$ and $BCI_2$ are $O_1$ and $O_2$ respectively. Prove that $I_1I_2$ and $O_1O_2$ are parallel.

Let $a$, $b$, $c$ be positive real numbers such that $\min(ab,bc,ca) \ge 1$. Prove that $$\sqrt[3]{(a^2+1)(b^2+1)(c^2+1)} \le \left(\frac{a+b+c}{3}\right)^2 + 1.$$ [i]Proposed by Tigran Margaryan, Armenia[/i]

Let $b$, $c$ be integers and $f(x) = x^2 + bx + c$ be a trinomial. Prove, that if for integers $k_1$, $k_2$ and $k_3$ values of $f(k_1)$, $f(k_2)$ and $f(k_3)$ are divisible by integer $n \neq 0$, then product $(k_1 - k_2)(k_2 - k_3)(k_3 - k_1)$ is divisible by $n$ too.

Let set $S$ contain all positive integers that are one less than a perfect square. Find the sum of all powers of $2$ that can be expressed as the product of two (not necessarily distinct) members of $S.$ [i]Proposed by Alex Li[/i]

The numbers $ 1, 2,\ldots, 50 $ are written on a blackboard. Each minute any two numbers are erased and their positive difference is written instead. At the end one number remains. Which values can take this number?

Let $ABCDE$ be a convex pentagon such that $BC \parallel AE,$ $AB = BC + AE,$ and $\angle ABC = \angle CDE.$ Let $M$ be the midpoint of $CE,$ and let $O$ be the circumcenter of triangle $BCD.$ Given that $\angle DMO = 90^{\circ},$ prove that $2 \angle BDA = \angle CDE.$ [i]Proposed by Nazar Serdyuk, Ukraine[/i]

[i]The following problem is open in the sense that the answer to part (b) is not currently known. A proof of part (a) will be awarded 5 points. Up to 7 additional points may be awarded for progress on part (b).[/i] Let $p(x)$ be a polynomial of degree $d$ with coefficients belonging to the set of rational numbers $\mathbb{Q}$. Suppose that, for each $1 \le k \le d-1$, $p(x)$ and its $k$th derivative $p^{(k)}(x)$ have a common root in $\mathbb{Q}$; that is, there exists $r_k \in \mathbb{Q}$ such that $p(r_k) = p^{(k)}(r_k) = 0$. (a) Prove that if $d$ is prime then there exist constants $a, b, c \in \mathbb{Q}$ such that \[ p(x) = c(ax + b)^d. \] (b) For which integers $d \ge 2$ does the conclusion of part (a) hold?