Solomiya wrote the numbers $1, 2, \ldots, 2024$ on the board. In one move, she can erase any two numbers $a, b$ from the board and write the sum $a+b$ instead of each of them. After some time, all the numbers on the board became equal. What is the minimum number of moves Solomiya could make to achieve this? [i]Proposed by Oleksiy Masalitin[/i]

For a positive integer \( n \geq 6 \), find the smallest integer \( S(n) \) such that any graph with \( n \) vertices and at least \( S(n) \) edges must contain at least two disjoint cycles (cycles with no common vertices).

In any cell of an $n \times n$ table a number is written such that all the rows are distinct. Prove that we can remove a column such that the rows in the new table are still distinct.

In a test, $3n$ students participate, who are located in three rows of $n$ students in each. The students leave the test room one by one. If $N_1(t), N_2(t), N_3(t)$ denote the numbers of students in the first, second, and third row respectively at time $t$, find the probability that for each t during the test, \[|N_i(t) - N_j(t)| < 2, i \neq j, i, j = 1, 2, \dots .\]

A museum wants to protect its most valuable piece by maintaining constant surveillance. To do this, he wants to place guards to watch the place, in shifts of $7$ consecutive hours. Each guard starts his shift at the same time every day. A guard is essential if there is any time during the day when you are alone to watch the item. Indicates all possibilities for the number of guards guarding the piece, so that everyone is indispensable.

We are given one red and $k>1$ blue cells, and a pack of $2n$ cards, enumerated by the numbers from $1$ to $2n$. Initially, the pack is situated on the red cell and arranged in an arbitrary order. In each move, we are allowed to take the top card from one of the cells and place it either onto the top of another cell on which the number on the top card is greater by $1$, or onto an empty cell. Given $k$, what is the maximal $n$ for which it is always possible to move all the cards onto a blue cell?

$5000$ movie fans gathered at a convention. Each participant had watched at least one movie. The participants should be split into discussion groups of two kinds. In each group of the first kind, the members would discuss a movie they all watched. In each group of the second kind, each member would tell about the movie that no one else in this group had watched. Prove that the chairman can always split the participants into exactly 100 groups. (A group consisting of one person is allowed; in this case this person submits a report).

In a regular 100-gon, 41 vertices are colored black and the remaining 59 vertices are colored white. Prove that there exist 24 convex quadrilaterals $Q_{1}, \ldots, Q_{24}$ whose corners are vertices of the 100-gon, so that [list] [*] the quadrilaterals $Q_{1}, \ldots, Q_{24}$ are pairwise disjoint, and [*] every quadrilateral $Q_{i}$ has three corners of one color and one corner of the other color. [/list]

The captain distributed $4000$ gold coins among $40$ pirates. A group of $5$ pirates is called poor if those $5$ pirates received, together, $500$ coins or less. The captain made the distribution so that there were the minimum possible number of poor groups of $5$ pirates. Determine how many poor $5$ pirate groups there are. Clarification: Two groups of $5$ pirates are considered different if there is at least one pirate in one of them who is not in the other.

[list] [*] A test was conducted in class. It is known that at least $\frac{2}{3}$ of the problems were hard. Each such problems were not solved by at least $\frac{2}{3}$ of the students. It is also known that at least $\frac{2}{3}$ of the students passed the test. Each such student solved at least $\frac{2}{3}$ of the suggested problems. Is this possible? [*] Previous problem with $\frac{2}{3}$ replaced by $\frac{3}{4}$. [*] Previous problem with $\frac{2}{3}$ replaced by $\frac{7}{10}$.[/list]

Let $S$ be the set of $10$-tuples of non-negative integers that have sum $2019$. For any tuple in $S$, if one of the numbers in the tuple is $\geq 9$, then we can subtract $9$ from it, and add $1$ to the remaining numbers in the tuple. Call thus one operation. If for $A,B\in S$ we can get from $A$ to $B$ in finitely many operations, then denote $A\rightarrow B$. (1) Find the smallest integer $k$, such that if the minimum number in $A,B\in S$ respectively are both $\geq k$, then $A\rightarrow B$ implies $B\rightarrow A$. (2) For the $k$ obtained in (1), how many tuples can we pick from $S$, such that any two of these tuples $A,B$ that are distinct, $A\not\rightarrow B$.

