There are $20$ cities in Wonderland. The company Wonderland Airways (WA) established $18$ air routes between them. Any of the routes is closed and passes (with landing) through some $5$ different cities. Each city belongs to at least three different routes, for no two cities there exist more than one routes, which allow to fly from one to another without landing. Prove that one can fly from any city of Wonderland to any other one by airplanes of WA. (V. Kaskevich)

Suppose five of the nine vertices of a regular nine-sided polygon are arbitrarily chosen. Show that one can select four among these five such that they are the vertices of a trapezium.

Let $N$ be an odd number, $N\geq 3$. $N$ tennis players take part in a championship. Before starting the championship, a commission puts the players in a row depending on how good they think the players are. During the championship, every player plays with every other player exactly once, and each match has a winner. A match is called [i]suprising[/i] if the winner was rated lower by the commission. At the end of the tournament, players are arranged in a line based on the number of victories they have achieved. In the event of a tie, the commission's initial order is used to decide which player will be higher. It turns out that the final order is exactly the same as the commission's initial order. What is the maximal number of suprising matches that could have happened.

Let $G$ be a connected (simple) graph with $n$ vertices and at least $n$ edges. Prove that it is possible to color the vertices of $G$ red and blue, so that the following conditions hold: i. There is at least one vertex of each color, ii. There is an even number of edges connecting a red vertex to a blue vertex, and iii. If all such edges are deleted, one is left with two connected graphs.

Consider a regular polygon $A_1A_2\ldots A_{6n+3}$. The vertices $A_{2n+1}, A_{4n+2}, A_{6n+3}$ are called [i]holes[/i]. Initially there are three pebbles in some vertices of the polygon, which are also vertices of equilateral triangle. Players $A$ and $B$ take moves in turn. In each move, starting from $A$, the player chooses pebble and puts it to the next vertex clockwise (for example, $A_2\rightarrow A_3$, $A_{6n+3}\rightarrow A_1$). Player $A$ wins if at least two pebbles lie in holes after someone's move. Does player $A$ always have winning strategy? [i]Proposed by Bohdan Rublov [/i]

A pawn is a chess piece which attacks the two squares diagonally in front if it. What is the maximum number of pawns which can be placed on an $n \times n$ chessboard such that no two pawns attack each other?

[b]p1.[/b] A shape made by joining four identical regular hexagons side-to-side is called a hexo. Two hexos are considered the same if one can be rotated / reflected to match the other. Find the number of different hexos. [b]p2.[/b] The sequence $1, 2, 3, 3, 3, 4, 5, 5, 5, 5, 5, 6,... $ consists of numbers written in increasing order, where every even number $2n$ is written once, and every odd number $2n + 1$ is written $2n + 1$ times. What is the $2019^{th}$ term of this sequence? [b]p3.[/b] On planet EMCCarth, months can only have lengths of $35$, $36$, or $42$ days, and there is at least one month of each length. Victor knows that an EMCCarth year has $n$ days, but realizes that he cannot figure out how many months there are in an EMCCarth year. What is the least possible value of $n$? [b]p4.[/b] In triangle $ABC$, $AB = 5$ and $AC = 9$. If a circle centered at $A$ passing through $B$ intersects $BC$ again at $D$ and $CD = 7$, what is $BC$? [b]p5.[/b] How many nonempty subsets $S$ of the set $\{1, 2, 3,..., 11, 12\}$ are there such that the greatest common factor of all elements in $S$ is greater than $1$? [b]p6.[/b] Jasmine rolls a fair $6$-sided die, with faces labeled from $1$ to $6$, and a fair $20$-sided die, with faces labeled from $1$ to $20$. What is the probability that the product of these two rolls, added to the sum of these two rolls, is a multiple of $3$? [b]p7.[/b] Let $\{a_n\}$ be a sequence such that $a_n$ is either $2a_{n-1}$ or $a_{n-1} - 1$. Given that $a_1 = 1$ and $a_{12} = 120$, how many possible sequences $a_1$, $a_2$, $...$, $a_{12}$ are there? [b]p8.[/b] A tetrahedron has two opposite edges of length $2$ and the remaining edges have length $10$. What is the volume of this tetrahedron? [b]p9.[/b] In the garden of EMCCden, there is a tree planted at every lattice point $-10 \le x, y \le 10$ except the origin. We say that a tree is visible to an observer if the line between the tree and the observer does not intersect any other tree (assume that all trees have negligible thickness). What fraction of all the trees in the garden of EMCCden are visible to an observer standing at the origin? [b]p10.[/b] Point $P$ lies inside regular pentagon $\zeta$, which lies entirely within regular hexagon $\eta$. A point $Q$ on the boundary of pentagon $\zeta$ is called projective if there exists a point $R$ on the boundary of hexagon $\eta$ such that $P$, $Q$, $R$ are collinear and $2019 \cdot \overline{PQ} = \overline{QR}$. Given that no two sides of $\zeta$ and $\eta$ are parallel, what is the maximum possible number of projective points on $\zeta$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

