Let $N$ be the midpoint of arc $ABC$ of the circumcircle of $\Delta ABC$, and $NP$, $NT$ be the tangents to the incircle of this triangle. The lines $BP$ and $BT$ meet the circumcircle for the second time at points $P_1$ and $T_1$ respectively. Prove that $PP_1 = TT_1$.

Prove that for all positive real numbers $a$ and $ b$: $$\frac{(a + b)^3}{4} \ge a^2b + ab^2$$

Let $ABC$ be, with $AC>AB$, an acute-angled triangle with circumcircle $\Gamma$ and $M$ the midpoint of side $BC$. Let $N$ be a point in the interior of $\bigtriangleup ABC$. Let $D$ and $E$ be the feet of the perpendiculars from $N$ to $AB$ and $AC$, respectively. Suppose that $DE\perp AM$. The circumcircle of $\bigtriangleup ADE$ meets $\Gamma$ at $L$ ($L\neq A$), lines $AL$ and $DE$ intersects at $K$ and line $AN$ meets $\Gamma$ at $F$ ($F\neq A$). Prove that if $N$ is the midpoint of the segment $AF$ then $KA=KF$.

The points $K$ and $L$ on the side $BC$ of a triangle $\triangle{ABC}$ are such that $\widehat{BAK}=\widehat{CAL}=90^\circ$. Prove that the midpoint of the altitude drawn from $A$, the midpoint of $KL$ and the circumcentre of $\triangle{ABC}$ are collinear. [i](A. Akopyan, S. Boev, P. Kozhevnikov)[/i]

Two players take turns writing on the board in a row from left to right arbitrary numbers. The player loses, after whose move one or more several digits written in a row form a number divisible by $11$. Which player will win if played correctly?

On the squares $a1, a2,... , a8$ of a chessboard there are respectively $2^0, 2^1, ..., 2^7$ grains of oat, on the squares $b8, b7,..., b1$ respectively $2^8, 2^9, ..., 2^{15}$ grains of oat, on the squares $c1, c2,..., c8$ respectively $2^{16}, 2^{17}, ..., 2^{23}$ grains of oat etc. (so there are $2^{63}$ grains of oat on the square $h1$). A knight starts moving from some square and eats after each move all the grains of oat on the square to which it had jumped, but immediately after the knight leaves the square the same number of grains of oat reappear. With the last move the knight arrives to the same square from which it started moving. Prove that the number of grains of oat eaten by the knight is divisible by $3$.

Let $k$ be a given integer, $3 < k \leq n$. Consider a graph $G$ with $n$ vertices satisfying the condition: for any two non-adjacent vertices $x$ and $y$ in graph $G$, the sum of their degrees must satisfy $d(x) + d(y) \geq k$. Please answer the following questions and prove your conclusions. (1) Suppose the length of the longest path in graph $G$ is $l$ satisfying the inequality $3 \leq l < k$, does graph $G$ necessarily contain a cycle of length $l+1$? (The length of a path or cycle refers to the number of edges that make up the path or cycle.) (2) For the case where $3 < k \leq n-1$ and graph $G$ is connected, can we determine that the length of the longest path in graph $G$, $l \geq k$? (3) For the case where $3 < k = n-1$, is it necessary for graph $G$ to have a path of length $n-1$ (i.e., a Hamiltonian path)?

The smallest three positive proper divisors of an integer n are $d_1 < d_2 < d_3$ and they satisfy $d_1 + d_2 + d_3 = 57$. Find the sum of the possible values of $d_2$.

Let $k$ be a positive integer and $a_1, a_2,$ $\cdot \cdot \cdot$ $, a_k$ digits. Prove that there exists a positive integer $n$ such that the last $2k$ digits of $2^n$ are, in the following order, $a_1, a_2,$ $\cdot \cdot \cdot$ $, a_k , b_1, b_2,$ $\cdot \cdot \cdot$ $, b_k$, for certain digits $b_1, b_2,$ $\cdot \cdot \cdot$ $, b_k$

Let $ P$ and $ Q$ be the common points of two circles. The ray with origin $ Q$ reflects from the first circle in points $ A_1$, $ A_2$,$ \ldots$ according to the rule ''the angle of incidence is equal to the angle of reflection''. Another ray with origin $ Q$ reflects from the second circle in the points $ B_1$, $ B_2$,$ \ldots$ in the same manner. Points $ A_1$, $ B_1$ and $ P$ occurred to be collinear. Prove that all lines $ A_iB_i$ pass through P.

