Five identical empty buckets of $2$-liter capacity stand at the vertices of a regular pentagon. Cinderella and her wicked Stepmother go through a sequence of rounds: At the beginning of every round, the Stepmother takes one liter of water from the nearby river and distributes it arbitrarily over the five buckets. Then Cinderella chooses a pair of neighbouring buckets, empties them to the river and puts them back. Then the next round begins. The Stepmother goal's is to make one of these buckets overflow. Cinderella's goal is to prevent this. Can the wicked Stepmother enforce a bucket overflow? [i]Proposed by Gerhard Woeginger, Netherlands[/i]

Given are $8$ weights weighing $1, 2, . . . , 8$ grams, but it is not known which one how much does it weigh. Baron Munchausen claims that he remembers which of the weights weighs how much, and to prove that he is right he is ready to conduct one weighing, as a result of which the weight of at least one of the weights will be unambiguously established. Is he cheating?

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.

Given a $m \times n$ rectangle where $m,n\geq 2023$. The square in the $i$-th row and $j$-th column is filled with the number $i+j$ for $1\leq i \leq m, 1\leq j \leq n$. In each move, Alice can pick a $2023 \times 2023$ subrectangle and add $1$ to each number in it. Alice wins if all the numbers are multiples of $2023$ after a finite number of moves. For which pairs $(m,n)$ can Alice win? [i]Proposed by Boon Qing Hong[/i]

We may permute the rows and the columns of the table below. How may different tables can we generate? 1 2 3 4 5 6 7 7 1 2 3 4 5 6 6 7 1 2 3 4 5 5 6 7 1 2 3 4 4 5 6 7 1 2 3 3 4 5 6 7 1 2 2 3 4 5 6 7 1

In a graph with $8$ vertices that contains no cycle of length $4$, at most how many edges can there be?

A $10$ digit number is called interesting if its digits are distinct and is divisible by $11111$. Then find the number of interesting numbers.

On the plane are given $ k\plus{}n$ distinct lines , where $ k>1$ is integer and $ n$ is integer as well.Any three of these lines do not pass through the same point . Among these lines exactly $ k$ are parallel and all the other $ n$ lines intersect each other.All $ k\plus{}n$ lines define on the plane a partition of triangular , polygonic or not bounded regions. Two regions are colled different, if the have not common points or if they have common points only on their boundary.A regions is called ''good'' if it contained in a zone between two parallel lines . If in a such given configuration the minimum number of ''good'' regionrs is $ 176$ and the maximum number of these regions is $ 221$, find $ k$ and $ n$. Babis

The sides of a 99-gon are initially colored so that consecutive sides are red, blue, red, blue, $\,\ldots, \,$ red, blue, yellow. We make a sequence of modifications in the coloring, changing the color of one side at a time to one of the three given colors (red, blue, yellow), under the constraint that no two adjacent sides may be the same color. By making a sequence of such modifications, is it possible to arrive at the coloring in which consecutive sides are red, blue, red, blue, red, blue, $\, \ldots, \,$ red, yellow, blue?

Consider the string of length $6$ composed of three characters $a, b, c$. For each string, if two $a$s are next to each other, or two $b$s are next to each other, then replace $aa$ by $b$, and replace $bb$ by $a$. Also, if $a$ and $b$ are next to each other, or two $c$s are next to each other, remove all two of them (i.e. delete $ab, ba, cc$). Determine the number of strings that can be reduced to $c$, the string of length $1$, by the reducing processes mentioned above.

Four coins are laid out on a table so that they form the corners of a square. One move consists of tipping one of the coins by letting it jump over one of the others the coin so that it ends up on the directly opposite side of the other coin, the same distance from as it was before the move was made. Is it possible to make a number of moves so that the coins ends up in the corners of a square with a different side length than the original square?

A tournament is arranged amongst a finite number of people. Every person plays every other person just once and each game results in a win to one of the players (there are no draws). Show that there must a person $X$ such that, given any other person $Y$ in the tournament, either $X$ beat $Y$ , or $X$ beat $Z$ and $Z$ beat $Y$ for some $Z$.

In a table consisting of $2021\times 2021$ unit squares, some unit squares are colored black in such a way that if we place a mouse in the center of any square on the table it can walk in a straight line (up, down, left or right along a column or row) and leave the table without walking on any black square (other than the initial one if it is black). What is the maximum number of squares that can be colored black?

Show that there is a set of $2002$ consecutive positive integers containing exactly $150$ primes. (You may use the fact that there are $168$ primes less than $1000$)

