Let $n$ be a given positive integer. Sisyphus performs a sequence of turns on a board consisting of $n + 1$ squares in a row, numbered $0$ to $n$ from left to right. Initially, $n$ stones are put into square $0$, and the other squares are empty. At every turn, Sisyphus chooses any nonempty square, say with $k$ stones, takes one of these stones and moves it to the right by at most $k$ squares (the stone should say within the board). Sisyphus' aim is to move all $n$ stones to square $n$. Prove that Sisyphus cannot reach the aim in less than \[ \left \lceil \frac{n}{1} \right \rceil + \left \lceil \frac{n}{2} \right \rceil + \left \lceil \frac{n}{3} \right \rceil + \dots + \left \lceil \frac{n}{n} \right \rceil \] turns. (As usual, $\lceil x \rceil$ stands for the least integer not smaller than $x$. )

Let $E$ be the set of $n^2+1$ closed intervals on the real axis. Prove that there exists a subset of $n+1$ intervals that are monotonically increasing with respect to inclusion, or a subset of $n+1$ intervals none of which contains any other interval from the subset.

Determine the largest integer $n\geq 3$ for which the edges of the complete graph on $n$ vertices can be assigned pairwise distinct non-negative integers such that the edges of every triangle have numbers which form an arithmetic progression.

A graph is called $7-chip$ if it obtained by removing at most three edges that have no vertex in common from a complete graph with seven vertices. Consider a complete graph $G$ with $v$ vertices which each edge of its is colored blue or red. Prove that there is either a blue path with $100$ edges or a red $7-chip$.

On a board there are written the integers from $1$ to $119$. Two players, $A$ and $B$, make a move by turn. A $move$ consists in erasing $9$ numbers from the board. The player after whose move two numbers remain on the board wins and his score is equal with the positive difference of the two remaining numbers. The player $A$ makes the first move. Find the highest integer $k$, such that the player $A$ can be sure that his score is not smaller than $k$.

A broken line $A_1A_2 \ldots A_n$ is drawn in a $50 \times 50$ square, so that the distance from any point of the square to the broken line is less than $1$. Prove that its total length is greater than $1248.$

A sequence composed by $0$s and $1$s has at most two consecutive $0$s. How many sequences of length $10$ exist?

Call a set $A$ of integers [i]non-isolated[/i], if for every $a\in A$ at least one of the numbers $a-1$ and $a+1$ also belongs to $A$. Prove that the number of five-element non-isolated subsets of $\{1, 2,\ldots ,n\}$ is $(n-4)^2$.

All sequences of $k$ elements $(a_1,a_2,...,a_k)$ are considered, where each $a_i$ belongs to the set $\{1,2,... ,2021\}$. What is the sum of the smallest elements of all these sequences?

Suppose $s,k,t\in \mathbb N$. We've colored each natural number with one of the $k$ colors, such that each color is used infinitely many times. We want to choose a subset $\mathcal A$ of $\mathbb N$ such that it has $t$ disjoint monochromatic $s$-element subsets. What is the minimum number of elements of $A$? [i]Proposed by Navid Adham[/i]

Consider $S=\{1, 2, 3, \cdots, 6n\}$, $n>1$. Find the largest $k$ such that the following statement is true: every subset $A$ of $S$ with $4n$ elements has at least $k$ pairs $(a,b)$, $a<b$ and $b$ is divisible by $a$.

There are $n$ boyfriend-girlfriend pairs at a party. Initially all the girls sit at a round table. For the first dance, each boy invites one of the girls to dance with.After each dance, a boy takes the girl he danced with to her seat, and for the next dance he invites the girl next to her in the counterclockwise direction. For which values of $n$ can the girls be selected in such a way that in every dance at least one boy danced with his girlfriend, assuming that there are no less than $n$ dances?

Pepito's mother wants to prepare $n$ packages of $3$ candies to give away at the birthday party, and for this she will buy assorted candies of $3$ different flavors. You can buy any number of candies but you can't choose how many of each taste. She wants to put one candy of each flavor in each package, and if this is not possible she will use only candy of one flavor and all the packages will have $3$ candies of that flavor. Determine the least number of candies that must be purchased in order to assemble the n packages. He explains why if he buys fewer candies, he is not sure that he will be able to assemble the packages the way he wants.

Consider the set $\Omega$ formed by the first twenty natural numbers, $\Omega = \{1, 2, . . . , 20\}$ . A nonempty subset $A$ of $\Omega$ is said to be [i]sumfree [/i ] if for all pair of elements$ x, y \in A$, the sum $(x + y)$ is not in $A$, ( $x$ can be equal to $y$). Prove that $\Omega$ has at least $2018$ sumfree subsets.

