Let $n>1$ be an integer. Suppose we are given $2n$ points in the plane such that no three of them are collinear. The points are to be labelled $A_1, A_2, \dots , A_{2n}$ in some order. We then consider the $2n$ angles $\angle A_1A_2A_3, \angle A_2A_3A_4, \dots , \angle A_{2n-2}A_{2n-1}A_{2n}, \angle A_{2n-1}A_{2n}A_1, \angle A_{2n}A_1A_2$. We measure each angle in the way that gives the smallest positive value (i.e. between $0^{\circ}$ and $180^{\circ}$). Prove that there exists an ordering of the given points such that the resulting $2n$ angles can be separated into two groups with the sum of one group of angles equal to the sum of the other group.

Let $ S$ be the set of natural numbers $ n$ satisfying the following conditions: $ (i)$ $ n$ has $ 1000$ digits, $ (ii)$ all the digits of $ n$ are odd, and $ (iii)$ any two adjacent digits of $ n$ differ by $ 2$. Determine the number of elements of $ S$.

Simon plays a game on an $n\times n$ grid of cells. Initially, each cell is filled with an integer. Every minute, Simon picks a cell satisfying the following: [list] [*] The magnitude of the integer in the chosen cell is less than $n^{n^n}$ [*] The sum of all the integers in the neighboring cells (sharing one side with the chosen cell) is non-zero [/list] Simon then adds each integer in a neighboring cell to the chosen cell. Show that Simon will eventually not be able to make any valid moves.

The license plate of each automobile in Iran consists of a two-digit and a three-digit number as well as a letter of the Persian alphabet. The digit $0$ is not used in the two numbers. To each license plate, we assign the product of the two numbers on it. For example, if the two numbers are $12$ and $365$ on a license plate, the assigned number would be $12 \times 365 = 4380$. What is the average of all the assigned numbers to all possible license plates?

Let $n \ge 2$ be an integer and $M= \{1,2,\ldots,n\}.$ For each $k \in \{1,2,\ldots,n-1\}$ we define $$x_k= \frac{1}{n+1} \sum_{\substack{A \subset M \\ |A|=k}} (\min A + \max A).$$ Prove that the numbers $x_k$ are integers and not all of them are divisible by $4.$ [hide=Notations]$|A|$ is the cardinal of $A$ $\min A$ is the smallest element in $A$ $\max A$ is the largest element in $A$[/hide]

Given a positive integer $ n$, find the number of $ n$-digit natural numbers consisting of digits 1, 2, 3 in which any two adjacent digits are either distinct or both equal to 3.

Each of $K$ friends simultaneously learns one different item of news. They begin to phone one another to tell them their news. Each conversation lasts exactly one hour, during which time it is possible for two friends to tell each other all of their news. What is the minimum number of hours needed in order for all of the friends to know all of the news? Consider in this problem: (a) $K = 64$. (b) $K = 55$. (c) $K = 100$. (A Andjans, Riga) PS. (a) was the junior problem, (a),(b),(c) the senior one

On the circle, 99 points are marked, dividing this circle into 99 equal arcs. Petya and Vasya play the game, taking turns. Petya goes first; on his first move, he paints in red or blue any marked point. Then each player can paint on his own turn, in red or blue, any uncolored marked point adjacent to the already painted one. Vasya wins, if after painting all points there is an equilateral triangle, all three vertices of which are colored in the same color. Could Petya prevent him?

[b]p25.[/b] Compute: $$\frac{ \sum^{\infty}_{i=0}\frac{(2\pi)^{4i+1}}{(4i+1)!}}{\sum^{\infty}_{i=0}\frac{(2\pi)^{4i+1}}{(4i+3)!}}$$ [b]p26.[/b] Suppose points $A, B, C, D$ lie on a circle $\omega$ with radius $4$ such that $ABCD$ is a quadrilateral with $AB = 6$, $AC = 8$, $AD = 7$. Let $E$ and $F$ be points on $\omega$ such that $AE$ and $AF$ are respectively the angle bisectors of $\angle BAC$ and $\angle DAC$. Compute the area of quadrilateral $AECF$. [b]p27.[/b] Let $P(x) = x^2 - ax + 8$ with a a positive integer, and suppose that $P$ has two distinct real roots $r$ and $s$. Points $(r, 0)$, $(0, s)$, and $(t, t)$ for some positive integer t are selected on the coordinate plane to form a triangle with an area of $2021$. Determine the minimum possible value of $a + t$. [b]p28.[/b] A quartic $p(x)$ has a double root at $x = -\frac{21}{4}$ , and $p(x) - 1344x$ has two double roots each $\frac14$ less than an integer. What are these two double roots? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Investigate whether a chess knight can traverse a $4 \times 4$ mini-chessboard so that it reaches each of the $16$ squares only once. Note: the drawing below shows the endpoints of the eight possible moves of the knight $(C)$ on a chessboard of size $8 \times 8$. [asy] unitsize(0.4 cm); int i; fill(shift((2,2))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((4,2))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((1,3))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((5,3))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((1,5))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((5,5))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((2,6))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); fill(shift((4,6))*((0,0)--(1,0)--(1,1)--(0,1)--cycle), gray(0.7)); for (i = 0; i <= 8; ++i) { draw((i,0)--(i,8)); draw((0,i)--(8,i)); } label("C", (3.5,4.5), fontsize(8)); [/asy]

