We are looking for numbers ending with the digit $5$ such that in their decimal expansion each digit beginning with the second digit is no less than the previous one. Moreover the squares of these numbers must also possess the same property. (a) Find four such numbers. (b) Prove that there are infinitely many. (A. Andjans, Riga)

A plane is cut into unit squares, which are then colored in $n$ colors. A polygon $P$ is created from $n$ unit squares that are connected by their sides. It is known that any cell polygon created by $P$ with translation, covers $n$ unit squares in different colors. Prove that the plane can be covered with copies of $P$ so that each cell is covered exactly once.

Let $a_1, a_2, \ldots$ be a strictly increasing sequence of positive integers, such that for any positive integer $n$, $a_n$ is not representable in the for $\sum_{i=1}^{n-1}c_ia_i$ for $c_i \in \{0, 1\}$. For every positive integer $m$, let $f(m)$ denote the number of $a_i$ that are at most $m$. Show that for any positive integers $m, k$, we have that $$f(m) \leq a_k+\frac{m} {k+1}.$$

Prove that the fraction $0.123456789101112...$ is not periodic.

Let $x, y, z$ be positive real numbers such that $2(xy + yz + zx) = xyz$. Prove that $\frac{1}{(x-2)(y-2)(z-2)} + \frac{8}{(x+2)(y+2)(z+2)} \le \frac{1}{32}$

Two subsets are called [i]disjoint[/i] if they do not share any common elements. Compute the number of ordered tuples $(A,B,C),$ where $A,B,$ and $C$ are subsets (not necessarily distinct or non-empty) of $\{1, 2, 3,4,5\}$ such that $A$ and $B$ are disjoint and $B$ and $C$ are disjoint.

$ a>0,\quad\lim_{n\to\infty }\sum_{i=1}^n \frac{1}{n+a^i} $

Five positive consecutive integers starting with $a$ have average $b$. What is the average of $5$ consecutive integers that start with $b$? ${ \textbf{(A)}\ a+3\qquad\textbf{(B)}\ a+4\qquad\textbf{(C)}\ a+5\qquad\textbf{(D)}}\ a+6\qquad\textbf{(E)}\ a+7$

The coach lined up $200$ volleyball players and gave them $m$ balls (each volleyball player could get any number of balls). From time to time, one of the volleyball players throws the ball to another (and he catches it). After a while, it turned out that of any two volleyball players, the left one threw the ball to the right exactly twice, and the right one to the left exactly once. For which minimum $m$ is this possible?

Let $AA_1, BB_1$ be the altitudes of an acute non-isosceles triangle $ABC$. Circumference of the triangles $ABC$ meets that of the triangle $A_1B_1C$ at point $N$ (different from $C$). Let $M$ be the midpoint of $AB$ and $K$ be the intersection point of $CN$ and $AB$. Prove that the line of centers the circumferences of the triangles $ABC$ and $KMC$ is parallel to the line $AB$. (I. Kachan)

In an acute-angled triangle ABC, points $A_2$, $B_2$, $C_2$ are the midpoints of the altitudes $AA_1$, $BB_1$, $CC_1$, respectively. Compute the sum of angles $B_2A_1C_2$, $C_2B_1A_2$ and $A_2C_1B_2$. [i]D. Tereshin[/i]

Four squares of side length $4, 7, 9,$ and $10$ are arranged in increasing size order so that their left edges and bottom edges align. The squares alternate in color white-gray-white-gray, respectively, as shown in the figure. What is the area of the visible gray region in square units? [asy] size(150); filldraw((0,0)--(10,0)--(10,10)--(0,10)--cycle,gray(0.7),linewidth(1)); filldraw((0,0)--(9,0)--(9,9)--(0,9)--cycle,white,linewidth(1)); filldraw((0,0)--(7,0)--(7,7)--(0,7)--cycle,gray(0.7),linewidth(1)); filldraw((0,0)--(4,0)--(4,4)--(0,4)--cycle,white,linewidth(1)); draw((11,0)--(11,4),linewidth(1)); draw((11,6)--(11,10),linewidth(1)); label("$10$",(11,5),fontsize(14pt)); draw((10.75,0)--(11.25,0),linewidth(1)); draw((10.75,10)--(11.25,10),linewidth(1)); draw((0,11)--(3,11),linewidth(1)); draw((5,11)--(9,11),linewidth(1)); draw((0,11.25)--(0,10.75),linewidth(1)); draw((9,11.25)--(9,10.75),linewidth(1)); label("$9$",(4,11),fontsize(14pt)); draw((-1,0)--(-1,1),linewidth(1)); draw((-1,3)--(-1,7),linewidth(1)); draw((-1.25,0)--(-0.75,0),linewidth(1)); draw((-1.25,7)--(-0.75,7),linewidth(1)); label("$7$",(-1,2),fontsize(14pt)); draw((0,-1)--(1,-1),linewidth(1)); draw((3,-1)--(4,-1),linewidth(1)); draw((0,-1.25)--(0,-.75),linewidth(1)); draw((4,-1.25)--(4,-.75),linewidth(1)); label("$4$",(2,-1),fontsize(14pt)); [/asy] $\textbf{(A)}\ 42 \qquad \textbf{(B)}\ 45\qquad \textbf{(C)}\ 49\qquad \textbf{(D)}\ 50\qquad \textbf{(E)}\ 52$

