Evan is a $n$-dimensional being that lives in a house formed by the points of $\mathbb{Z}_{\geq 0}^n$. His room is the set of points in which coordinates are all less than or equal to $2021$. Evan's room has been infested with bees, so he decides to flush them out through $\textit{captures}$. A $\textit{capture}$ can be performed by eliminating a bee from point $ (a_1, a_2, \ldots, a_n) $ and replacing it with $ n $ bees, one in each of the points: $$ (a_1 + 1, a_2 , \ldots, a_n), (a_1, a_2 + 1, \ldots, a_n), \ldots, (a_1, a_2, \ldots, a_n + 1) $$ However, two bees can never occupy the same point in the house. Determine, for every $ n $, the greatest value $ A (n) $ of bees such that, for some initial arrangement of these bees in Evan's room, he is able to accomplish his goal with a finite amount of $\textit{captures}$.

In a country there are two-way non-stopflights between some pairs of cities. Any city can be reached from any other by a sequence of at most $100$ flights. Moreover, any city can be reached from any other by a sequence of an even number of flights. What is the smallest $d$ for which one can always claim that any city can be reached from any other by a sequence of an even number of flights not exceeding $d$?

Let $n$ be a positive integer, and let $S_n$ be the set of all permutations of $1,2,...,n$. let $k$ be a non-negative integer, let $a_{n,k}$ be the number of even permutations $\sigma$ in $S_n$ such that $\sum_{i=1}^{n}|\sigma(i)-i|=2k$ and $b_{n,k}$ be the number of odd permutations $\sigma$ in $S_n$ such that $\sum_{i=1}^{n}|\sigma(i)-i|=2k$. Evaluate $a_{n,k}-b_{n,k}$. [i]* * *[/i]

Nils is playing a game with a bag originally containing $n$ red and one black marble. He begins with a fortune equal to $1$. In each move he picks a real number $x$ with $0 \le x \le y$, where his present fortune is $y$. Then he draws a marble from the bag. If the marble is red, his fortune increases by $x$, but if it is black, it decreases by $x$. The game is over after $n$ moves when there is only a single marble left. In each move Nils chooses $x$ so that he ensures a final fortune greater or equal to $Y$ . What is the largest possible value of $Y$?

Let $G$ be a connected graph, with degree of all vertices not less then $m \geq 3$, such that there is no path through all vertices of $G$ being in every vertex exactly once. Find the least possible number of vertices of $G.$

Albert and Beatrice play a game. $2021$ stones lie on a table. Starting with Albert, they alternatively remove stones from the table, while obeying the following rule. At the $n$-th turn, the active player (Albert if $n$ is odd, Beatrice if $n$ is even) can remove from $1$ to $n$ stones. Thus, Albert first removes $1$ stone; then, Beatrice can remove $1$ or $2$ stones, as she wishes; then, Albert can remove from $1$ to $3$ stones, and so on. The player who removes the last stone on the table loses, and the other one wins. Which player has a strategy to win regardless of the other player's moves?

Bob proposes the following game to Johanna. The board in the figure is an equilateral triangle subdivided in turn into $256$ small equilateral triangles, one of which is painted in black. Bob chooses any point inside the board and places a small token. Johanna can make three types of plays. Each of them consists of choosing any of the $3$ vertices of the board and move the token to the midpoint between the current position of the tile and the chosen vertex. In the second figure we see an example of a move in which Johana chose vertex $A$. Johanna wins if she manages to place her piece inside the triangle black. Prove that Johanna can always win in at most $4$ moves. [asy] unitsize(8 cm); pair A, B, C; int i; A = dir(60); C = (0,0); B = (1,0); fill((6/16*(1,0) + 1/16*dir(60))--(7/16*(1,0) + 1/16*dir(60))--(6/16*(1,0) + 2/16*dir(60))--cycle, gray(0.7)); draw(A--B--C--cycle); for (i = 1; i <= 15; ++i) { draw(interp(A,B,i/16)--interp(A,C,i/16)); draw(interp(B,C,i/16)--interp(B,A,i/16)); draw(interp(C,A,i/16)--interp(C,B,i/16)); } label("$A$", A, N); label("$B$", B, SE); label("$C$", C, SW); [/asy] [asy] unitsize(8 cm); pair A, B, C, X, Y, Z; int i; A = dir(60); C = (0,0); B = (1,0); X = 9.2/16*(1,0) + 3.3/16*dir(60); Y = (A + X)/2; Z = rotate(60,X)*(Y); fill((6/16*(1,0) + 1/16*dir(60))--(7/16*(1,0) + 1/16*dir(60))--(6/16*(1,0) + 2/16*dir(60))--cycle, gray(0.7)); draw(A--B--C--cycle); for (i = 1; i <= 15; ++i) { draw(interp(A,B,i/16)--interp(A,C,i/16)); draw(interp(B,C,i/16)--interp(B,A,i/16)); draw(interp(C,A,i/16)--interp(C,B,i/16)); } draw(A--X, dotted); draw(arc(Z,abs(X - Y),-12,40), Arrow(6)); label("$A$", A, N); label("$B$", B, SE); label("$C$", C, SW); dot(A); dot(X); dot(Y); [/asy]