Let $n\ge 2$ be an integer. They are given $n + 1$ red points in the plane. Prove that there exist $2n$ circles $C_1 , C_2 , \ldots , C_n , D_1 , D_2 , \ldots , D_n$ such that: $\bullet$ $C_1 , C_2 ,\ldots , C_n$ are concentric. $\bullet$ $D_1 , D_2 ,\ldots , D_n$ are concentric. $\bullet$ For $k = 1, 2, 3,\ldots , n$ the circles $C_k$ and $D_k$ are disjoint. $\bullet$ For $k = 1, 2, 3,\ldots , n$ it is true that $C_k$ contains exactly $k$ red dots in its interior and $D_k$ contains exactly $n + 1 - k$ red dots in its interior.

A bank has a set S of codes formed only with 0 and 1,each one with length n.Two codes are 'friends' if they are different on only one position.We know that each code has exactly k 'friends'.Prove that: 1)S has an even number of elements 2)S contains at least $2^k$ codes

Ali Baba and the $40$ thieves want to cross Bosporus strait. They made a line so that any two people standing next to each other are friends. Ali Baba is the first, he is also a friend with the thief next to his neighbour. There is a single boat that can carry $2$ or $3$ people and these people must be friends. Can Ali Baba and the $40$ thieves always cross the strait if a single person cannot sail?

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.

Some coins are placed on a $20 \times 13$ board. Two coins are called [i]neighbours[/i] if they are in the same row or column and no other coins lie between them. What is the largest number of coins that can be placed on the board if no coin is allowed to have more than two neighbours?

Legend has it that in a police station in the old west a group of six bandits tried to bribe the Sheriff in charge of the place with six gold coins to free them, the Sheriff was a very honest person so to prevent them from continuing to insist With the idea of bribery, he sat the $6$ bandits around a table and proposed the following: - "Initially the leader will have the six gold coins, in each turn one of you can pass coins to the adjacent companions, but each time you do so you must pass the same amount of coins to each of your neighbors. If at any time they all manage to have the same amount of coins so I will let them go free. " The bandits accepted and began to play. Show that regardless of what moves the bandits make, they cannot win.

There are $2010$ cities in country, and $3$ roads go from every city. President and Prime Minister play next game. They sell roads by turn to one of $3$ companies( one road is one turn). President will win, if three roads from some city are sold to different companies. Who will win?

A group of mathematicians is attending a conference. We say that a mathematician is $k-$[i]content[/i] if he is in a room with at least $k$ people he admires or if he is admired by at least $k$ other people in the room. It is known that when all participants are in a same room then they are all at least $3k + 1$-content. Prove that you can assign everyone into one of $2$ rooms in a way that everyone is at least $k$-content in his room and neither room is empty. [i]Admiration is not necessarily mutual and no one admires himself.[/i] [i]Matija Bucić[/i]

[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].

Fix a point $O$ in the plane and an integer $n\geq 3$. Consider a finite family $\mathcal{D}$ of closed unit discs in the plane such that: (a) No disc in $\mathcal{D}$ contains the point $O$; and (b) For each positive integer $k < n$, the closed disc of radius $k + 1$ centred at $O$ contains the centres of at least $k$ discs in $\mathcal{D}$. Show that some line through $O$ stabs at least $\frac{2}{\pi} \log \frac{n+1}{2}$ discs in $\mathcal{D}$.

Non-negative integers are placed on the vertices of a $100$-gon, the sum of the numbers is $99$. Every minute at one of the vertices that is equal to $0$ will be replaced by $2$ and both its neighboring numbers are subtracted by $1$. Prove that after a while a negative number will appear on the board.

Given is a simple graph with $239$ vertices, such that it is not bipartite and each vertex has degree at least $3$. Find the smallest $k$, such that each odd cycle has length at most $k$.

A triangle is composed of circular cells arranged in $5784$ rows: the first row has one cell, the second has two cells, and so on (see the picture). The cells are divided into pairs of adjacent cells (circles touching each other), so that each cell belongs to exactly one pair. A pair of adjacent cells is called [b]diagonal[/b] if the two cells in it [i]aren't[/i] in the same row. What is the minimum possible amount of diagonal pairs in the division? An example division into pairs is depicted in the image.

Is it possible to fill a rectangular table with black and white squares (only) so, that the number of black squares will equal to the number of white squares, and each row and each column will have more than $75\%$ squares of the same colour?

Let $n$ be a positive integer. Using the integers from $1$ to $4n$ inclusive, pairs are to be formed such that the product of the numbers in each pair is a perfect square. Each number can be part of at most one pair, and the two numbers in each pair must be different. Determine, for each $n$, the maximum number of pairs that can be formed.