Let \(L_3 = \{3\}\), \(L_n = \{3, 4, \ldots, h\}\) (where \(h > 3\)). For any given integer \(n \geq 3\), consider a graph \(G\) with \(n\) vertices that contains a Hamiltonian cycle \(C\) and has more than \(\frac{n^2}{4}\) edges. For which lengths \(l \in L_n\) must the graph \(G\) necessarily contain a cycle of length \(l\)?

There is a frog jumping on a $ 2k \times 2k$ chessboard, composed of unit squares. The frog's jumps are $ \sqrt{1 \plus{} k^2}$ long and they carry the frog from the center of a square to the center of another square. Some $ m$ squares of the board are marked with an $ \times$, and all the squares into which the frog can jump from an $ \times$'d square (whether they carry an $ \times$ or not) are marked with an $ \circ$. There are $ n$ $ \circ$'d squares. Prove that $ n \ge m$.

A [i]Nim-style game[/i] is defined as follows. Two positive integers $k$ and $n$ are specified, along with a finite set $S$ of $k$-tuples of integers (not necessarily positive). At the start of the game, the $k$-tuple $(n, 0, 0, ..., 0)$ is written on the blackboard. A legal move consists of erasing the tuple $(a_1,a_2,...,a_k)$ which is written on the blackboard and replacing it with $(a_1+b_1, a_2+b_2, ..., a_k+b_k)$, where $(b_1, b_2, ..., b_k)$ is an element of the set $S$. Two players take turns making legal moves, and the first to write a negative integer loses. In the event that neither player is ever forced to write a negative integer, the game is a draw. Prove that there is a choice of $k$ and $S$ with the following property: the first player has a winning strategy if $n$ is a power of 2, and otherwise the second player has a winning strategy. [i]Proposed by Linus Hamilton[/i]

Six assassins, numbered 1-6, stand in a circle. Each assassin is randomly assigned a target such that each assassin has a different target and no assassin is their own target. In increasing numerical order, each assassin, if they are still alive, kills their target. Find the expected number of assassins still alive at the end of this process. [i]Proposed by Allen Yang[/i]

The price of $175$ Humpties is more than the price of $125$ Dumpties but less than that of $126$ Dumpties. Prove that you cannot buy three Humpties and one Dumpty for (a) $80$ cents. (b) $1$ dollar. (S Fomin, Leningrad) PS. (a) for Juniors , (a),(b) for Seniors

We say that a finite set $\mathcal{S}$ of points in the plane is [i]balanced[/i] if, for any two different points $A$ and $B$ in $\mathcal{S}$, there is a point $C$ in $\mathcal{S}$ such that $AC=BC$. We say that $\mathcal{S}$ is [i]centre-free[/i] if for any three different points $A$, $B$ and $C$ in $\mathcal{S}$, there is no points $P$ in $\mathcal{S}$ such that $PA=PB=PC$. (a) Show that for all integers $n\ge 3$, there exists a balanced set consisting of $n$ points. (b) Determine all integers $n\ge 3$ for which there exists a balanced centre-free set consisting of $n$ points. Proposed by Netherlands

Two players play the following game: alternatively they write numbers $1$ or $0$ in the vertices of an $n$-gon. First player starts the game and wins if after any of his moves there exists a triangle, whose vertices are three consecutive vertices of the $n$-gon, such that the sum of numbers in it's vertices is divisible by $3$. Second player wins if he prevents this. Determine which player has a winning strategy if: a) $n=2019$ b) $n=2020$ c) $n=2021$

Several square-shaped papers are situated on a table such that every side of the paper is positioned parallel to the sides of the table. Each paper has a colour, and there are $n$ different coloured papers. It is known that for every $n$ papers with distinct colors, we can always find an overlapping pair of papers. Prove that, using $2n- 2$ nails, it is possible to hammer all the squares of a certain colour to the table.

In the figure we see the paths connecting the square of a city (point $P$) with the school (point $S$). In the square there are $k$ pupils starting to go to the school. They have the ability to move only to the right and up. If the pupils are free to choose any allowed path (in order to get to school), determine the minimum value of $k$ so that in any case at least two pupils follow the same path. [img]https://cdn.artofproblemsolving.com/attachments/e/2/b5d6c6db5942cb706428cb63af3ca15590727f.png[/img]