A polygon with $1997$ vertices is given. Write a positive real number each vertex such that, each number equal to its right and left numbers' arithmetic or geometric mean. Prove that all numbers are equal.

[b]p1.[/b] Eric is playing Brawl Stars. If he starts playing at $11:10$ AM, and plays for $2$ hours total, then how many minutes past noon does he stop playing? [b]p2.[/b] James is making a mosaic. He takes an equilateral triangle and connects the midpoints of its sides. He then takes the center triangle formed by the midsegments and connects the midpoints of its sides. In total, how many equilateral triangles are in James’ mosaic? [b]p3.[/b] What is the greatest amount of intersections that $3$ circles and $3$ lines can have, given that they all lie on the same plane? [b]p4.[/b] In the faraway land of Arkesia, there are two types of currencies: Silvers and Gold. Each Silver is worth $7$ dollars while each Gold is worth $17$ dollars. In Daniel’s wallet, the total dollar value of the Silvers is $1$ more than that of the Golds. What is the smallest total dollar value of all of the Silvers and Golds in his wallet? [b]p5.[/b] A bishop is placed on a random square of a $8$-by-$8$ chessboard. On average, the bishop is able to move to $s$ other squares on the chessboard. Find $4s$. Note: A bishop is a chess piece that can move diagonally in any direction, as far as it wants. [b]p6.[/b] Andrew has a certain amount of coins. If he distributes them equally across his $9$ friends, he will have $7$ coins left. If he apportions his coins for each of his $15$ classmates, he will have $13$ coins to spare. If he splits the coins into $4$ boxes for safekeeping, he will have $2$ coins left over. What is the minimum number of coins Andrew could have? [b]p7.[/b] A regular polygon $P$ has three times as many sides as another regular polygon $Q$. The interior angle of $P$ is $16^o$ greater than the interior angle of $Q$. Compute how many more diagonals $P$ has compared to $Q$. [b]p8.[/b] In an certain airport, there are three ways to switch between the ground floor and second floor that are 30 meters apart: either stand on an escalator, run on an escalator, or climb the stairs. A family on vacation takes 65 seconds to climb up the stairs. A solo traveller late for their flight takes $25$ seconds to run upwards on the escalator. The amount of time (in seconds) it takes for someone to switch floors by standing on the escalator can be expressed as $\frac{u}{v}$ , where $u$ and $v$ are relatively prime. Find $u + v$. (Assume everyone has the same running speed, and the speed of running on an escalator is the sum of the speeds of riding the escalator and running on the stairs.) [b]p9.[/b] Avanish, being the studious child he is, is taking practice tests to improve his score. Avanish has a $60\%$ chance of passing a practice test. However, whenever Avanish passes a test, he becomes more confident and instead has a $70\%$ chance of passing his next immediate test. If Avanish takes $3$ practice tests in a row, the expected number of practice tests Avanish will pass can be expressed as $\frac{a}{b}$ , where $a$ and $b$ are relatively prime. Find $a + b$. [b]p10.[/b] Triangle $\vartriangle ABC$ has sides $AB = 51$, $BC = 119$, and $AC = 136$. Point $C$ is reflected over line $\overline{AB}$ to create point $C'$. Next, point $B$ is reflected over line $\overline{AC'}$ to create point $B'$. If $[B'C'C]$ can be expressed in the form of $a\sqrt{b}$, where $b$ is not divisible by any perfect square besides $1$, find $a + b$. [b]p11[/b]. Define the following infinite sequence $s$: $$s = \left\{\frac{1}{1},\frac{1}{1 + 3},\frac{1}{1 + 3 + 6}, ... ,\frac{1}{1 + 3 + 6 + ...+ t_k},...\right\},$$ where $t_k$ denotes the $k$th triangular number. The sum of the first $2024$ terms of $s$, denoted $S$, can be expressed as $$S = 3 \left(\frac{1}{2}+\frac{1}{a}-\frac{1}{b}\right),$$ where $a$ and $b$ are positive integers. Find the minimal possible value of $a + b$. [b]p12.[/b] Omar writes the numbers from $1$ to $1296$ on a whiteboard and then converts each of them into base $6$. Find the sum of all of the digits written on the whiteboard (in base $10$), including both the base $10$ and base $6$ numbers. [b]p13.[/b] A mountain number is a number in a list that is greater than the number to its left and right. Let $N$ be the amount of lists created from the integers $1$ - $100$ such that each list only has one mountain number. $N$ can be expressed as $$N = 2^a(2^b - c^2),$$ where $a$, $b$ and $c$ are positive integers and $c$ is not divisible by $2$. Find $a + b+c$. (The numbers at the beginning or end of a list are not considered mountain numbers.)[hide]Original problem was voided because the original format of the answer didn't match the result's format. So I changed it in the wording, in order the problem to be correct[/hide] [b]p14.[/b] A circle $\omega$ with center $O$ has a radius of $25$. Chords $\overline{AB}$ and $\overline{CD}$ are drawn in $\omega$ , intersecting at $X$ such that $\angle BXC = 60^o$ and $AX > BX$. Given that the shortest distance of $O$ with $\overline{AB}$ and $\overline{CD}$ is $7$ and $15$ respectively, the length of $BX$ can be expressed as $x - \frac{y}{\sqrt{z}}$ , where $x$, $y$, and $z$ are positive integers such that $z$ is not divisible by any perfect square. Find $x + y + z.$ [hide]two answers were considered correct according to configuration[/hide] [b]p15.[/b] How many ways are there to split the first $10$ natural numbers into $n$ sets (with $n \ge 1$) such that all the numbers are used and each set has the same average? PS. You had better use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Given $ n$ countries with three representatives each, $ m$ committees $ A(1),A(2), \ldots, A(m)$ are called a cycle if [i](i)[/i] each committee has $ n$ members, one from each country; [i](ii)[/i] no two committees have the same membership; [i](iii)[/i] for $ i \equal{} 1, 2, \ldots,m$, committee $ A(i)$ and committee $ A(i \plus{} 1)$ have no member in common, where $ A(m \plus{} 1)$ denotes $ A(1);$ [i](iv)[/i] if $ 1 < |i \minus{} j| < m \minus{} 1,$ then committees $ A(i)$ and $ A(j)$ have at least one member in common. Is it possible to have a cycle of 1990 committees with 11 countries?

