In the vertexes of a regular $ 31$-gon there are written the numbers from $ 1$ to $ 31$, ordered increasingly, clockwise oriented. We are allowed to perform an operation which consists in taking any three vertexes, namely the ones who have written $ a$,$ b$, and $ c$ and change them into $ c$, $ a\minus{}\frac{1}{10}$ and $ b\plus{}\frac{1}{10}$ respectively ( $ a$ becomes $ c$, $ b$ becomes $ a\minus{}\frac{1}{10}$ and $ c$ turns into $ b\plus{}\frac{1}{10}$ Prove that after applying several operations we can reach the state in which the numbers in the vertexes are the numbers from $ 1$ to $ 31$, ordered increasingly,anti-clockwise oriented.

There are $n$ children around a round table. Erika is the oldest among them and she has $n$ candies, while no other child has any candy. Erika decided to distribute the candies according to the following rules. In every round, she chooses a child with at least two candies and the chosen child sends a candy to each of his/her two neighbors. (So in the first round Erika must choose herself). For which $n \ge 3$ is it possible to end the distribution after a finite number of rounds with every child having exactly one candy?

Define two sequences $x_n, y_n$ for $n = 1, 2, \ldots$ by \[x_n = \left(\sum^n_{k=0} \binom{2n}{2k}49^k 48^{n-k} \right) -1, \quad \text{and} \quad y_n = \sum^{n-1}_{k=0} \binom{2n}{2k + 1} 49^k 48^{n-k}\] Prove there is a positive integer $m$ for which for every integer $n > m,$ the greatest common factor of $x_n$ and $y_n$ is more than $10^{2024}.$

Bilbo composes a number triangle of zeroes and ones in such a way: he fills the topmost row with any $n$ digits, and in other rows he always writes $0$ under consecutive equal digits and writes $1$ under consecutive distinct digits. (An example of a triangle for $n=5$ is shown below.) In how many ways can Bilbo fill the topmost row for $n=100$ so that each of $n$ rows of the triangle contains even number of ones?\[\begin{smallmatrix}1\,0\,1\,1\,0\\1\,1\,0\,1\\0\,1\,1\\1\,0\\1\end{smallmatrix}\] (O. Rudenko and V. Brayman)

[u]Round 5[/u] [b]p13.[/b] Find all ordered pairs of real numbers $(x, y)$ satisfying the following equations: $$\begin{cases} \dfrac{1}{xy} + \dfrac{y}{x}= 2 \\ \dfrac{1}{xy^2} + \dfrac{y^2}{x} = 7 \end{cases}$$ [b]p14.[/b] An egg plant is a hollow prism of negligible thickness, with height $2$ and an equilateral triangle base. Inside the egg plant, there is enough space for four spherical eggs of radius $1$. What is the minimum possible volume of the egg plant? [b]p15.[/b] How many ways are there for Farmer James to color each square of a $2\times 6$ grid with one of the three colors eggshell, cream, and cornsilk, so that no two adjacent squares are the same color? [u]Round 6[/u] [b]p16.[/b] In a triangle $ABC$, $\angle A = 45^o$, and let $D$ be the foot of the perpendicular from $A$ to segment $BC$. $BD = 2$ and $DC = 4$. Let $E$ be the intersection of the line $AD$ and the perpendicular line from $B$ to line $AC$. Find the length of $AE$. [b]p17.[/b] Find the largest positive integer $n$ such that there exists a unique positive integer $m$ satisfying $$\frac{1}{10} \le \frac{m}{n} \le \frac19$$ [b]p18.[/b] How many ordered pairs $(A,B)$ of positive integers are there such that $A+B = 10000$ and the number $A^2 + AB + B$ has all distinct digits in base $10$? [u]Round 7[/u] [b]p19.[/b] Pentagon $JAMES$ satisfies $JA = AM = ME = ES = 2$. Find the maximum possible area of $JAMES$. [b]p20.[/b] $P(x)$ is a monic polynomial (a polynomial with leading coecient $1$) of degree $4$, such that $P(2^n+1) =8^n + 1$ when $n = 1, 2, 3, 4$. Find the value of $P(1)$. [b]p21[/b]. PEAcock and Zombie Hen Hao are at the starting point of a circular track, and start running in the same direction at the same time. PEAcock runs at a constant speed that is $2018$ times faster than Zombie Hen Hao's constant speed. At some point in time, Farmer James takes a photograph of his two favorite chickens, and he notes that they are at different points along the track. Later on, Farmer James takes a second photograph, and to his amazement, PEAcock and Zombie Hen Hao have now swapped locations from the first photograph! How many distinct possibilities are there for PEAcock and Zombie Hen Hao's positions in Farmer James's first photograph? (Assume PEAcock and Zombie Hen Hao have negligible size.) [u]Round 8[/u] [b]p22.[/b] How many ways are there to scramble the letters in $EGGSEATER$ such that no two consecutive letters are the same? [b]p23.[/b] Let $JAMES$ be a regular pentagon. Let $X$ be on segment $JA$ such that $\frac{JX}{XA} = \frac{XA}{JA}$ . There exists a unique point $P$ on segment $AE$ such that $XM = XP$. Find the ratio $\frac{AE}{PE}$ . [b]p24.[/b] Find the minimum value of the function $$f(x) = \left|x - \frac{1}{x} \right|+ \left|x - \frac{2}{x} \right| + \left|x - \frac{3}{x} \right|+... + \left|x - \frac{9}{x} \right|+ \left|x - \frac{10}{x} \right|$$ over all nonzero real numbers $x$. PS. You should use hide for answers. Rounds 1-4 have been posted [url=https://artofproblemsolving.com/community/c3h2949191p26406082]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Suppose $f:\mathbb{R} \to \mathbb{R}$ is a function given by $$f(x) =\begin{cases} 1 & \mbox{if} \ x=1 \\ e^{(x^{10}-1)}+(x-1)^2\sin\frac1{x-1} & \mbox{if} \ x\neq 1\end{cases}$$ (a) Find $f'(1)$ (b) Evaluate $\displaystyle \lim_{u\to\infty} \left[100u-u\sum_{k=1}^{100} f\left(1+\frac{k}{u}\right)\right]$.

We call the sum of any $k$ of $n$ given numbers (with distinct indices) a $k$-sum. Given $n$, find all $k$ such that, whenever more than half of $k$-sums of numbers $a_{1},a_{2},...,a_{n}$ are positive, the sum $a_{1}+a_{2}+...+a_{n}$ is positive as well.

Show that there doesn't exist two infinite and separate sets $A,B$ of points such that [b](i)[/b] There are no three collinear points in $A \cup B$, [b](ii)[/b] The distance between every two points in $A \cup B$ is at least $1$, and [b](iii)[/b] There exists at least one point belonging to set $B$ in interior of each triangle which all of its vertices are chosen from the set $A$, and there exists at least one point belonging to set $A$ in interior of each triangle which all of its vertices are chosen from the set $B$.

Kostya and Sergey play a game on a white strip of length 2016 cells. Kostya (he plays first) in one move should paint black over two neighboring white cells. Sergey should paint either one white cell either three neighboring white cells. It is forbidden to make a move, after which a white cell is formed the doesn't having any white neighbors. Loses the one that can make no other move. However, if all cells are painted, then Kostya wins. Who will win if he plays the right game (has a winning strategy)?

There are $ n$ markers, each with one side white and the other side black. In the beginning, these $ n$ markers are aligned in a row so that their white sides are all up. In each step, if possible, we choose a marker whose white side is up (but not one of the outermost markers), remove it, and reverse the closest marker to the left of it and also reverse the closest marker to the right of it. Prove that, by a finite sequence of such steps, one can achieve a state with only two markers remaining if and only if $ n \minus{} 1$ is not divisible by $ 3$. [i]Proposed by Dusan Dukic, Serbia[/i]

A rectangular $M \times N$ board is divided into $1 \times $ cells. There are also many domino pieces of size $1 \times 2$. These pieces are placed on a board so that each piece occupies two cells. The board is not entirely covered, but it is impossible to move the domino pieces (the board has a frame, so that the pieces cannot stick out of it). Prove that the number of uncovered cells is (a) less than $\frac14 MN$, (b) less than $\frac15 MN$.

[b]p1.[/b] Find the unknown angle $a$ of the triangle inscribed in the square. [img]https://cdn.artofproblemsolving.com/attachments/b/1/4aab5079dea41637f2fa22851984f886f034df.png[/img] [b]p2.[/b] Draw a polygon in the plane and a point outside of it with the following property: no edge of the polygon is completely visible from that point (in other words, the view is obstructed by some other edge). [b]p3.[/b] This problem has two parts. In each part, $2022$ real numbers are given, with some additional property. (a) Suppose that the sum of any three of the given numbers is an integer. Show that the total sum of the $2022$ numbers is also an integer. (b) Suppose that the sum of any five of the given numbers is an integer. Show that 5 times the total sum of the $2022$ numbers is also an integer, but the sum itself is not necessarily an integer. [b]p4.[/b] Replace stars with digits so that the long multiplication in the example below is correct. [img]https://cdn.artofproblemsolving.com/attachments/9/7/229315886b5f122dc0675f6d578624e83fc4e0.png[/img] [b]p5.[/b] Five nodes of a square grid paper are marked (called marked points). Show that there are at least two marked points such that the middle point of the interval connecting them is also a node of the square grid paper [b]p6.[/b] Solve the system $$\begin{cases} \dfrac{xy}{x+y}=\dfrac{8}{3} \\ \dfrac{yz}{y+z}=\dfrac{12}{5} \\\dfrac{xz}{x+z}=\dfrac{24}{7} \end{cases}$$ PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

A circle is circumscribed around an isosceles triangle whose two base angles are equal to $x^{\circ}$. Two points are chosen independently and randomly on the circle, and a chord is drawn between them. The probability that the chord intersects the triangle is $\frac{14}{25}.$ Find the sum of the largest and smallest possible value of $x$.

In a $5 \times 5$ checkered square, 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)?