In a $100$ by $100$ grid, there is a spider and $100$ bugs. Each time, the spider can walk up, down, left or right, and the spider aims to visit all the squares with bugs to eat them all. The spider begins from the top-left corner. Show that no matter where the bugs are, the spider can always eat them all within $2000$ steps.

There is a $11\times 11$ square grid. We divided this in $5$ rectangles along unit squares. How many ways that one of the rectangles doesn’t have a edge on basic circumference. Note that we count as different ways that one way coincides with another way by rotating or reversing.

Let $A$ be the number of 2019-digit numbers, that is made of 2 different digits (For example $10\underbrace{1...1}_{2016}0$ is such number). Determine the highest power of 3 that divides $A$.

A fair $6$-sided die is repeatedly rolled until a $1, 4, 5$, or $6$ is rolled. What is the expected value of the product of all the rolls?

Consider a polynomial $P(x) = \prod^9_{j=1}(x+d_j),$ where $d_1, d_2, \ldots d_9$ are nine distinct integers. Prove that there exists an integer $N,$ such that for all integers $x \geq N$ the number $P(x)$ is divisible by a prime number greater than 20. [i]Proposed by Luxembourg[/i]

Let us consider a set $S = \{ a_1 < a_2 < \ldots < a_{2004}\}$, satisfying the following properties: $f(a_i) < 2003$ and $f(a_i) = f(a_j) \quad \forall i, j$ from $\{1, 2,\ldots , 2004\}$, where $f(a_i)$ denotes number of elements which are relatively prime with $a_i$. Find the least positive integer $k$ for which in every $k$-subset of $S$, having the above mentioned properties there are two distinct elements with greatest common divisor greater than 1.

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$. )

An integer $ n$ is called good if there are $ n \geq 3$ lattice points $ P_1, P_2, \ldots, P_n$ in the coordinate plane satisfying the following conditions: If line segment $ P_iP_j$ has a rational length, then there is $ P_k$ such that both line segments $ P_iP_k$ and $ P_jP_k$ have irrational lengths; and if line segment $ P_iP_j$ has an irrational length, then there is $ P_k$ such that both line segments $ P_iP_k$ and $ P_jP_k$ have rational lengths. (1) Determine the minimum good number. (2) Determine if 2005 is a good number. (A point in the coordinate plane is a lattice point if both of its coordinate are integers.)

Ana and Beto play on a blackboard where all integers from 1 to 2024 (inclusive) are written. On each turn, Ana chooses three numbers $a,b,c$ written on the board and then Beto erases them and writes one of the following numbers: $$a+b-c, a-b+c, ~\text{or}~ -a+b+c.$$ The game ends when only two numbers are left on the board and Ana cannot play. If the sum of the final numbers is a multiple of 3, Beto wins. Otherwise, Ana wins. ¿Who has a winning strategy?

In a group of nine persons it is not possible to choose four persons such that every one knows the three others. Prove that this group of nine persons can be partitioned into four groups such that nobody knows anyone from his or her group.

Consider a regular triangular array of $n(n+1)/2$ points.Let $f(n)$ denote the number of equilateral triangles formed by taking some $3$ points in the array as vertices.Prove that $f(n)=\frac{(n-1)n(n+1)(n+2)}{24}$.

The numbers from $1$ to $2000^2$ were written on a board. Vasya choose $2000$ of them whose sum of them equal to two thousandth of the sum of all numbers. Proof that his friend, Petya, will be able to color each of the remaining numbers by one of other $1999$ colors so that the sum of numbers with each of total $2000$ colors are the same.

For each positive integer $n$ (written with no leading zeros), let $t(n)$ equal the number formed by reversing the digits of $n$. For example, $t(461) = 164$ and $t(560) = 65$. For how many three-digit positive integers $m$ is $m + t(t(m))$ odd? [i]Proposed by David Altizio[/i]

From a squared sheet of paper of size $29 \times 29, 99$ pieces, each a $2\times 2$ square, are cut off (all cutting is along the lines bounding the squares). Prove that at least one more piece of size $2\times 2$ may be cut from the remaining part of the sheet. (S Fomin, Leningrad)