[u]Round 1 [/u] [b]p1.[/b] Ben the bear has an algorithm he runs on positive integers- each second, if the integer is even, he divides it by $2$, and if the integer is odd, he adds $1$. The algorithm terminates after he reaches $1$. What is the least positive integer n such that Ben's algorithm performed on n will terminate after seven seconds? (For example, if Ben performed his algorithm on $3$, the algorithm would terminate after $3$ seconds: $3 \to 4 \to 2 \to 1$.) [b]p2.[/b] Suppose that a rectangle $R$ has length $p$ and width $q$, for prime integers $p$ and $q$. Rectangle $S$ has length $p + 1$ and width $q + 1$. The absolute difference in area between $S$ and $R$ is $21$. Find the sum of all possible values of $p$. [b]p3.[/b] Owen the origamian takes a rectangular $12 \times 16$ sheet of paper and folds it in half, along the diagonal, to form a shape. Find the area of this shape. [u]Round 2[/u] [b]p4.[/b] How many subsets of the set $\{G, O, Y, A, L, E\}$ contain the same number of consonants as vowels? (Assume that $Y$ is a consonant and not a vowel.) [b]p5.[/b] Suppose that trapezoid $ABCD$ satisfies $AB = BC = 5$, $CD = 12$, and $\angle ABC = \angle BCD = 90^o$. Let $AC$ and $BD$ intersect at $E$. The area of triangle $BEC$ can be expressed as $\frac{a}{b}$, for positive integers $a$ and $b$ with $gcd(a, b) = 1$. Find $a + b$. [b]p6.[/b] Find the largest integer $n$ for which $\frac{101^n + 103^n}{101^{n-1} + 103^{n-1}}$ is an integer. [u]Round 3[/u] [b]p7.[/b] For each positive integer n between $1$ and $1000$ (inclusive), Ben writes down a list of $n$'s factors, and then computes the median of that list. He notices that for some $n$, that median is actually a factor of $n$. Find the largest $n$ for which this is true. [b]p8.[/b] ([color=#f00]voided[/color]) Suppose triangle $ABC$ has $AB = 9$, $BC = 10$, and $CA = 17$. Let $x$ be the maximal possible area of a rectangle inscribed in $ABC$, such that two of its vertices lie on one side and the other two vertices lie on the other two sides, respectively. There exist three rectangles $R_1$, $R_2$, and $R_3$ such that each has an area of $x$. Find the area of the smallest region containing the set of points that lie in at least two of the rectangles $R_1$, $R_2$, and $R_3$. [b]p9.[/b] Let $a, b,$ and $c$ be the three smallest distinct positive values of $\theta$ satisfying $$\cos \theta + \cos 3\theta + ... + \cos 2021\theta = \sin \theta+ \sin 3 \theta+ ... + \sin 2021\theta. $$ What is $\frac{4044}{\pi}(a + b + c)$? [color=#f00]Problem 8 is voided. [/color] PS. You should use hide for answers.Rounds 4-5 have been posted [url=https://artofproblemsolving.com/community/c4h3131422p28368457]here [/url] and 6-7 [url=https://artofproblemsolving.com/community/c4h3131434p28368604]here [/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

The teacher reported to Peter an odd integer $m \le 2013$ and gave the guy a homework. Petrick should star the cells in the $2013 \times 2013$ table so to make the condition true: if there is an asterisk in some cell in the table, then or in row or column containing this cell should be no more than $m$ stars (including this one). Thus in each cell of the table the guy can put at most one star. The teacher promised Peter that his assessment would be just the number of stars that the guy will be able to place. What is the greatest number will the stars be able to place in the table Petrick?

$65$ distinct natural numbers not exceeding $2016$ are given. Prove that among these numbers we can find four $a,b,c,d$ such that $a+b-c-d$ is divisible by $2016.$

A $(2n + 1) \times (2n + 1)$ grid, with $n> 0$, is colored in such a way that each of the cell is white or black. A cell is called [i]special[/i] if there are at least $n$ other cells of the same color in its row, and at least another $n$ cells of the same color in its column. (a) Prove that there are at least $2n + 1$ special boxes. (b) Provide an example where there are at most $4n$ special cells. (c) Determine, as a function of $n$, the minimum possible number of special cells.

There are $2003$ coins distributed in several bags. The bags are then distributed in several pockets. It is known that the total number of bags is greater than the number of coins in each of the pockets. Is it true that the total number of pockets is greater than the number of coins in some of the bags?

Is it possible to put distinct positive integers less than $1991$ in the cells of a $9\times 9$ table so that the products of all the numbers in every column and every row are equal to each other? (N.B. Vasiliev, Moscow)

The cells of an $n\times n$ table ($n\ge 3$) are painted black and white in the chess-like manner. Per move one can choose any $2\times 2$ square and reverse the color of the cells inside it. Find all $n$ for which one can obtain a table with all cells of the same color after finitely many such moves.

Let $M = \{(a,b,c,d)|a,b,c,d \in \{1,2,3,4\} \text{ and } abcd > 1\}$. For each $n\in \{1,2,\dots, 254\}$, the sequence $(a_1, b_1, c_1, d_1)$, $(a_2, b_2, c_2, d_2)$, $\dots$, $(a_{255}, b_{255},c_{255},d_{255})$ contains each element of $M$ exactly once and the equality \[|a_{n+1} - a_n|+|b_{n+1} - b_n|+|c_{n+1} - c_n|+|d_{n+1} - d_n| = 1\] holds. If $c_1 = d_1 = 1$, find all possible values of the pair $(a_1,b_1)$.

Let $n$ be an integer greater than $1$. In how many ways can we fill all the numbers $1, 2,..., 2n$ in the boxes of a grid of $2\times n$, one in each box, so that any two consecutive numbers are they in squares that share one side of the grid?

Show that there exists an integer $N$ such that for all $n \ge N$ a square can be partitioned into $n$ smaller squares.

Quadrilaterals may be obtained from an octagon by cutting along its diagonals (in $8$ different ways) . Can it happen that among these $8$ quadrilaterals (a) four (b ) five possess an inscribed circle? (P. M . Sedrakyan , Yerevan)

Given is a cube $3 \times 3 \times 3$ with $27$ unit cubes. In each such cube a positive integer is written. Call a $\textit {strip}$ a block $1 \times 1 \times 3$ of $3$ cubes. The numbers are written so that for each cube, its number is the sum of three other numbers, one from each of the three strips it is in. Prove that there are at least $16$ numbers that are at most $60$.

a) On a circumference $8$ points are marked. We say that Juliana does an “T-operation ” if she chooses three of these points and paint the sides of the triangle that they determine, so that each painted triangle has at most one vertex in common with a painted triangle previously. What is the greatest number of “T-operations” that Juliana can do? b) If in part (a), instead of considering $8$ points, $7$ points are considered, what is the greatest number of “T operations” that Juliana can do?

Find the smallest positive integer $n$ such that if we color in red $n$ arbitrary vertices of the cube , there will be a vertex of the cube which has the three vertices adjacent to it colored in red.