The positive reals $a,b,c,d$ satisfy $abcd=1$. Prove that $\frac{1}{a} + \frac{1}{b} + \frac{1}{c} + \frac{1}{d} + \frac{9}{{a + b + c + d}} \geqslant \frac{{25}}{4}$.

Determine the polynomials P of two variables so that: [b]a.)[/b] for any real numbers $t,x,y$ we have $P(tx,ty) = t^n P(x,y)$ where $n$ is a positive integer, the same for all $t,x,y;$ [b]b.)[/b] for any real numbers $a,b,c$ we have $P(a + b,c) + P(b + c,a) + P(c + a,b) = 0;$ [b]c.)[/b] $P(1,0) =1.$

An $n\times n$ board is coloured in $n$ colours such that the main diagonal (from top-left to bottom-right) is coloured in the first colour; the two adjacent diagonals are coloured in the second colour; the two next diagonals (one from above and one from below) are coloured in the third colour, etc; the two corners (top-right and bottom-left) are coloured in the $n$-th colour. It happens that it is possible to place on the board $n$ rooks, no two attacking each other and such that no two rooks stand on cells of the same colour. Prove that $n=0\pmod{4}$ or $n=1\pmod{4}$.

Let $D$ be an arbitrary point on side $BC$ of triangle $ABC$. Circles $\omega_1$ and $\omega_2$ pass through $A$ and $D$ in such a way that $BA$ touches $\omega_1$ and $CA$ touches $\omega_2$. Let $BX$ be the second tangent from $B$ to $\omega_1$, and $CY$ be the second tangent from $C$ to $\omega_2$. Prove that the circumcircle of triangle $XDY$ touches $BC$.

Let $n>1$ be a given positive integer. Petro and Vasyl play the following game. They take turns making moves and Petro goes first. In one turn, a player chooses one of the numbers from $1$ to $n$ that wasn't selected before and writes it on the board. The first player after whose turn the product of the numbers on the board will be divisible by $n$ loses. Who wins if every player wants to win? Find answer for each $n>1$. [i]Proposed by Mykhailo Shtandenko, Anton Trygub[/i]

Let $ABC$ be an acute, non-isosceles triangle with circumcenter $O$. Tangent lines to $(O)$ at $B,C$ meet at $T$. A line passes through $T$ cuts segments $AB$ at $D$ and cuts ray $CA$ at $E$. Take $M$ as midpoint of $DE$ and suppose that $MA$ cuts $(O)$ again at $K$. Prove that $(MKT)$ is tangent to $(O)$.

Let $N=\overline{abcd}$ be a positive integer with four digits. We name [i]plátano power[/i] to the smallest positive integer $p(N)=\overline{\alpha_1\alpha_2\ldots\alpha_k}$ that can be inserted between the numbers $\overline{ab}$ and $\overline{cd}$ in such a way the new number $\overline{ab\alpha_1\alpha_2\ldots\alpha_kcd}$ is divisible by $N$. Determine the value of $p(2025)$.

Find the largest integer $d$ divides all three numbers $abc, bca$ and $cab$ with $a, b$ and $c$ being some nonzero and mutually different digits. Czech Republic

Pooki Sooki has $8$ hoodies, and he may wear any of them throughout a 7 day week. He changes his hoodie exactly $2$ times during the week, and will only do so at one of the $6$ midnights. Once he changes out of a hoodie, he never wears it for the rest of the week. The number of ways he can wear his hoodies throughout the week can be expressed as $\frac{8!}{2^k}$. Find $k$. Proposed by Minseok Eli Park (wolfpack)

A sequence of real numbers $a_1,a_2,\ldots$ satisfies the relation $$a_n=-\max_{i+j=n}(a_i+a_j)\qquad\text{for all}\quad n>2017.$$ Prove that the sequence is bounded, i.e., there is a constant $M$ such that $|a_n|\leq M$ for all positive integers $n$.

Find all three digit numbers $\overline{abc}$ such that $2 \cdot \overline{abc} = \overline{bca} + \overline{cab}$.

Let $p(x)$ and $q(x)$ non constant real polynomials of degree at most $n$ ($n > 1$). Show that there exists a non zero polynomial $F(x,y)$ in two variables with real coefficients of degree at most $2n-2,$ such that $F(p(t),q(t)) = 0$ for every $t\in \mathbb{R}$.

We have an acute-angled triangle $ABC$, and $AA',BB'$ are its altitudes. A point $D$ is chosen on the arc $ACB$ of the circumcircle of $ABC$. If $P=AA'\cap BD,Q=BB'\cap AD$, show that the midpoint of $PQ$ lies on $A'B'$.