The endpoints of a compass are at two lattice points of an infinite unit square grid. It is allowed to rotate the compass around one of its endpoints, not varying its radius, and thus move the other endpoint to another lattice point. Can the endpoints of the compass change places after several such steps?

A man disposes of sufficiently many metal bars of length $2$ and wants to construct a grill of the shape of an $n \times n$ unit net. He is allowed to fold up two bars at an endpoint or to cut a bar into two equal pieces, but two bars may not overlap or intersect. What is the minimum number of pieces he must use?

A strongman Bambula can carry several weights at the same time, if their total weight does not exceed $200$ kg, and these weights are no more than three. On the way to work, he injured his finger and found that he could now carry no more than two weights (and still no more than $200$ kg). At what minimum $k$ is the statement true: [i]any set of $100$ weights that Bambula could previously carry in $50$ runs, with a sore finger, he will be able to carry in no more than $k$ runs?[/i]

There are 20 people at a party. Each person holds some number of coins. Every minute, each person who has at least 19 coins simultaneously gives one coin to every other person at the party. (So, it is possible that $A$ gives $B$ a coin and $B$ gives $A$ a coin at the same time.) Suppose that this process continues indefinitely. That is, for any positive integer $n$, there exists a person who will give away coins during the $n$th minute. What is the smallest number of coins that could be at the party? [i]Proposed by Ray Li[/i]

A table is covered by $15$ pieces of paper. Show that we can remove $7$ pieces so that the remaining $8$ cover at least $8/15$ of the table.

[b]p1.[/b] Let $a$ and $b$ be complex numbers such that $a^3 + b^3 = -17$ and $a + b = 1$. What is the value of $ab$? [b]p2.[/b] Let $AEFB$ be a right trapezoid, with $\angle AEF = \angle EAB = 90^o$. The two diagonals $EB$ and $AF$ intersect at point $D$, and $C$ is a point on $AE$ such that $AE \perp DC$. If $AB = 8$ and $EF = 17$, what is the lenght of $CD$? [b]p3.[/b] How many three-digit numbers $abc$ (where each of $a$, $b$, and $c$ represents a single digit, $a \ne 0$) are there such that the six-digit number $abcabc$ is divisible by $2$, $3$, $5$, $7$, $11$, or $13$? [b]p4.[/b] Let $S$ be the sum of all numbers of the form $\frac{1}{n}$ where $n$ is a postive integer and $\frac{1}{n}$ terminales in base $b$, a positive integer. If $S$ is $\frac{15}{8}$, what is the smallest such $b$? [b]p5.[/b] Sysyphus is having an birthday party and he has a square cake that is to be cut into $25$ square pieces. Zeus gets to make the first straight cut and messes up badly. What is the largest number of pieces Zeus can ruin (cut across)? Diagram? [b]p6.[/b] Given $(9x^2 - y^2)(9x^2 + 6xy + y^2) = 16$ and $3x + y = 2$. Find $x^y$. [b]p7.[/b] What is the prime factorization of the smallest integer $N$ such that $\frac{N}{2}$ is a perfect square, $\frac{N}{3}$ is a perfect cube, $\frac{N}{5}$ is a perfect fifth power? [b]p8.[/b] What is the maximum number of pieces that an spherical watermelon can be divided into with four straight planar cuts? [b]p9.[/b] How many ordered triples of integers $(x,y,z)$ are there such that $0 \le x, y, z \le 100$ and $$(x - y)^2 + (y - z)^2 + (z - x)^2 \ge (x + y - 2z) + (y + z - 2x)^2 + (z + x - 2y)^2.$$ [b]p10.[/b] Find all real solutions to $(2x - 4)^2 + (4x - 2)^3 = (4x + 2x - 6)^3$. [b]p11.[/b] Let $f$ be a function that takes integers to integers that also has $$f(x)=\begin{cases} x - 5\,\, if \,\, x \ge 50 \\ f (f (x + 12)) \,\, if \,\, x < 50 \end{cases}$$ Evaluate $f (2) + f (39) + f (58).$ [b]p12.[/b] If two real numbers are chosen at random (i.e. uniform distribution) from the interval $[0,1]$, what is the probability that theit difference will be less than $\frac35$? [b]p13.[/b] Let $a$, $b$, and $c$ be positive integers, not all even, such that $a < b$, $b = c - 2$, and $a^2 + b^2 = c^2$. What is the smallest possible value for $c$? [b]p14.[/b] Let $ABCD$ be a quadrilateral whose diagonals intersect at $O$. If $BO = 8$, $OD = 8$, $AO = 16$, $OC = 4$, and $AB = 16$, then find $AD$. [b]p15.[/b] Let $P_0$ be a regular icosahedron with an edge length of $17$ units. For each nonnegative integer $n$, recursively construct $P_{n+1}$ from Pn by performing the following procedure on each face of $P_n$: glue a regular tetrahedron to that face such that three of the vertices of the tetrahedron are the midpoints of the three adjacent edges of the face, and the last vertex extends outside of $P_n$. Express the number of square units in the surface area of $P_{17}$ in the form $$\frac{u^v\cdot w \sqrt{x}}{y^z}$$ , where $u, v, w, x, y$, and $z$ are integers, all greater than or equal to $2$, that satisfy the following conditions: the only perfect square that evenly divides $x$ is $1$, the GCD of $u$ and y is $1$, and neither $u$ nor $y$ divides $w$. Answers written in any other form will not be considered correct! PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Each lottery ticket has a 9-digit numbers, which uses only the digits $1$, $2$, $3$. Each ticket is colored [color=red]red[/color],[color=blue] blue [/color]or [color=green]green[/color]. If two tickets have numbers which differ in all nine places, then the tickets have different colors. Ticket $122222222$ is red, and ticket $222222222$ is [color=green]green.[/color] What color is ticket $123123123$ ?

