We have a $4 \times 4$ squared board. We define the [i]separation [/i] between two squares as the least number of moves that a chess knight must take to go from one square to the other (using moves of the knight). Three boxes $A, B, C$ form a good trio if the three separations between $A$ and $B$, between $A$ and $C$ and between $B$ and $C$ are equal. Determines the number of good trios that are formed on the board. Clarification: In each move the knight moves $2$ squares in the horizontal direction plus one square in the vertical direction or moves $2$ squares in the vertical direction plus one square in the horizontal direction.

It is known that each two of the 12 competitors, that participated in the finals of the competition “Mathematical duels”, have a common friend among the other 10. Prove that there is one of them that has at least 5 friends among the group.

A tourist traveling on a bus from the VIAZUL company arrived at the station in the city of Cienfuegos and immediately set out to take a walking tour of the city. After visiting the Terry theater in this city, decided to return to the station but walking only for blocks traveled an odd number of times in his previous walk. Can he do this on his return regardless. of the initial route?

Compute the number of ways there are to completely fill a $3\times 15$ rectangle with non-overlapping $1\times 3$ rectangles

a.) Prove that for $n = 4$ or $n \geq 6$ each triangle $ABC$ can be decomposed in $n$ similar (not necessarily congruent) triangles. b.) Show: An equilateral triangle can neither be composed in 3 nor 5 triangles. c.) Is there a triangle $ABC$ which can be decomposed in 3 and 5 triangles, analogously to a.). Either give an example or prove that there is not such a triangle.

Isabel wants to partition the set $\mathbb{N}$ of the positive integers into $n$ disjoint sets $A_{1}, A_{2}, \ldots, A_{n}$. Suppose that for each $i$ with $1\leq i\leq n$, given any positive integers $r, s\in A_{i}$ with $r\neq s$, we have $r+s\in A_{i}$. If $|A_{j}|=1$ for some $j$, find the greatest positive integer that may belong to $A_{j}$.

Initially, the numbers $2$ and $5$ are written on the board. A \emph{move} consists of replacing one of the two numbers on the board with their sum. Is it possible to obtain (in a finite numer of moves) a situation in which the two integers written on the board are consecutive? Justify your answer.

For a given positive integer $n$, there are a total of $5n$ balls labeled with numbers $1$, $2$, $3$, $\cdots$, $n$, with 5 balls for each number. The balls are put into $n$ boxes, with $5$ balls in each box. Show that you can color two balls red and one ball blue in each box so that the sum of the numbers on the red balls is twice the sum of the numbers on the blue balls.

How many ways are there to paint the squares of a $6 \times 6$ board black or white such that within each $2\times 2$ square on the board, the number of black squares is odd?

A family of sets $F$ is called perfect if the following condition holds: For every triple of sets $X_1, X_2, X_3\in F$, at least one of the sets $$ (X_1\setminus X_2)\cap X_3,$$ $$(X_2\setminus X_1)\cap X_3$$ is empty. Show that if $F$ is a perfect family consisting of some subsets of a given finite set $U$, then $\left\lvert F\right\rvert\le\left\lvert U\right\rvert+1$. [i]Proposed by Michał Pilipczuk[/i]

Given any six points in the plane, no three collinear, show that we can always find three which form an obtuse-angled triangle with one angle at least $120^o$.

Two unit squares are stacked on top of one another to form a $1 \times 2$ rectangle. Each of the seven edges is colored either red or blue. How many ways are there to color the edges in this way such that there is exactly one path along all-blue edges from the bottom-left corner to the top-right corner?