There are $2022$ distinct integer points on the plane. Let $I$ be the number of pairs among these points with exactly $1$ unit apart. Find the maximum possible value of $I$. ([i]Note. An integer point is a point with integer coordinates.[/i]) [i]Proposed by CSJL.[/i]

Depei is imprisoned by an evil wizard and is coerced to play the following game. Every turn, Depei flips a fair coin. Then, the following events occur in this order: $\bullet$ The wizard computes the difference between the total number of heads and the total number of tails Depei has flipped. If that number is greater than or equal to $4$ or less than or equal to $-3$, then Depei is vaporized by the wizard. $\bullet$ The wizard determines if Depei has flipped at least $10$ heads or at least $10$ tails. If so, then the wizard releases Depei from the prison. The probability that Depei is released by the evil wizard equals $\frac{m}{2^k}$ , where $m, k$ are positive integers. Compute $m+k$.

A set of lines in the plan is called [i]nice [/i]i f every line in the set intersects an odd number of other lines in the set. Determine the smallest integer $k \ge 0$ having the following property: for each $2018$ distinct lines $\ell_1, \ell_2, ..., \ell_{2018}$ in the plane, there exist lines $\ell_{2018+1},\ell_{2018+2}, . . . , \ell_{2018+k}$ such that the lines $\ell_1, \ell_2, ..., \ell_{2018+k}$ are distinct and form a [i]nice [/i] set.

A cube consisting of $(2N)^3$ unit cubes is pierced by several needles parallel to the edges of the cube (each needle pierces exactly $2N$ unit cubes). Each unit cube is pierced by at least one needle. Let us call any subset of these needles “regular” if there are no two needles in this subset that pierce the same unit cube. a) Prove that there exists a regular subset consisting of $2N^2$ needles such that all of them have either the same direction or two different directions. b) What is the maximum size of a regular subset that does exist for sure? (Nikita Gladkov, Alexandr Zimin)