For which positive integers $n\geq4$ does there exist a convex $n$-gon with side lengths $1, 2, \dots, n$ (in some order) and with all of its sides tangent to the same circle?

Given a complete bipartite graph on $n,n$ vertices (call this $K_{n,n}$), we colour all its edges with $2$ colours , red and blue . What is the least value of $n$ such that for any colouring of the edges of the graph , there will exist at least one monochromatic $4$ cycle ?

Let $S_{n}$ be the number of permutations $(a_{1}, a_{2}, ... , a_{n})$ of $(1, 2, ... , n)$ such that $1 \leq |a_{k}-k | \leq 2$ for all $k$. Show that $\frac{7}{4}S_{n-1}< S_{n}< 2 S_{n-1}$ for $n > 6.$

Pete has marked several (three or more) points in the plane such that all distances between them are different. A pair of marked points $A,B$ will be called unusual if $A$ is the furthest marked point from $B$, and $B$ is the nearest marked point to $A$ (apart from $A$ itself). What is the largest possible number of unusual pairs that Pete can obtain?

$n(\geq 4)$ islands are connected by bridges to satisfy the following conditions: [list] [*]Each bridge connects only two islands and does not go through other islands. [*]There is at most one bridge connecting any two different islands. [*]There does not exist a list $A_1, A_2, \ldots, A_{2k}(k \geq 2)$ of distinct islands that satisfy the following: [center]For every $i=1, 2, \ldots, 2k$, the two islands $A_i$ and $A_{i+1}$ are connected by a bridge. (Let $A_{2k+1}=A_1$)[/center] [/list] Prove that the number of the bridges is at most $\frac{3(n-1)}{2}$.

A number of $17$ workers stand in a row. Every contiguous group of at least $2$ workers is a $\textit{brigade}$. The chief wants to assign each brigade a leader (which is a member of the brigade) so that each worker’s number of assignments is divisible by $4$. Prove that the number of such ways to assign the leaders is divisible by $17$. [i]Mikhail Antipov, Russia[/i]

Find the maximal number of points, such that there exist a configuration of $2023$ lines on the plane, with each lines pass at least $2$ points.

Let $M$ be a set consisting of $n$ points in the plane, satisfying: i) there exist $7$ points in $M$ which constitute the vertices of a convex heptagon; ii) if for any $5$ points in $M$ which constitute the vertices of a convex pentagon, then there is a point in $M$ which lies in the interior of the pentagon. Find the minimum value of $n$. [i]Leng Gangsong[/i]

$24$ students attend a mathematical circle. For any team consisting of $6$ students, the teacher considers it to be either [b]GOOD [/b] or [b]OK[/b]. For the tournament of mathematical battles, the teacher wants to partition all the students into $4$ teams of $6$ students each. May it happen that every such partition contains either $3$ [b]GOOD[/b] teams or exactly one [b]GOOD[/b] team and both options are present?