[b]p1.[/b] A right triangle has hypotenuse of length $12$ cm. The height corresponding to the right angle has length $7$ cm. Is this possible? [img]https://cdn.artofproblemsolving.com/attachments/0/e/3a0c82dc59097b814a68e1063a8570358222a6.png[/img] [b]p2.[/b] Prove that from any $5$ integers one can choose $3$ such that their sum is divisible by $3$. [b]p3.[/b] Two players play the following game on an $8\times 8$ chessboard. The first player can put a knight on an arbitrary square. Then the second player can put another knight on a free square that is not controlled by the first knight. Then the first player can put a new knight on a free square that is not controlled by the knights on the board. Then the second player can do the same, etc. A player who cannot put a new knight on the board loses the game. Who has a winning strategy? [b]p4.[/b] Consider a regular octagon $ABCDEGH$ (i.e., all sides of the octagon are equal and all angles of the octagon are equal). Show that the area of the rectangle $ABEF$ is one half of the area of the octagon. [img]https://cdn.artofproblemsolving.com/attachments/d/1/674034f0b045c0bcde3d03172b01aae337fba7.png[/img] [b]p5.[/b] Can you find a positive whole number such that after deleting the first digit and the zeros following it (if they are) the number becomes $24$ times smaller? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n$ points be given on a circle, and let $nk + 1$ chords between these points be drawn, where $2k+1 < n$. Show that it is possible to select $k+1$ of the chords so that no two of them intersect.

Given $10$ points on a plane such that no three are collinear, we connect each pair of points with a segment and color each segment either red or blue. Assume that there exists some point $A$ among the $10$ points such that: 1. There is an odd number of red segments connected to $A$} 2. The number of red segments connected to each of the other points are all different Find the number of red triangles (i.e, a triangle whose three sides are all red segments) on the plane.

To each point of $\mathbb{Z}^3$ we assign one of $p$ colors. Prove that there exists a rectangular parallelepiped with all its vertices in $\mathbb{Z}^3$ and of the same color.

With $76$ tiles, of which some are white, other blue and the remaining red, they form a rectangle of $4 \times 19$. Show that there is a rectangle, inside the largest, that has its vertices of the same color.

Given $r\in\mathbb{R}$. Alice and Bob plays the following game: An equation with blank is written on the blackboard as below: $$S=|\Box-\Box|+|\Box-\Box|+|\Box-\Box|$$ Every round, Alice choose a real number from $[0,1]$ (not necessary to be different from the numbers chosen before) and Bob fill it in an empty box. After 6 rounds, every blank is filled and $S$ is determined at the same time. If $S\ge r$ then Alice wins, otherwise Bob wins. Find all $r$ such that Alice can guarantee her victory.

Recall that a palindrome is a word which is the same when we read it forward or backward. (a) We have an infinite number of cards with words $\{abc, bca, cab\}$. A word is made from them in the following way. The initial word is an arbitrary card. At each step we obtain a new word either gluing a card (from the right or from the left) to the existing word or making a cut between any two of its letters and gluing a card between both parts. Is it possible to obtain a palindrome this way? [i](4 points)[/i] (b) We have an infinite number of red cards with words $\{abc, bca, cab\}$ and of blue cards with words $\{cba, acb, bac\}$. A palindrome was formed from them in the same way as in part (a). Is it necessarily true that the number of red and blue cards used was equal? [i](6 points)[/i] [i]Alexandr Gribalko, Ivan Mitrofanov [/i]

Find the number of all sequences $ (x_1,...,x_n)$ of letters $ a,b,c$ that satisfy $ x_1\equal{}x_n\equal{}a$ and $ x_i \not\equal{} x_{i\plus{}1}$ for $ 1 \le i \le n\minus{}1.$

For positive integers $t,a$, and $b$, Lucy and Windy play the $(t,a,b)$- [i]game [/i] defined by the following rules. Initially, the number $t$ is written on a blackboard. On her turn, a player erases the number on the board and writes either the number $t - a$ or $t - b$ on the board. Lucy goes first and then the players alternate. The player who first reaches a negative losses the game. Prove that there exist infinitely many values of $t$ in which Lucy has a winning strategy for all pairs $(a, b)$ with $a + b = 2005$.

Decide whether any rectangle that can be covered by 25 circles of radius 2 can also be covered by 100 circles of radius 1.

A red coin is placed in a cell of $2n \times 2n$ board. Every move it can either move like a bishop and change its color (red to blue, blue to red), or move like a knight and not change its color. After some time the coin has visited every cell exactly twice. Prove that the number of cells in which the coin was both red and blue is even. [i]M. Zorka[/i]