$N$ is a $50$-digit number (in decimal representation). All digits except the $26$th digit (from the left) are $1$. If $N$ is divisible by $13$, find its $26$-th digit.

Find all continious $f: \mathbb R\longrightarrow\mathbb R$ that for any $x,y$ \[f(x)+f(y)+f(xy)=f(x+y+xy)\]

Determine all the pairs $(a,b)$ of positive integers, such that all the following three conditions are satisfied: 1- $b>a$ and $b-a$ is a prime number 2- The last digit of the number $a+b$ is $3$ 3- The number $ab$ is a square of an integer.

Find all positive integers $p$, $q$, $r$ such that $p$ and $q$ are prime numbers and $\frac{1}{p+1}+\frac{1}{q+1}-\frac{1}{(p+1)(q+1)} = \frac{1}{r}.$

Some blue and red circular disks of identical size are packed together to form a triangle. The top level has one disk and each level has 1 more disk than the level above it. Each disk not at the bottom level touches two disks below it and its colour is blue if these two disks are of the same colour. Otherwise its colour is red. Suppose the bottom level has 2048 disks of which 2014 are red. What is the colour of the disk at the top?

Let $N$ be an odd number, $N\geq 3$. $N$ tennis players take part in a championship. Before starting the championship, a commission puts the players in a row depending on how good they think the players are. During the championship, every player plays with every other player exactly once, and each match has a winner. A match is called [i]suprising[/i] if the winner was rated lower by the commission. At the end of the tournament, players are arranged in a line based on the number of victories they have achieved. In the event of a tie, the commission's initial order is used to decide which player will be higher. It turns out that the final order is exactly the same as the commission's initial order. What is the maximal number of suprising matches that could have happened.

The sports plane flew along a diamond-shaped route in windy weather. He flew through the first three sides of the rhombus in $a $, $b$ and $c$ hours, respectively. How long did it take him to cover the fourth side of the diamond? (The speed of an aircraft is a vector equal to the sum of two vectors: the aircraft’s own speed and the wind speed. Wind speed is a constant vector. The aircraft’s own speed is a vector of constant length).

Compute the number of ordered pairs of non-negative integers $(x, y)$ which satisfy $x^2 + y^2 = 32045.$

Find all functions $f : \mathbb R \to \mathbb R$ for which \[f(a - b) f(c - d) + f(a - d) f(b - c) \leq (a - c) f(b - d),\] for all real numbers $a, b, c$ and $d$. Note that there is only one occurrence of $f$ on the right hand side!

Assume that all angles of a triangle $ABC$ are acute. Let $D$ and $E$ be points on the sides $AC$ and $BC$ of the triangle such that $A, B, D,$ and $E$ lie on the same circle. Further suppose the circle through $D,E,$ and $C$ intersects the side $AB$ in two points $X$ and $Y$. Show that the midpoint of $XY$ is the foot of the altitude from $C$ to $AB$.

Let $ABCD$ be a convex quadrilateral. Construct equilateral triangles $AQB$, $BRC$, $CSD$ and $DPA$ externally on the sides $AB$, $BC$, $CD$ and $DA$ respectively. Let $K, L, M, N$ be the mid-points of $P Q, QR, RS, SP$. Find the maximum value of $$\frac{KM + LN}{AC + BD}$$ .

Could the four centers of the circles inscribed into the faces of a tetrahedron be coplanar? (vertexes of tetrahedron not coplanar)

Find the number of five-digit numbers whose square ends in the same five digits in the same order.

Let $ABC$ be a triangle and $\gamma$ the circle inscribed in $ABC$. The circle $\gamma$ is tangent to side $AB$ at the point $T$. Let $D$ be the point of $\gamma$ diametrically opposite to $T$, and $S$ the intersection point of the line through $C$ and $D$ with side $AB$. Prove that $AT=SB$.

For positive integers $ m$ and $ n$, let $ f\left(m,n\right)$ denote the number of $ n$-tuples $ \left(x_1,x_2,\dots,x_n\right)$ of integers such that $ \left|x_1\right| \plus{} \left|x_2\right| \plus{} \cdots \plus{} \left|x_n\right|\le m$. Show that $ f\left(m,n\right) \equal{} f\left(n,m\right)$.