There are $n$ points in general position in space (no three lie on the same straight line, no four lie in the same plane). A plane is drawn through every three of them. Prove that If you take any whatever $n-3$ points in space, there is a plane from those drawn that does not contain any of these $n - 3$ points.

The $100 \times 100$ table is filled with numbers from $1$ to $10 \ 000$ as shown in the figure. Is it possible to rearrange some numbers so that there is still one number in each cell, and so that the sum of the numbers does not change in all rectangles of three cells?

Let $G$ be a bipartite graph in which the greatest degree of a vertex is 2019. Let $m$ be the least natural number for which we can color the edges of $G$ in $m$ colors so that each two edges with a common vertex from $G$ are in different colors. Show that $m$ doesn’t depend on $G$ and find its value.

A chess tournament is held with the participation of boys and girls. The girls are twice as many as boys. Each player plays against each other player exactly once. By the end of the tournament, there were no draws and the ratio of girl winnings to boy winnings was $\frac{7}{9}$. How many players took part at the tournament?

Let $n$ and $k$ be positive integers. Chef Kao cuts a circular pizza through $k$ diameters, dividing the pizza into $2k$ equal pieces. Then, he dresses the pizza with $n$ toppings. For each topping, he chooses $k$ consecutive pieces of pizza and puts that topping on all of the chosen pieces. Then, for each piece of pizza, Chef Kao counts the number of distinct toppings on it, yielding $2k$ numbers. Among these numbers, let $m$ and $M$ being the minimum and maximum, respectively. Prove that $m + M = n$.

The cells of a $(n^2-n+1)\times(n^2-n+1)$ matrix are coloured using $n$ colours. A colour is called [i]dominant[/i] on a row (or a column) if there are at least $n$ cells of this colour on that row (or column). A cell is called [i]extremal[/i] if its colour is [i]dominant [/i] both on its row, and its column. Find all $n \ge 2$ for which there is a colouring with no [i]extremal [/i] cells. Iurie Boreico (Moldova)

Call a number unremarkable if, when written in base $10$, no two adjacent digits are equal. For example, $123$ is unremarkable, but $122$ is not. Find the sum of all unremarkable $3$-digit numbers. (Note that $012$ and $007$ are not $3$-digit numbers.)