[u]Round 5[/u] [b]p13.[/b] Find the number of six-digit positive integers that satisfy all of the following conditions: (i) Each digit does not exceed $3$. (ii) The number $1$ cannot appear in two consecutive digits. (iii) The number $2$ cannot appear in two consecutive digits. [b]p14.[/b] Find the sum of all distinct prime factors of $103040301$. [b]p15.[/b] Let $ABCA'B'C'$ be a triangular prism with height $3$ where bases $ABC$ and $A'B'C'$ are equilateral triangles with side length $\sqrt6$. Points $P$ and $Q$ lie inside the prism so that $ABCP$ and $A'B'C'Q$ are regular tetrahedra. The volume of the intersection of these two tetrahedra can be expressed in the form $\frac{\sqrt{m}}{n}$ , where $m$ and $n$ are positive integers and $m$ is not divisible by the square of any prime. Find $m + n$. [u]Round 6[/u] [b]p16.[/b] Let $a_0, a_1, ...$ be an infinite sequence such that $a^2_n -a_{n-1}a_{n+1} = a_n -a_{n-1}$ for all positive integers $n$. Given that $a_0 = 1$ and $a_1 = 4$, compute the smallest positive integer $k$ such that $a_k$ is an integer multiple of $220$. [b]p17.[/b] Vincent the Bug is on an infinitely long number line. Every minute, he jumps either $2$ units to the right with probability $\frac23$ or $3$ units to the right with probability $\frac13$ . The probability that Vincent never lands exactly $15$ units from where he started can be expressed as $\frac{p}{q}$ where $p$ and $q$ are relatively prime positive integers. What is $p + q$? [b]p18.[/b] Battler and Beatrice are playing the “Octopus Game.” There are $2022$ boxes lined up in a row, and inside one of the boxes is an octopus. Beatrice knows the location of the octopus, but Battler does not. Each turn, Battler guesses one of the boxes, and Beatrice reveals whether or not the octopus is contained in that box at that time. Between turns, the octopus teleports to an adjacent box and secretly communicates to Beatrice where it teleported to. Find the least positive integer $B$ such that Battler has a strategy to guarantee that he chooses the box containing the octopus in at most $B$ guesses. [u]Round 7[/u] [b]p19.[/b] Given that $f(x) = x^2-2$ the number $f(f(f(f(f(f(f(2.5)))))))$ can be expressed as $\frac{a}{b}$ for relatively prime positive integers $a$ and $b$. Find the greatest positive integer $n$ such that $2^n$ divides $ab+a+b-1$. [b]p20.[/b] In triangle $ABC$, the shortest distance between a point on the $A$-excircle $\omega$ and a point on the $B$-excircle $\Omega$ is $2$. Given that $AB = 5$, the sum of the circumferences of $\omega$ and $\Omega$ can be written in the form $\frac{m}{n}\pi$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$? (Note: The $A$-excircle is defined to be the circle outside triangle $ABC$ that is tangent to the rays $\overrightarrow{AB}$ and $\overrightarrow{AC}$ and to the side $ BC$. The $B$-excircle is defined similarly for vertex $B$.) [b]p21.[/b] Let $a_0, a_1, ...$ be an infinite sequence such that $a_0 = 1$, $a_1 = 1$, and there exists two fixed integer constants $x$ and $y$ for which $a_{n+2}$ is the remainder when $xa_{n+1}+ya_n$ is divided by $15$ for all nonnegative integers $n$. Let $t$ be the least positive integer such that $a_t = 1$ and $a_{t+1} = 1$ if such an integer exists, and let $t = 0$ if such an integer does not exist. Find the maximal value of t over all possible ordered pairs $(x, y)$. [u]Round 8[/u] [b]p22.[/b] A mystic square is a $3$ by $3$ grid of distinct positive integers such that the least common multiples of the numbers in each row and column are the same. Let M be the least possible maximal element in a mystic square and let $N$ be the number of mystic squares with $M$ as their maximal element. Find $M + N$. [b]p23.[/b] In triangle $ABC$, $AB = 27$, $BC = 23$, and $CA = 34$. Let $X$ and $Y$ be points on sides $ AB$ and $AC$, respectively, such that $BX = 16$ and $CY = 7$. Given that $O$ is the circumcenter of $BXY$ , the value of $CO^2$ can be written as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers. Compute $m + n$. [b]p24.[/b] Alan rolls ten standard fair six-sided dice, and multiplies together the ten numbers he obtains. Given that the probability that Alan’s result is a perfect square is $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers, compute $a$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2949416p26408251]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n> 1$ be an odd integer. On a square surface have been placed $n^2 - 1$ white slabs and a black slab on the center. Two workers $A$ and $B$ take turns removing them, betting that whoever removes black will lose. First $A$ picks a slab; if it has row number $i \ge (n + 1) / 2$, then it will remove all tiles from rows with number greater than or equal to$ i$, while if $i <(n + 1) / 2$, then it will remove all tiles from the rows with lesser number or equal to $i$. Proceed in a similar way with columns. Then $B$ chooses one of the remaining tiles and repeats the process. Determine who has a winning strategy and describe it. Note: Row and column numbering is ascending from top to bottom and from left to right.