2010 MOPpers are assigned numbers 1 through 2010. Each one is given a red slip and a blue slip of paper. Two positive integers, A and B, each less than or equal to 2010 are chosen. On the red slip of paper, each MOPper writes the remainder when the product of A and his or her number is divided by 2011. On the blue slip of paper, he or she writes the remainder when the product of B and his or her number is divided by 2011. The MOPpers may then perform either of the following two operations: [list] [*] Each MOPper gives his or her red slip to the MOPper whose number is written on his or her blue slip. [*] Each MOPper gives his or her blue slip to the MOPper whose number is written on his or her red slip.[/list] Show that it is always possible to perform some number of these operations such that each MOPper is holding a red slip with his or her number written on it. [i]Brian Hamrick.[/i]

Consider the $4(N-1)$ squares on the boundary of an $N$ by $N$ array of squares. We wish to insert in these squares $4 (N-1)$ consecutive integers (not necessarily positive) so that the sum of the numbers at the four vertices of any rectangle with sides parallel to the diagonals of the array (in the case of a “degenerate” rectangle, i.e. a diagonal, we refer to the sum of the two numbers in its corner squares) are one and the same number. Is this possible? Consider the cases (a) $N = 3$ (b) $N = 4$ (c) $N = 5$ (VG Boltyanskiy, Moscow)

$n$ cockroaches are sitting on the plane at the vertices of the regular $ n $ -gon. They simultaneously begin to move at a speed of $ v $ on the sides of the polygon in the direction of the clockwise adjacent cockroach, then they continue moving in the initial direction with the initial speed. Vasya a entomologist moves on a straight line in the plane at a speed of $u$. After some time, it turned out that Vasya has crushed three cockroaches. Prove that $ v = u $.

A group of $4046$ friends will play a videogame tournament. For that, $2023$ of them will go to one room which the computers are labeled with $a_1,a_2,\dots,a_{2023}$ and the other $2023$ friends go to another room which the computers are labeled with $b_1,b_2,\dots,b_{2023}$. The player of computer $a_i$ [b]always[/b] challenges the players of computer $b_i,b_{i+2},b_{i+3},b_{i+4}$(the player doesn't challenge $b_{i+1}$). After the first round, inside both rooms, the players may switch the computers. After the reordering, all the players realize that they are challenging the same players of the first round. Prove that if [b]one[/b] player has [b]not[/b] switched his computer, then all the players have not switched their computers.

Consider the set of axis-aligned boxes in $R^d$ , $B(a, b) = \{x \in R^d: \forall i, a_i \le x_i \le b_i\}$ where $a, b \in R^d$. In terms of $d$, what is the maximum number $n$, such that there exists a set of $n$ points $S =\{x_1, ..., x_n\}$ such that no matter how one partition $S = P \cup Q$ with $P, Q$ disjoint and $P, Q$ can possibly be empty, there exists a box $B$ such that all the points in $P$ are contained in $B$, and all the points in $Q$ are outside $B$?

An isosceles trapezium is called [i]right[/i] if only one pair of its sides are parallel (i.e parallelograms are not right). A dissection of a rectangle into $n$ (can be different shapes) right isosceles trapeziums is called [i]strict[/i] if the union of any $i,(2\leq i \leq n)$ trapeziums in the dissection do not form a right isosceles trapezium. Prove that for any $n, n\geq 9$ there is a strict dissection of a $2017 \times 2018$ rectangle into $n$ right isosceles trapeziums. [i]Proposed by Bojan Basic[/i]

[u]Round 1[/u] [b]1.1.[/b] A person asks for help every $3$ seconds. Over a time period of $5$ minutes, how many times will they ask for help? [b]1.2.[/b] In a big bag, there are $14$ red marbles, $15$ blue marbles, and$ 16$ white marbles. If Anuj takes a marble out of the bag each time without replacement, how many marbles does Anuj need to remove to be sure that he will have at least $3$ red marbles? [b]1.3.[/b] If Josh has $5$ distinct candies, how many ways can he pick $3$ of them to eat? [u]Round 2[/u] [b]2.1.[/b] Annie has a circular pizza. She makes $4$ straight cuts. What is the minimum number of slices of pizza that she can make? [b]2.2.[/b] What is the sum of the first $4$ prime numbers that can be written as the sum of two perfect squares? [b]2.3.[/b] Consider a regular octagon $ABCDEFGH$ inscribed in a circle of area $64\pi$. If the length of arc $ABC$ is $n\pi$, what is $n$? [u]Round 3[/u] [b]3.1.[/b] Let $ABCDEF$ be an equiangular hexagon with consecutive sides of length $6, 5, 3, 8$, and $3$. Find the length of the sixth side. [b]3.2.[/b] Jack writes all of the integers from $ 1$ to $ n$ on a blackboard except the even primes. He selects one of the numbers and erases all of its digits except the leftmost one. He adds up the new list of numbers and finds that the sum is $2020$. What was the number he chose? [b]3.3.[/b] Our original competition date was scheduled for April $11$, $2020$ which is a Saturday. The numbers $4116$ and $2020$ have the same remainder when divided by $x$. If $x$ is a prime number, find the sum of all possible $x$. [u]Round 4[/u] [b]4.1.[/b] The polynomials $5p^2 + 13pq + cq^2$ and $5p^2 + 13pq - cq^2$ where $c$ is a positive integer can both be factored into linear binomials with integer coefficients. Find $c$. [b]4.2.[/b] In a Cartesian coordinate plane, how many ways are there to get from $(0, 0)$ to $(2, 3)$ in $7$ moves, if each move consists of a moving one unit either up, down, left, or right? [b]4.3.[/b] Bob the Builder is building houses. On Monday he finds an empty field. Each day starting on Monday, he finishes building a house at noon. On the $n$th day, there is a $\frac{n}{8}$ chance that a storm will appear at $3:14$ PM and destroy all the houses on the field. At any given moment, Bob feels sad if and only if there is exactly $1$ house left on the field that is not destroyed. The probability that he will not be sad on Friday at $6$ PM can be expressed as $p/q$ in simplest form. Find $p + q$. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2784570p24468605]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There are $2024$ people, which are knights and liars and some of them are friends. Every person is asked for the number of their friends and the answers were $0,1, \ldots, 2023$. Every knight answered truthfully, while every liar changed the real answer by exactly $1$. What is the minimal number of liars?