You are given a positive integer $n$. $n^2$ amount of people stand on coordinates $(x;y)$ where $x,y\in\{0;1;2;...;n-1\}$. Every person got a water cup and two people are considered to be neighbour if the distance between them is $1$. At the first minute, the person standing on coordinates $(0;0)$ got $1$ litres of water, and the other $n^2-1$ people's water cup is empty. Every minute, two neighbouring people are chosen that does not have the same amount of water in their water cups, and they equalize the amount of water in their water cups. Prove that, no matter what, the person standing on the coordinates $(x;y)$ will not have more than $\frac1{x+y+1}$ litres of water.

Each of the integers from 1 to 4027 has been colored either green or red. Changing the color of a number is making it red if it was green and making it green if it was red. Two positive integers $m$ and $n$ are said to be [i]cuates[/i] if either $\frac{m}{n}$ or $\frac{n}{m}$ is a prime number. A [i]step[/i] consists in choosing two numbers that are cuates and changing the color of each of them. Show it is possible to apply a sequence of steps such that every integer from 1 to 2014 is green.

The kingdom of Anisotropy consists of $n$ cities. For every two cities there exists exactly one direct one-way road between them. We say that a [i]path from $X$ to $Y$[/i] is a sequence of roads such that one can move from $X$ to $Y$ along this sequence without returning to an already visited city. A collection of paths is called [i]diverse[/i] if no road belongs to two or more paths in the collection. Let $A$ and $B$ be two distinct cities in Anisotropy. Let $N_{AB}$ denote the maximal number of paths in a diverse collection of paths from $A$ to $B$. Similarly, let $N_{BA}$ denote the maximal number of paths in a diverse collection of paths from $B$ to $A$. Prove that the equality $N_{AB} = N_{BA}$ holds if and only if the number of roads going out from $A$ is the same as the number of roads going out from $B$. [i]Proposed by Warut Suksompong, Thailand[/i]