Let $G$ be a graph with $400$ vertices. For any edge $AB$ we call [i]a cuttlefish[/i] the set of all edges from $A$ and $B$ (including $AB$). Each edge of the graph is assigned a value of $1$ or $-1$. It is known that the sum of edges at any cuttlefish is greater than or equal to $1$. Prove that the sum of the numbers at all edges is at least $-10^4$.

In a plane, 2014 lines are distributed in 3 groups. in every group all the lines are parallel between themselves. What is the maximum number of triangles that can be formed, such that every side of such triangle lie on one of the lines?

Let $n$ be a positive integer. Alex plays on a row of 9 squares as follows. Initially, all squares are empty. In each turn, Alex must perform exactly one of the following moves: $(i)\:$ Choose a number of the form $2^j$, with $j$ a non-negative integer, and place it in an empty square. $(ii)\:$ Choose two (not necessarily consecutive) squares containing the same number, say $2^j$. Replace the number in one of the squares with $2^{j+1}$ and erase the number in the other square. At the end of the game, one square contains the number $2^n$, while the other squares are empty. Determine, as a function of $n$, the maximum number of turns Alex can make.

For every set $S$ with $n(\ge3)$ distinct integers, show that there exists a function $f:\{1,2,\dots,n\}\rightarrow S$ satisfying the following two conditions. (i) $\{ f(1),f(2),\dots,f(n)\} = S$ (ii) $2f(j)\neq f(i)+f(k)$ for all $1\le i<j<k\le n$.

In a dancing hall, there are $n$ girls standing in one row and $n$ boys in the other row across them (so that all $2n$ dancers form a $2 \times n$ board). Each dancer gives her / his left hand to a neighboring person standing to the left, across, or diagonally to the left. The analogous rule applies for right hands. No dancer gives both hands to the same person. In how many ways can the dancers do this?

For each subset $S$ of $\mathbb{N}$, with $r_S (n)$ we denote the number of ordered pairs $(a,b)$, $a,b\in S$, $a\neq b$, for which $a+b=n$. Prove that $\mathbb{N}$ can be partitioned into two subsets $A$ and $B$, so that $r_A(n)=r_B(n)$ for $\forall$ $n\in \mathbb{N}$.

Chess piece called [i]skew knight[/i], if placed on the black square, attacks all the gray squares. [img]https://i.ibb.co/HdTDNjN/Kyiv-MO-2021-Round-1-11-2.png[/img] What is the largest number of such knights that can be placed on the $8\times 8$ chessboard without them attacking each other? [i]Proposed by Arsenii Nikolaiev[/i]

On a plane are given $6$ red, $6$ blue, and $6$ green points, such that no three of the given points lie on a line. Prove that the sum of the areas of the triangles whose vertices are of the same color does not exceed quarter the sum of the areas of all triangles with vertices in the given points.

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)

For each positive integer $n$, the Bank of Cape Town issues coins of denomination $\frac1n$. Given a finite collection of such coins (of not necessarily different denominations) with total value at most most $99+\frac12$, prove that it is possible to split this collection into $100$ or fewer groups, such that each group has total value at most $1$.

In the interior of the convex 2011-gon are $2011$ points, such that no three among the given $4022$ points (the interior points and the vertices) are collinear. The points are coloured one of two different colours and a colouring is called "good" if some of the points can be joined in such a way that the following conditions are satisfied: 1) Each segment joins two points of the same colour. 2) None of the line segments intersect. 3) For any two points of the same colour there exists a path of segments connecting them. Find the number of "good" colourings.