Let $ a$ and $ b$ be integers such that the equation $ x^3\minus{}ax^2\minus{}b\equal{}0$ has three integer roots. Prove that $ b\equal{}dk^2$, where $ d$ and $ k$ are integers and $ d$ divides $ a$.

In a certain language there are $n$ letters. A sequence of letters is a word, if there are no two equal letters between two other equal letters. Find the number of words of the maximum length.

Let $M$ be the set of all tetrahedra whose inscribed and circumscribed spheres are concentric. If the radii of these spheres are denoted by $r$ and $R$ respectively, find the possible values of $R/r$ over all tetrahedra from $M$ .

Let $ABCD$ be an inscribed quadrilateral. Let the incenters of $BAD$ and $CAD$ be $I$ and $J$ respectively. Let the intersection point of the line that passes through $I$ and perpendicular to $BD$ and the line that passes through $J$ and perpendicular to $AC$ be $K$. Prove that $KI=KJ$

There is a set of triangles, in each of which the smallest angle does not exceed $36^o$ . A new one is formed from these triangles according to the following rule: the smallest side of the new one is equal to the sum of the smallest sides of these triangles, its middle side is equal to the sum of the middle sides, and the largest is the sum of the largest ones. Prove that the sine of the smallest angle of the resulting triangle is less than $2 \sin 18^o$ .

Given a set $S$ that consists of $n \geq 3$ positive integers. It is known that if for some (not necessarily distinct) numbers $a,b,c,d$ from $S$ the equality $a-b=2(c-d)$ holds, then $a=b$ and $c=d$. Let $M$ be the biggest element in $S$. a) Prove that $M > \frac{n^2}{3}$. b) For $n=1024$ find the biggest possible value of $M$. [i]M. Zorka, Y. Sheshukou[/i]

A container in the shape of a right circular cone is 12 inches tall and its base has a 5-inch radius. The liquid that is sealed inside is 9 inches deep when the cone is held with its point down and its base horizontal. When the liquid is held with its point up and its base horizontal, the liquid is $m-n\sqrt[3]{p},$ where $m,$ $n,$ and $p$ are positive integers and $p$ is not divisible by the cube of any prime number. Find $m+n+p.$

Heron is going to watch a show with $n$ episodes which are released one each day. Heron wants to watch the first and last episodes on the days they first air, and he doesn’t want to have two days in a row that he watches no episodes. He can watch as many episodes as he wants in a day. Denote by $f(n)$ the number of ways Heron can choose how many episodes he watches each day satisfying these constraints. Let $N$ be the $2021$st smallest value of $n$ where $f(n) \equiv 2$ mod $3$. Find $N$.

How many sides of the convex polygon can equal its longest diagonal?

Two lines divide a square into $4$ figures of the same area. Prove that all these figures are congruent.

The altitudes of a tetrahedron $ABCD$ are extended externally to points $A'$, $B'$, $C'$, and $D'$, where $AA' = k/h_a$, $BB' = k/h_b$, $CC' = k/h_c$, and $DD' = k/h_d$. Here, $k$ is a constant and $h_a$ denotes the length of the altitude of $ABCD$ from vertex $A$, etc. Prove that the centroid of tetrahedron $A'B'C'D'$ coincides with the centroid of $ABCD$.

Find all triples $(a,b,c)$ of positive integers such that the product of any two of them when divided by the third leaves the remainder $1$.

In a room there are several children and a pile of 1000 sweets. The children come to the pile one after another in some order. Upon reaching the pile each of them divides the current number of sweets in the pile by the number of children in the room, rounds the result if it is not integer, takes the resulting number of sweets from the pile and leaves the room. All the boys round upwards and all the girls round downwards. The process continues until everyone leaves the room. Prove that the total number of sweets received by the boys does not depend on the order in which the children reach the pile. [i]Maxim Didin[/i]

Define the functions $f, F : \mathbb N \to \mathbb N$, by \[f(n)=\left[ \frac{3-\sqrt 5}{2} n \right] , F(k) =\min \{n \in \mathbb N|f^k(n) > 0 \},\] where $f^k = f \circ \cdots \circ f$ is $f$ iterated $n$ times. Prove that $F(k + 2) = 3F(k + 1) - F(k)$ for all $k \in \mathbb N.$

There are $2021$ people at a meeting. It is known that one person at the meeting doesn't have any friends there and another person has only one friend there. In addition, it is true that, given any $4$ people, at least $2$ of them are friends. Show that there are $2018$ people at the meeting that are all friends with each other. [i]Note. [/i]If $A$ is friend of $B$ then $B$ is a friend of $A$.