Let $ABCD$ be a cyclic quadrilateral, and suppose that $BC = CD = 2$. Let $I$ be the incenter of triangle $ABD$. If $AI = 2$ as well, find the minimum value of the length of diagonal $BD$.

Let $K$ be a convex planar set, symmetric about a point $O$, and let $X, Y , Z$ be three points in $K$. Show that $K$ contains the head of one of the vectors $\overrightarrow{OX} \pm \overrightarrow{OY} , \overrightarrow{OX} \pm \overrightarrow{OZ}, \overrightarrow{OY} \pm \overrightarrow{OZ}$.

Given the polynomial $ P(x) = \frac{1}{2} - \frac{1}{3}x + \frac{1}{6}x^2 $. Let $ Q(x) = \sum_{k=0}^{m} b_k x^k $ be a polynomial given by $$ Q(x) = P(x) \cdot P(x^3) \cdot P(x^9) \cdot P(x^{27}) \cdot P(x^{81}). $$ Calculate $ \sum_{k=0}^m |b_k| $.

Let $ABC$ be an acute triangle with orthocenter $ H $ and $AB<AC.$ Let $\Omega_1$ be a circle with diameter $AC$ and $\Omega_2$ a circle with diameter $ AB.$ Line $BH$ intersects $\Omega_1$ in points $ D $ and $E$ such that $E$ is not on segment $BH.$ Line $ CH $ intersects $\Omega_2$ in points $ F $ and $G$ such that $G$ is not on segment $CH.$ Prove that the lines $EG, DF$ and $BC$ are concurrent.

Find all positive integers $k$ that can be expressed as the sum of $50$ fractions such that the numerators are the $50$ natural numbers from $1$ to $50$ and the denominators are positive integers, that is, $k = \dfrac{1}{a_1} + \dfrac{2}{a_2} + \ldots + \dfrac{50}{a_{50}}$ with a$_1 , a_2 , \ldots , a_n$ positive integers.

In the acute triangle $ABC$, with $AB \ne BC$, let $T$ denote the midpoint of the side $[AC], A_1$ and $C_1$ denote the feet of the altitudes drawn from $A$ and $C$, respectively. Let $Z$ be the intersection point of the tangents in $A$ and $C $ to the circumcircle of triangle $ABC, X$ be the intersection point of lines $ZA$ and $A_1C_1$ and $Y$ be the intersection point of lines $ZC$ and $A_1C_1$. a) Prove that $T$ is the incircle of triangle $XYZ$. b) The circumcircles of triangles $ABC$ and $A_1BC_1$ meet again at $D$. Prove that the orthocenter $H$ of triangle $ABC$ is on the line $TD$. c) Prove that the point $D$ lies on the circumcircle of triangle $XYZ$.

A regular heptagon $ABCDEFG$ is given. The lines $AB$ and $CE$ intersect at $ P$. Find the measure of the angle $\angle PDG$.

$ a)$ Two players play a cooperative game. They can discuss a strategy prior to the game, however, they cannot communicate and have no information about the other player during the game. The game master chooses one of the players in each round. The player on turn has to guess the number of the current round. Players keep note of the number of rounds they were chosen, however, they have no information about the other player's rounds. If the player's guess is correct, the players are awarded a point. Player's are not notified whether they've scored or not. The players win the game upon collecting 100 points. Does there exist a strategy with which they can surely win the game in a finite number of rounds? $b)$ How does this game change, if in each round the player on turn has two guesses instead of one, and they are awarded a point if one of the guesses is correct (while keeping all the other rules of the game the same)? [i]Proposed by Gábor Szűcs, Budapest[/i]

Given a $\triangle ABC$ with its area equal to $1$, suppose that the vertices of quadrilateral $P_1P_2P_3P_4$ all lie on the sides of $\triangle ABC$. Show that among the four triangles $\triangle P_1P_2P_3, \triangle P_1P_2P_4, \triangle P_1P_3P_4, \triangle P_2P_3P_4$ there is at least one whose area is not larger than $1/4$.

Determine all pairs $(a, b)$ of integers for which $a^{2}+b^{2}+3$ is divisible by $ab$.

Let $G$ be a connected graph, with degree of all vertices not less then $m \geq 3$, such that there is no path through all vertices of $G$ being in every vertex exactly once. Find the least possible number of vertices of $G.$