There are several teacups in the kitchen, some with handles and the others without handles. The number of ways of selecting two cups without a handle and three with a handle is exactly $1200$. What is the maximum possible number of cups in the kitchen?

Let $G$ be a simple undirected graph with vertices $v_1,v_2,...,v_n$. We denote the number of acyclic orientations of $G$ with $f(G)$. [b]a)[/b] Prove that $f(G)\le f(G-v_1)+f(G-v_2)+...+f(G-v_n)$. [b]b)[/b] Let $e$ be an edge of the graph $G$. Denote by $G'$ the graph obtained by omiting $e$ and making it's two endpoints as one vertex. Prove that $f(G)=f(G-e)+f(G')$. [b]c)[/b] Prove that for each $\alpha >1$, there exists a graph $G$ and an edge $e$ of it such that $\frac{f(G)}{f(G-e)}<\alpha$. [i]Proposed by Morteza Saghafian[/i]

Players $A$ and $B$ play a game with $N \geq 2012$ coins and $2012$ boxes arranged around a circle. Initially $A$ distributes the coins among the boxes so that there is at least $1$ coin in each box. Then the two of them make moves in the order $B,A,B,A,\ldots $ by the following rules: [b](a)[/b] On every move of his $B$ passes $1$ coin from every box to an adjacent box. [b](b)[/b] On every move of hers $A$ chooses several coins that were [i]not[/i] involved in $B$'s previous move and are in different boxes. She passes every coin to an adjacent box. Player $A$'s goal is to ensure at least $1$ coin in each box after every move of hers, regardless of how $B$ plays and how many moves are made. Find the least $N$ that enables her to succeed.

Consider the set $A = \{1, 2, 3, ..., 2n - 1\}$, where $n \ge 2$ is a positive integer. We remove from the set $A$ at least $n - 1$ elements such that: • if $a \in A$ has been removed, and $2a \in A$, then $2a$ has also been removed, • if $a, b \in A (a \ne b)$ have been removed and $a + b \in A$, then $a + b$ has also been removed. Which numbers have to be removed such that the sum of the remaining numbers is maximum?

The country OMEC is divided in $5$ regions, each region is divided in $5$ districts, and, in each district, $1001$ people vote. Each person choose between $A$ or $B$. In a district, a candidate's letter wins if it's the letter with the most votes. In a region, a candidate's letter wins if it won in most districts. A candidate is the new president of OMEC if the candidate won in most regions. The candidate $A$ can rearrange the people of each district in each region (for example, A moves someone in District M to District N in region 1), but he can't change them to a different region. Find the minimum number of votes that the candidate $A$ needs to become the new president.

In a $2^n \times 2^n$ square with $n$ positive integer is covered with at least two non-overlapping rectangle pieces with integer dimensions and a power of two as surface. Prove that two rectangles of the covering have the same dimensions (Two rectangles have the same dimensions as they have the same width and the same height, wherein they, not allowed to be rotated.)

The Frontier Lands have $50$ towns, some pairs of which are directly connected by Morton’s railroad tracks (which are bidirectional and may pass over each other), and it is possible to travel from any town to any other town via these tracks, possibly stopping at other towns on the way. Morton decides that he wants some tracks destroyed so that each town is directly connected to an odd number of other towns. (After Morton destroys the tracks, it might no longer be possible to travel from any town to any other town.) Prove that this is possible.

In the night, stars in the sky are seen in different time intervals. Suppose for every $k$ stars ($k>1$), at least $2$ of them can be seen in one moment. Prove that we can photograph $k-1$ pictures from the sky such that each of the mentioned stars is seen in at least one of the pictures. (The number of stars is finite. Define the moments that the $n^{th}$ star is seen as $[a_n,b_n]$ that $a_n<b_n$.)

Let $A = \frac{1 \cdot 3 \cdot 5\cdot ... \cdot (2n-1)}{2 \cdot 4 \cdot 6 \cdot ... \cdot (2n)}$ Prove that in the infinite sequence $A, 2A, 4A, 8A, ..., 2^k A, ….$ only integers will be observed, eventually.

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.

An $L$ is an arrangement of $3$ adjacent unit squares formed by deleting one unit square from a $2 \times 2$ square. a) How many $L$s can be placed on an $8 \times 8$ board (with no interior points overlapping)? b) Show that if any one square is deleted from a $1987 \times 1987$ board, then the remaining squares can be covered with $L$s (with no interior points overlapping).