In a $5 \times 9$ checkered rectangle, the middle row and middle column are colored gray. You leave the corner cell and move to the cell adjacent to the side with each move. For each transition from a gray cell to a gray one you need to pay a ruble. What is the smallest number of rubles you need to pay to go around all the squares of the board exactly once (it is not necessary to return to the starting square)?

Prove that for all polynomials $P \in \mathbb{R}[x]$ and positive integers $n$, $P(x)-x$ divides $P^n(x)-x$ as polynomials.

In a 2025 by 2025 grid, every cell initially contains a `1'. Every minute, we simultaneously replace the number in each cell with the sum of numbers in the cells that share an edge with it. (For example, after the first minute, the number 2 is written in each of the four corner cells.) After 2025 minutes, we colour the board in checkerboard fashion, such that the top left corner is black. Find the difference between the sum of numbers in black cells and the sum of numbers in white cells. [i]Proposed by chorn[/i]

Let $D=\{0,1,\dots,9\}$. A direction function for $D$ is a function $f:D \times D \to \{0,1\}.$ A real $r\in [0,1]$ is compatible with $f$ if it can be written in the form $$r = \sum_{j=1}^{\infty} \frac{d_j}{10^j}$$ with $d_j \in D$ and $f(d_j,d_{j+1})=1$ for every positive integer $j$. Determine the least integer $k$ such that for any direction fuction $f$, if there are $k$ compatible reals with $f$ then there are infinite reals compatible with $f$.

Mykhailo drew a triangular grid with side \( n \) for \( n \geq 2 \). It is formed from an equilateral triangle \( T \) with side length \( n \), by dividing each side into \( n \) equal parts. Then lines are drawn parallel to the sides of triangle \( T \), dividing it into \( n^2 \) equilateral triangles with side length \( 1 \), which we will call \textbf{cells}. Next, Oleksii writes some positive integer into each cell. Mykhailo receives 1 candy for each cell, where the number written is equal to the sum of all the numbers in the adjacent cells. Oleksii wants to arrange the numbers in such a way that Mykhailo receives the maximum number of candies. How many candies can Mykhailo receive under such conditions? In the figure below, an example is shown for \( n = 4 \) with 16 cells and numbers written inside them. For the numbers arranged as in the figure, Mykhailo receives 5 candies for the numbers \( 2 \) (the topmost cell), \( 8 \), \( 13 \), \( 12 \), and \( 11 \). [img]https://i.ibb.co/LrLks9q/Kyiv-MO-2025-R2-7-1.png[/img] [i]Proposed by Mykhailo Shtandenko[/i]

Let $n$ be a positive integer, $h$ a real number and $f(x)$ a polynomial (whole rational function) with real coefficients of degree n, which has no real zeros. Prove that then also the polynomial $$F(x) = f(x) + h f'(x) + h^2 f''(x) +... + h^n f^{(n)}(x)$$ has no real zeros.

Prove that the following inequality holds with the exception of finitely many positive integers $n$: $\sum^{n}_{i=1}\sum^{n}_{j=1}gcd(i,j)>4n^2$.

In how many ways we can paint a $N \times N$ chessboard using 4 colours such that squares with a common side are painted with distinct colors and every $2 \times 2$ square (formed with 4 squares in consecutive lines and columns) is painted with the four colors?

A student has $100$ cards on which the integers $1$ to $100$ are printed, as well as a sufficiently large number of cards on which the symbols $+$ and $=$ are printed. What is the maximal number of correct equalities the student can construct, if each card is used at most once? (R Zhenodarov)

Find the smallest positive integer $n$ such that [list][*] $n$ has exactly $144$ distinct positive divisors, [*] there are ten consecutive integers among the positive divisors of $n$. [/list]

Prove that every positive rational number can be represented in the form $\dfrac{a^{3}+b^{3}}{c^{3}+d^{3}}$ where a,b,c,d are positive integers.

Does there exist an infinite sequence of real numbers ${a}_{1},{a}_{2},{a}_{3},\ldots$ such that ${a}_{1} = 1$ and for all positive integers $k$ we have the equality $$ {a}_{k} = {a}_{2k} + {a}_{3k} + {a}_{4k} + \ldots ? $$ Ilya Lobatsky

Compute the number of ways of tiling the $2\times 10$ grid below with the three tiles shown. There is an infinite supply of each tile, and rotating or reflecting the tiles is not allowed. [img]https://cdn.artofproblemsolving.com/attachments/5/a/bb279c486fc85509aa1bcabcda66a8ea3faff8.png[/img]

What mass of $\ce{NaHCO3}$ $(\text{M=84})$ is required to completely neutralize $25.0$ mL of $0.125$ M $\ce{H2SO4}$? $ \textbf{(A) }\text{0.131 g}\qquad\textbf{(B) }\text{0.262 g}\qquad\textbf{(C) }\text{0.525 g}\qquad\textbf{(D) }\text{1.05 g}\qquad$

Suppose that $n$ is a positive integer number. Consider a regular polygon with $2n$ sides such that one of its largest diagonals is parallel to the $x$-axis. Find the smallest integer $d$ such that there is a polynomial $P$ of degree $d$ whose graph intersects all sides of the polygon on points other than vertices. Proposed by Mohammad Ahmadi

What is the area of the triangle formed by the lines $y=5$, $y=1+x$, and $y=1-x$? $\textbf{(A) }4\qquad\textbf{(B) }8\qquad\textbf{(C) }10\qquad\textbf{(D) }12\qquad\textbf{(E) }16$

Let $ABCD$ be a unit square in the plane. Points $X$ and $Y$ are chosen independently and uniformly at random on the perimeter of $ABCD$. If the expected value of the area of triangle $\triangle AXY$ can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m$ and $n$, compute $m+n$. [i]Proposed by Nathan Xiong[/i]

Here $G_{n}$ denotes a simple undirected graph with $n$ vertices, $K_{n}$ denotes the complete graph with $n$ vertices, $K_{n,m}$ the complete bipartite graph whose components have $m$ and $n$ vertices, and $C_{n}$ a circuit with $n$ vertices. The number of edges in the graph $G_{n}$ is denoted $e(G_{n})$. (a) If $G_{n}$ does not contain $K_{2,3}$ , prove that $e(G_{n}) \leq\frac{n\sqrt{n}}{\sqrt{2}}+n$. (b) Given $n \geq 16$ distinct points $P_{1}, . . . , P_{n}$ in the plane, prove that at most $n\sqrt{n}$ of the segments $P_{i}P_{j}$ have unit length.

Ali puts $5$ points on the plane such that no three of them are collinear. Ramtin adds a sixth point that is not collinear with any two of the former points.Ali wants to eventually construct two triangles from the six points such that one can be placed inside another. Can Ali put the 5 points in such a manner so that he would always be able to construct the desired triangles? (We say that triangle $T_1$ can be placed inside triangle $T_2$ if $T_1$ is congruent to a triangle that is located completely inside $T_2$.)

Given a circle with radius $R$ and inscribed $n$-gon with area $S$. We mark one point on every side of the given polygon. Prove that the perimeter of the polygon with the vertices in the marked points is not less than $2S/R$.

Let $ f: [0,1]\rightarrow \mathbb{R}$ a derivable function such that $ f(0)\equal{}f(1)$, $ \int_0^1f(x)dx\equal{}0$ and $ f^{\prime}(x) \neq 1\ ,\ (\forall)x\in [0,1]$. i)Prove that the function $ g: [0,1]\rightarrow \mathbb{R}\ ,\ g(x)\equal{}f(x)\minus{}x$ is strictly decreasing. ii)Prove that for each integer number $ n\ge 1$, we have: $ \left|\sum_{k\equal{}0}^{n\minus{}1}f\left(\frac{k}{n}\right)\right|<\frac{1}{2}$

A regular pentagon with area $\sqrt{5}+1$ is printed on paper and cut out. The five vertices of the pentagon are folded into the center of the pentagon, creating a smaller pentagon. What is the area of the new pentagon? $\textbf{(A)}~4-\sqrt{5}\qquad\textbf{(B)}~\sqrt{5}-1\qquad\textbf{(C)}~8-3\sqrt{5}\qquad\textbf{(D)}~\frac{\sqrt{5}+1}{2}\qquad\textbf{(E)}~\frac{2+\sqrt{5}}{3}$

Let $ Q $ be a point, $ H,O $ be the orthocenter and circumcenter, respectively, of a triangle $ ABC, $ and $ D,E,F, $ be the symmetric points of $ Q $ with respect to $ A,B,C, $ respectively. Also, $ M,N,P $ are the middle of the segments $ AE,BF,CD, $ and $ G,G',G'' $ are the centroids of $ ABC,MNP,DEF, $ respectively. Prove the following propositions: [b]a)[/b] $ \frac{1}{2}\overrightarrow{OG} =\frac{1}{3}\overrightarrow{OG'}=\frac{1}{4}\overrightarrow{OG''} $ [b]b)[/b] $ Q=O\implies \overrightarrow{OG'} =\overrightarrow{G'H} $ [b]c)[/b] $ Q=H\implies G'=O $ [i]Cătălin Zîrnă[/i]

Let $ABC$ be a triangle with integral side lengths such that $\angle A=3\angle B$. Find the minimum value of its perimeter.

[b]Problem 1. [/b]In the cells of square table are written the numbers $1$, $0$ or $-1$ so that in every line there is exactly one $1$, amd exactly one $-1$. Each turn we change the places of two columns or two rows. Is it possible, from any such table, after finite number of turns to obtain its opposite table (two tables are opposite if the sum of the numbers written in any two corresponding squares is zero)? [i] Emil Kolev[/i]