$2019$ point grasshoppers sit on a line. At each move one of the grasshoppers jumps over another one and lands at the point the same distance away from it. Jumping only to the right, the grasshoppers are able to position themselves so that some two of them are exactly $1$ mm apart. Prove that the grasshoppers can achieve the same, jumping only to the left and starting from the initial position. (Sergey Dorichenko)

In a convex regular $35$-gon $15$ vertices are colored in red. Are there always three red vertices that make an isosceles triangle?

Petya has $10, 000$ balls, among them there are no two balls of equal weight. He also has a device, which works as follows: if he puts exactly $10$ balls on it, it will report the sum of the weights of some two of them (but he doesn't know which ones). Prove that Petya can use the device a few times so that after a while he will be able to choose one of the balls and accurately tell its weight.

A $\pm 1$-[i]sequence[/i] is a sequence of $2022$ numbers $a_1, \ldots, a_{2022},$ each equal to either $+1$ or $-1$. Determine the largest $C$ so that, for any $\pm 1$-sequence, there exists an integer $k$ and indices $1 \le t_1 < \ldots < t_k \le 2022$ so that $t_{i+1} - t_i \le 2$ for all $i$, and $$\left| \sum_{i = 1}^{k} a_{t_i} \right| \ge C.$$

Peer and Solveig are playing a game with $n$ coins, all of which show $M$ on one side and $K$ on the opposite side. The coins are laid out in a row on the table. Peer and Solveig alternate taking turns. On his turn, Peer may turn over one or more coins, so long as he does not turn over two adjacent coins. On her turn, Solveig picks precisely two adjacent coins and turns them over. When the game begins, all the coins are showing $M$. Peer plays first, and he wins if all the coins show $K$ simultaneously at any time. Find all $n\geqslant 2$ for which Solveig can keep Peer from winning.

Find all positive integers $N$ such that an $N\times N$ board can be tiled using tiles of size $5\times 5$ or $1\times 3$. Note: The tiles must completely cover all the board, with no overlappings.

One hundred red points and one hundred blue points are chosen in the plane, no three of them lying on a line. Show that these points can be connected pairwise, red ones with blue ones, by disjoint line segments.

There are $2018$ players sitting around a round table. At the beginning of the game we arbitrarily deal all the cards from a deck of $K$ cards to the players (some players may receive no cards). In each turn we choose a player who draws one card from each of the two neighbors. It is only allowed to choose a player whose each neighbor holds a nonzero number of cards. The game terminates when there is no such player. Determine the largest possible value of $K$ such that, no matter how we deal the cards and how we choose the players, the game always terminates after a finite number of turns. [i]Proposed by Peter Novotný, Slovakia[/i]

Let $n \ge 3$ be an integer, and consider a $n \times n$-board, divided into $n^2$ unit squares. For all $m \ge 1$, arbitrarily many $1\times m$-rectangles (type I) and arbitrarily many $m\times 1$-rectangles (type II) are available. We cover the board with $N$ such rectangles, without overlaps, and such that every rectangle lies entirely inside the board. We require that the number of type I rectangles used is equal to the number of type II rectangles used.(Note that a $1 \times 1$-rectangle has both types.) What is the minimal value of $N$ for which this is possible?

A [i]stick[/i] is defined as a $1 \times k$ or $k\times 1$ rectangle for any integer $k \ge 1$. We wish to partition the cells of a $2022 \times 2022$ chessboard into $m$ non-overlapping sticks, such that any two of these $m$ sticks share at most one unit of perimeter. Determine the smallest $m$ for which this is possible. [i]Holden Mui[/i]

There are $10$ cups, each having $10$ pebbles in them. Two players $A$ and $B$ play a game, repeating the following in order each move: $\bullet$ $B$ takes one pebble from each cup and redistributes them as $A$ wishes. $\bullet$ After $B$ distributes the pebbles, he tells how many pebbles are in each cup to $A$. Then $B$ destroys all the cups having no pebbles. $\bullet$ $B$ switches the places of two cups without telling $A$. After finitely many moves, $A$ can guarantee that $n$ cups are destroyed. Find the maximum possible value of $n$. (Note that $A$ doesn't see the cups while playing.) [i]Proposed by Emre Osman[/i]