The workers laid a floor of size $n \times n$ with tiles of two types: $2 \times 2$ and $3 \times 1$. It turned out that they were able to completely lay the floor in such a way that the same number of tiles of each type was used. Under what conditions could this happen? (You can’t cut tiles and also put them on top of each other.)

Consider the $10$-digit number $M=9876543210$. We obtain a new $10$-digit number from $M$ according to the following rule: we can choose one or more disjoint pairs of adjacent digits in $M$ and interchange the digits in these chosen pairs, keeping the remaining digits in their own places. For example, from $M=9\underline{87}6 \underline{54} 3210$ by interchanging the $2$ underlined pairs, and keeping the others in their places, we get $M_{1}=9786453210$. Note that any number of (disjoint) pairs can be interchanged. Find the number of new numbers that can be so obtained from $M$.

Prove: In an acute triangle $ ABC$ angle bisector $ w_{\alpha},$ median $ s_b$ and the altitude $ h_c$ intersect in one point if $ w_{\alpha},$ side $ BC$ and the circle around foot of the altitude $ h_c$ have vertex $ A$ as a common point.

On semicircle, with diameter $|AB|=d$, are given points $C$ and $D$ such that: $|BC|=|CD|=a$ and $|DA|=b$ where $a, b, d$ are different positive integers. Find minimum possible value of $d$

A rectangle is tiled with rectangles of size $6\times 1$. Prove that one of its side lengths is divisible by $6$.

Let $p>5$ be a prime. Suppose that there exist integer $k$ such that $ k^2 + 5 $ is divisible by $p$. Prove that there exist two positive integers $m,n$ satisfying $ p^2 = m^2 + 5n^2 $.

Let $s_1,s_2,s_3,s_4,...$ be a sequence (infinite list) of $1$s and $0$s. For example $1,0,1,0,1,0,...$, that is, $s_n=1$ if $n$ is odd and $s_n=0$ if $n$ is even, is such a sequence. Prove that it is possible to delete infinitely many terms in $s_1,s_2,s_3,s_4,...$ so that the resulting sequence is the original sequence. For the given example, one can delete $s_3,s_4,s_7,s_8,s_{11},s_{12},...$

There are 2000 cities in the country. Every city is connected by non-stop two-way airlines with some other cities, and for each city, the number of airlines originating from it is a factor of two. (i.e. $1$, $2$, $4$, $8$, $...$). For each city $A$, the statistician calculated the number routes with no more than one transfer connecting $A$ with other cities, and then summed up the results for all $2000$ cities. He got $100,000$. Prove that the statistician was wrong.

Prove that the sum of the plane angles at each of the vertices of a given tetrahedron is $ 180^{\circ} $ if and only if all its faces are congruent.

Let be two $ 2\times 2 $ real matrices $ A,B, $ such that $ AB=\begin{pmatrix} 1&1\\1&2 \end{pmatrix} . $ Calculate $ \left((BA)^{-1} +BA\right)^{2019 } . $ [i]Dan Nedeianu[/i]

$a, b$ are two fixed lines through $O$. Variable lines $x, y$ are parallel. $x$ intersects a at $A$ and $b$ at $C$, $y$ intersects $a$ at $B$ and $b$at $D$. The lines $AD$ and $BC$ meet at $M$. The line through $M$ parallel to $x$ meets $a$ at $L$ and $b$ at $N$. What can you say about $L, M, N$? Find the locus $M$.

In triangle $ABC$ there are points $D\in(AC)$ and $F\in(AB)$ such that $AD=AB$ and line $BC$ splits the segment $[CF]$ in half. Prove that $BF=CD$.

Let $f: \ [0,\ 1] \rightarrow \mathbb{R}$ be an increasing function satisfying the following conditions: a) $f(0)=0$; b) $f\left(\frac{x}{3}\right)=\frac{f(x)}{2}$; c) $f(1-x)=1-f(x)$. Determine $f\left(\frac{18}{1991}\right)$.

Let $n \in \mathbb{N}^+,$ $x_1,x_2,...,x_{n+1},p,q\in \mathbb{R}^+ $ , $p<q$ and $x^p_{n+1}>\sum_{i=1}^{n}x^p_{i}.$ Prove that $(1)x^q_{n+1}>\sum_{i=1}^{n}x^q_{i};$ $(2)\left(x^p_{n+1}-\sum_{i=1}^{n}x^p_{i}\right)^{\frac{1}{p}}<\left(x^q_{n+1}-\sum_{i=1}^{n}x^q_{i}\right)^{\frac{1}{q}}.$