Give a square of side $1$. Show that for each finite set of points of the sides of the square you can find a vertex of the square with the following property: the arithmetic mean of the squares of the distances from this vertex to the points of the set is greater than or equal to $3/4$.

In a game two players alternately choose larger natural numbers. At each turn the difference between the new and the old number must be greater than zero but smaller than the old number. The original number is 2. The winner is considered to be the player who chooses the number $1987$. In a perfect game, which player wins?

Tetris is a Soviet block game developed in $1984$, probably to torture misbehaving middle school children. Nowadays, Tetris is a game that people play for fun, and we even have a mini-event featuring it, but it shall be used on this test for its original purpose. The $7$ Tetris pieces, which will be used in various problems in this theme, are as follows: [img]https://cdn.artofproblemsolving.com/attachments/b/c/f4a5a2b90fcf87968b8f2a1a848ad32ef52010.png[/img] [b]p1.[/b] Each piece has area $4$. Find the sum of the perimeters of each of the $7$ Tetris pieces. [b]p2.[/b] In a game of Tetris, Qinghan places $4$ pieces every second during the first $2$ minutes, and $2$ pieces every second for the remainder of the game. By the end of the game, her average speed is $3.6$ pieces per second. Find the duration of the game in seconds. [b]p3.[/b] Jeff takes all $7$ different Tetris pieces and puts them next to each other to make a shape. Each piece has an area of $4$. Find the least possible perimeter of such a shape. [b]p4.[/b] Qepsi is playing Tetris, but little does she know: the latest update has added realistic physics! She places two blocks, which form the shape below. Tetrominoes $ABCD$ and $EFGHI J$ are both formed from $4$ squares of side length $1$. Given that $CE = CF$, the distance from point $I$ to the line $AD$ can be expressed as $\frac{A\sqrt{B}-C}{D}$ . Find $1000000A+10000B +100C +D$. [img]https://cdn.artofproblemsolving.com/attachments/9/a/5e96a855b9ebbfd3ea6ebee2b19d7c0a82c7c3.png[/img] [b]p5.[/b] Using the following tetrominoes: [img]https://cdn.artofproblemsolving.com/attachments/3/3/464773d41265819c4f452116c1508baa660780.png[/img] Find the number of ways to tile the shape below, with rotation allowed, but reflection disallowed: [img]https://cdn.artofproblemsolving.com/attachments/d/6/943a9161ff80ba23bb8ddb5acaf699df187e07.png[/img] PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].