Given a sequence of eight integers $x_{1},x_{2},...,x_{8}$ in a single operation one replaces these numbers with $|x_{1}-x_{2}|,|x_{2}-x_{3}|,...,|x_{8}-x_{1}|$. Find all the eight-term sequences of integers which reduce to a sequence with all the terms equal after finitely many single operations.

Two squares on an $8\times 8$ chessboard are called adjacent if they have a common edge or common corner. Is it possible for a king to begin in some square and visit all squares exactly once in such a way that all moves except the first are made into squares adjacent to an even number of squares already visited?

The vertices of 100-gon (i.e., polygon with 100 sides) are colored alternately white or black. One of the vertices contains a checker. Two players in turn do two things: move the checker into other vertice along the side of 100-gon and then erase some side. The game ends when it is impossible to move the checker. At the end of the game if the checker is in the white vertice then the first player wins. Otherwise the second player wins. Does any of the players have winning strategy? If yes, then who? [i]Remark.[/i] The answer may depend on initial position of the checker.

$60$ points lie on the plane, such that no three points are collinear. Prove that one can divide the points into $20$ groups, with $3$ points in each group, such that the triangles ( $20$ in total) consist of three points in a group have a non-empty intersection.

Let $g$ be a straight line and $n$ a given positive integer. Prove that there are always n different points on g to choose as well as a point not lying on g in such a way that the distance between each two of these $n + 1$ points is an integer.

There are $2000$ apples , contained in several baskets. One can remove baskets and /or remove apples from the baskets. Prove that it is possible to then have an equal number of apples in each of the remaining baskets, with the total number of apples being not less than $100$ . (A. Razborov)

Given any $n$ points on a unit circle show that at most $\frac{n^2}{3}$ of the segments joining two points have length $> \sqrt{2}$.

A rectangular table with 2001 rows and 2002 columns is partitioned into $1\times 2$ rectangles. It is known that any other partition of the table into $1\times 2$ rectangles contains a rectangle belonging to the original partition. Prove that the original partition contains two successive columns covered by 2001 horizontal rectangles. [i]Proposed by S. Volchenkov[/i]