[u]Round 1[/u] [b]p1.[/b] How many ways are there to arrange the letters in the word $NEVERLAND$ such that the $2$ $N$’s are adjacent and the two $E$’s are adjacent? Assume that letters that appear the same are not distinct. [b]p2.[/b] In rectangle $ABCD$, $E$ and $F$ are on $AB$ and $CD$, respectively such that $DE = EF = FB$ and $\angle CDE = 45^o$. Find $AB + AD$ given that $AB$ and $AD$ are relatively prime positive integers. [b]p3.[/b] Maisy Airlines sees $n$ takeoffs per day. Find the minimum value of $n$ such that theremust exist two planes that take off within aminute of each other. [u]Round 2[/u] [b]p4.[/b] Nick is mixing two solutions. He has $100$ mL of a solution that is $30\%$ $X$ and $400$ mL of a solution that is $10\%$ $X$. If he combines the two, what percent $X$ is the final solution? [b]p5.[/b] Find the number of ordered pairs $(a,b)$, where $a$ and $b$ are positive integers, such that $$\frac{1}{a}+\frac{2}{b}=\frac{1}{12}.$$ [b]p6.[/b] $25$ balls are arranged in a $5$ by $5$ square. Four of the balls are randomly removed from the square. Given that the probability that the square can be rotated $180^o$ and still maintain the same configuration can be expressed as $\frac{m}{n}$ , where $m$ and $n$ are relatively prime, find $m+n$. [u]Round 3[/u] [b]p7.[/b] Maisy the ant is on corner $A$ of a $13\times 13\times 13$ box. She needs to get to the opposite corner called $B$. Maisy can only walk along the surface of the cube and takes the path that covers the least distance. Let $C$ and $D$ be the possible points where she turns on her path. Find $AC^2 + AD^2 +BC^2 +BD^2 - AB^2 -CD^2$. [b]p8.[/b] Maisyton has recently built $5$ intersections. Some intersections will get a park and some of those that get a park will also get a chess school. Find how many different ways this can happen. [b]p9.[/b] Let $f (x) = 2x -1$. Find the value of $x$ that minimizes $| f ( f ( f ( f ( f (x)))))-2020|$. [u]Round 4[/u] [b]p10.[/b] Triangle $ABC$ is isosceles, with $AB = BC > AC$. Let the angle bisector of $\angle A$ intersect side $\overline{BC}$ at point $D$, and let the altitude from $A$ intersect side $\overline{BC}$ at point $E$. If $\angle A = \angle C= x^o$, then the measure of $\angle DAE$ can be expressed as $(ax -b)^o$, for some constants $a$ and $b$. Find $ab$. [b]p11[/b]. Maisy randomly chooses $4$ integers $w$, $x$, $y$, and $z$, where $w, x, y, z \in \{1,2,3, ... ,2019,2020\}$. Given that the probability that $w^2 + x^2 + y^2 + z^2$ is not divisible by $4$ is $\frac{m}{n}$ , where $m$ and $n$ are relatively prime positive integers, find $m+n$. [b]p12.[/b] Evaluate $$-\log_4 \left(\log_2 \left(\sqrt{\sqrt{\sqrt{...\sqrt{16}}}} \right)\right),$$ where there are $100$ square root signs. PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h3166476p28814111]here [/url] and 9-12 [url=https://artofproblemsolving.com/community/c3h3166480p28814155]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For $n \geq 3$, a [i]special n-triangle[/i] is a triangle with $n$ distinct numbers on each side such that the sum of the numbers on a side is the same for all sides. For instance, because $41 + 23 + 43 = 43 + 17 + 47 = 47 + 19 + 41$, the following is a special $3$-triangle: $$41$$ $$23\text{ }\text{ }\text{ }\text{ }\text{ }19$$ $$43\text{ }\text{ }\text{ }\text{ }\text{ }17\text{ }\text{ }\text{ }\text{ }\text{ }47$$ Note that a special $n$-triangle contains $3(n - 1)$ numbers. An infinite set $A$ of positive integers is a [i]special set[/i] if, for each $n \geq 3$, the smallest $3(n - 1)$ numbers of $A$ can be used to form a special $n$-triangle. Show that the set of positive integers that are not multiples of $2023$ is a special set.