Let $O$ be the centre of a two-dimensional coordinate system, and let $A_1, A_2, \ldots ,A_n$ be points in the first quadrant and $B_1, B_2, \ldots , B_m$ points in the second quadrant. We associate numbers $a_1, a_2, \ldots , a_n$ to the points $A_1, A_2, \ldots ,A_n$ and numbers $b_1, b_2, \ldots, b_m$ to the points $B_1, B_2, \ldots , B_m$, respectively. It turns out that the area of triangle $OA_jB_k$ is always equal to the product $a_jb_k$, for any $j$ and $k$. Show that either all the $A_j$ or all the $B_k$ lie on a single line through $O$.

You are given positive integers $m, n>1$. Vasyl and Petryk play the following game: they take turns marking on the coordinate plane yet unmarked points of the form $(x, y)$, where $x, y$ are positive integers with $1 \leq x \leq m, 1 \leq y \leq n$. The player loses if after his move there are two marked points, the distance between which is not a positive integer. Who will win this game if Vasyl moves first and each player wants to win? [i]Proposed by Mykyta Kharin[/i]

One side of a rectangle has length 18. The area plus the perimeter of the rectangle is 2016. Find the perimeter of the rectangle.

Each cell in a $13 \times 13$ grid table is painted in black or white. Each move consists of choosing a subsquare of size either $2 \times 2$ or $9 \times 9$, and painting all white cells of the choosen subsquare black, and painting all its black cells white. It is always possible to get all cells of the original square black, after a finite number of such moves ?

An acute triangle $ABC$ is given in which $AB <AC$. Point $E$ lies on the $AC$ side of the triangle, with $AB = AE$. The segment $AD$ is the diameter of the circumcircle of the triangle $ABC$, and point $S$ is the center of this arc $BC$ of this circle to which point $A$ does not belong. Point $F$ is symmetric of point $D$ wrt $S$. Prove that lines $F E$ and $AC$ are perpendicular.

Triangle $ABC$ has circumcircle $\omega$ where $B'$ is the point diametrically opposite $B$ and $C'$ is the point diametrically opposite $C$. Given $B'C'$ passes through the midpoint of $AB$, if $AC' = 3$ and $BC = 7$, find $AB'^2$..

There were $2n,$ $n\ge2,$ teams in a tournament. Each team played against every other team once without draws. A team gets 0 points for a loss and gets as many points for a win as its current number of losses. For which $n$ all the teams could end up with the same non-zero number of points?

Inside the acute-angled triangle $ABC$ we take $P$ and $Q$ two isogonal conjugate points. The perpendicular lines on the interior angle-bisector of $\angle BAC$ passing through $P$ and $Q$ intersect the segments $AC$ and $AB$ at the points $B_p\in AC$, $B_q\in AC$, $C_p\in AB$ and $C_q\in AB$, respectively. Let $W$ be the midpoint of the arc $BAC$ of the circle $(ABC)$. The line $WP$ intersects the circle $(ABC)$ again at $P_1$ and the line $WQ$ intersects the circle $(ABC)$ again at $Q_1$. Prove that the points $P_1$, $Q_1$, $B_p$, $B_q$, $C_p$ and $C_q$ lie on a circle. [i]Proposed by P. Bibikov[/i]

Let $E$ be a Euclidean space of at most three dimensions. If $A$ is a nonempty subset of $E$, define $S(A)$ to be the set of points that lie on closed segments joining pairs of points of $A$ (a one-point set should be considered to be a special case of a closed segment). For a given nonempty set $A_0$, define $A_n =S(A_{n-1})$ for $n=1,2,\ldots$ Prove that $A_2 =A_3 =\ldots.$

There are $n\ge 2$ lamps, each with two states: $\textbf{on}$ or $\textbf{off}$. For each non-empty subset $A$ of the set of these lamps, there is a $\textit{soft-button}$ which operates on the lamps in $A$; that is, upon $\textit{operating}$ this button each of the lamps in $A$ changes its state(on to off and off to on). The buttons are identical and it is not known which button corresponds to which subset of lamps. Suppose all the lamps are off initially. Show that one can always switch all the lamps on by performing at most $2^{n-1}+1$ operations.