[b]p1.[/b] Fluffy the Dog is an extremely fluffy dog. Because of his extreme fluffiness, children always love petting Fluffy anywhere. Given that Fluffy likes being petted $1/4$ of the time, out of $120$ random people who each pet Fluffy once, what is the expected number of times Fluffy will enjoy being petted? [b]p2.[/b] Andy thinks of four numbers $27$, $81$, $36$, and $41$ and whispers the numbers to his classmate Cynthia. For each number she hears, Cynthia writes down every factor of that number on the whiteboard. What is the sum of all the different numbers that are on the whiteboard? (Don't include the same number in your sum more than once) [b]p3.[/b] Charles wants to increase the area his square garden in his backyard. He increases the length of his garden by $2$ and increases the width of his garden by $3$. If the new area of his garden is $182$, then what was the original area of his garden? [b]p4.[/b] Antonio is trying to arrange his flute ensemble into an array. However, when he arranges his players into rows of $6$, there are $2$ flute players left over. When he arranges his players into rows of $13$, there are $10$ flute players left over. What is the smallest possible number of flute players in his ensemble such that this number has three prime factors? [b]p5.[/b] On the AMC $9$ (Acton Math Competition $9$), $5$ points are given for a correct answer, $2$ points are given for a blank answer and $0$ points are given for an incorrect answer. How many possible scores are there on the AMC $9$, a $15$ problem contest? [b]p6.[/b] Charlie Puth produced three albums this year in the form of CD's. One CD was circular, the second CD was in the shape of a square, and the final one was in the shape of a regular hexagon. When his producer circumscribed a circle around each shape, he noticed that each time, the circumscribed circle had a radius of $10$. The total area occupied by $1$ of each of the different types of CDs can be expressed in the form $a + b\pi + c\sqrt{d}$ where $d$ is not divisible by the square of any prime. Find $a + b + c + d$. [b]p7.[/b] You are picking blueberries and strawberries to bring home. Each bushel of blueberries earns you $10$ dollars and each bushel of strawberries earns you $8$ dollars. However your cart can only fit $24$ bushels total and has a weight limit of $100$ lbs. If a bushel of blueberries weighs $8$ lbs and each bushel of strawberries weighs $6$ lbs, what is your maximum profit. (You can only pick an integer number of bushels) [b]p8.[/b] The number $$\sqrt{2218 + 144\sqrt{35} + 176\sqrt{55} + 198\sqrt{77}}$$ can be expressed in the form $a\sqrt5 + b\sqrt7 + c\sqrt{11}$ for positive integers $a, b, c$. Find $abc$. [b]p9.[/b] Let $(x, y)$ be a point such that no circle passes through the three points $(9,15)$, $(12, 20)$, $(x, y)$, and no circle passes through the points $(0, 17)$, $(16, 19)$, $(x, y)$. Given that $x - y = -\frac{p}{q}$ for relatively prime positive integers $p$, $q$, Find $p + q$. [b]p10.[/b] How many ways can Alfred, Betty, Catherine, David, Emily and Fred sit around a $6$ person table if no more than three consecutive people can be in alphabetical order (clockwise)? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n \geq 1$ be an integer. What is the maximum number of disjoint pairs of elements of the set $\{ 1,2,\ldots , n \}$ such that the sums of the different pairs are different integers not exceeding $n$?

What is the largest possible value of $|a_1 - 1| + |a_2-2|+...+ |a_n- n|$ where $a_1, a_2,..., a_n$ is a permutation of $1,2,..., n$?

Mojtaba and Hooman are playing a game. Initially Mojtaba draws $2018$ vectors with zero sum. Then in each turn, starting with Mojtaba, the player takes a vector and puts it on the plane. After the first move, the players must put their vector next to the previous vector (the beginning of the vector must lie on the end of the previous vector). At last, there will be a closed polygon. If this polygon is not self-intersecting, Mojtaba wins. Otherwise Hooman. Who has the winning strategy? [i]Proposed by Mahyar Sefidgaran, Jafar Namdar [/i]

There are $N$ pupils in a school class, and there are several communities among them. Sociability of a pupil will mean the number of pupils in the largest community to which the pupil belongs (if the pupil belongs to none then the sociability equals $1$). It occurred that all girls in the class have different sociabilities. What is the maximum possible number of girls in the class?

For a tournament with $8$ vertices, if from any vertex it is impossible to follow a route to return to itself, we call the graph a [i]good[/i] graph. Otherwise, we call it a [i]bad[/i] graph. Prove that $(1)$ there exists a tournament with $8$ vertices such that after changing the orientation of any at most $7$ edges of the tournament, the graph is always a[i]bad[/i] graph; $(2)$ for any tournament with $8$ vertices, one can change the orientation of at most $8$ edges of the tournament to get a [i]good[/i] graph. (A tournament is a complete graph with directed edges.)

Let $n\geqslant 3$ be an integer. Prove that there exists a set $S$ of $2n$ positive integers satisfying the following property: For every $m=2,3,...,n$ the set $S$ can be partitioned into two subsets with equal sums of elements, with one of subsets of cardinality $m$.

[b]p1.[/b] How many two-digit primes have a units digit of $3$? [b]p2.[/b] How many ways can you arrange the letters $A$, $R$, and $T$ such that it makes a three letter combination? Each letter is used once. [b]p3.[/b] Hanna and Kevin are running a $100$ meter race. If Hanna takes $20$ seconds to finish the race and Kevin runs $15$ meters per second faster than Hanna, by how many seconds does Kevin finish before Hanna? [b]p4.[/b] It takes an ant $3$ minutes to travel a $120^o$ arc of a circle with radius $2$. How long (in minutes) would it take the ant to travel the entirety of a circle with radius $2022$? [b]p5.[/b] Let $\vartriangle ABC$ be a triangle with angle bisector $AD$. Given $AB = 4$, $AD = 2\sqrt2$, $AC = 4$, find the area of $\vartriangle ABC$. [b]p6.[/b] What is the coefficient of $x^5y^2$ in the expansion of $(x + 2y + 4)^8$? [b]p7.[/b] Find the least positive integer $x$ such that $\sqrt{20475x}$ is an integer. [b]p8.[/b] What is the value of $k^2$ if $\frac{x^5 + 3x^4 + 10x^2 + 8x + k}{x^3 + 2x + 4}$ has a remainder of $2$? [b]p9.[/b] Let $ABCD$ be a square with side length $4$. Let $M$, $N$, and $P$ be the midpoints of $\overline{AB}$, $\overline{BC}$ and $\overline{CD}$, respectively. The area of the intersection between $\vartriangle DMN$ and $\vartriangle ANP$ can be written as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find $a + b$. [b]p10.[/b] Let $x$ be all the powers of two from $2^1$ to $2^{2023}$ concatenated, or attached, end to end ($x = 2481632...$). Let y be the product of all the powers of two from $2^1$ to $2^{2023}$ ($y = 2 \cdot 4 \cdot 8 \cdot 16 \cdot 32... $ ). Let 2a be the largest power of two that divides $x$ and $2^b$ be the largest power of two that divides $y$. Compute $\frac{b}{a}$ . [b]p11.[/b] Larry is making a s’more. He has to have one graham cracker on the top and one on the bottom, with eight layers in between. Each layer can made out of chocolate, more graham crackers, or marshmallows. If graham crackers cannot be placed next to each other, how many ways can he make this s’more? [b]p12.[/b] Let $ABC$ be a triangle with $AB = 3$, $BC = 4$, $AC = 5$. Circle $O$ is centered at $B$ and has radius $\frac{8\sqrt{3}}{5}$ . The area inside the triangle but not inside the circle can be written as $\frac{a-b\sqrt{c}-d\pi}{e}$ , where $gcd(a, b, d, e) =1$ and $c$ is squarefree. Find $a + b + c + d + e$. [b]p13.[/b] Let $F(x)$ be a quadratic polynomial. Given that $F(x^2 - x) = F (2F(x) - 1)$ for all $x$, the sum of all possible values of $F(2022)$ can be written as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime positive integers. Find $a + b$. [b]p14.[/b] Find the sum of all positive integers $n$ such that $6\phi (n) = \phi (5n)+8$, where $\phi$ is Euler’s totient function. Note: Euler’s totient $(\phi)$ is a function where $\phi (n)$ is the number of positive integers less than and relatively prime to $n$. For example, $\phi (4) = 2$ since only $1$, $3$ are the numbers less than and relatively prime to $4$. [b]p15.[/b] Three numbers $x$, $y$, and $z$ are chosen at random from the interval $[0, 1]$. The probability that there exists an obtuse triangle with side lengths $x$, $y$, and $z$ can be written in the form $\frac{a\pi-b}{c}$ , where $a$, $b$, $c$ are positive integers with $gcd(a, b, c) = 1$. Find $a + b + c$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $m$ boxes be given, with some balls in each box. Let $n < m$ be a given integer. The following operation is performed: choose $n$ of the boxes and put $1$ ball in each of them. Prove: [i](a) [/i]If $m$ and $n$ are relatively prime, then it is possible, by performing the operation a finite number of times, to arrive at the situation that all the boxes contain an equal number of balls. [i](b)[/i] If $m$ and $n$ are not relatively prime, there exist initial distributions of balls in the boxes such that an equal distribution is not possible to achieve.