Prove that there exist $ 2004 $ pairwise distinct numbers $ n_1,n_2,\ldots ,n_{2004} , $ all greater than $ 1, $ satisfying: $$ \binom{n_1}{2} +\binom{n_2}{2} +\cdots +\binom{n_{2003}}{2} =\binom{n_{2004}}{2} . $$

On a chessboard $8\times 8$, $n>6$ Knights are placed so that for any 6 Knights there are two Knights that attack each other. Find the greatest possible value of $n$.

One bird lives in each of $n$ bird-nests in a forest. The birds change nests, so that after the change there is again one bird in each nest. Also for any birds $A, B, C, D$ (not necessarily distinct), if the distance $AB < CD$ before the change, then $AB > CD$ after the change. Find all possible values of $n$.

Let $n$ be a positive integer. Find the largest integer $N$ for which there exists a set of $n$ weights such that it is possible to determine the mass of all bodies with masses of $1, 2, ..., N$ using a balance scale . (i.e. to determine whether a body with unknown mass has a mass $1, 2, ..., N$, and which namely).

In each vertex of a regular $n$-gon $A_1A_2...A_n$ there is a unique pawn. In each step it is allowed: 1. to move all pawns one step in the clockwise direction or 2. to swap the pawns at vertices $A_1$ and $A_2$. Prove that by a finite series of such steps it is possible to swap the pawns at vertices: a) $A_i$ and $A_{i+1}$ for any $ 1 \leq i < n$ while leaving all other pawns in their initial place b) $A_i$ and $A_j$ for any $ 1 \leq i < j \leq n$ leaving all other pawns in their initial place. [i]Proposed by Matija Bucic[/i]

Ivan has a $m \times n$ board, and he color some squares black, so that no three black squares form a L-triomino up to rotations and reflections. What is the maximal number of black squares that Ivan can color? [i]Proposed by Ivan Chan Kai Chin[/i]

Let $S$ be a set of $n$ points in the plane such that no four points are collinear. Let $\{d_1,d_2,\cdots ,d_k\}$ be the set of distances between pairs of distinct points in $S$, and let $m_i$ be the multiplicity of $d_i$, i.e. the number of unordered pairs $\{P,Q\}\subseteq S$ with $|PQ|=d_i$. Prove that $\sum_{i=1}^k m_i^2\leq n^3-n^2$.

[b]p1.[/b] (a) Put the numbers $1$ to $6$ on the circle in such way that for any five consecutive numbers the sum of first three (clockwise) is larger than the sum of remaining two. (b) Can you arrange these numbers so it works both clockwise and counterclockwise. [b]p2.[/b] A girl has a box with $1000$ candies. Outside the box there is an infinite number of chocolates and muffins. A girl may replace: $\bullet$ two candies in the box with one chocolate bar, $\bullet$ two muffins in the box with one chocolate bar, $\bullet$ two chocolate bars in the box with one candy and one muffin, $\bullet$ one candy and one chocolate bar in the box with one muffin, $\bullet$ one muffin and one chocolate bar in the box with one candy. Is it possible that after some time it remains only one object in the box? [b]p3.[/b] Find any integer solution of the puzzle: $WE+ST+RO+NG=128$ (different letters mean different digits between $1$ and $9$). [b]p4.[/b] Two consecutive three‐digit positive integer numbers are written one after the other one. Show that the six‐digit number that is obtained is not divisible by $1001$. [b]p5.[/b] There are $9$ straight lines drawn in the plane. Some of them are parallel some of them intersect each other. No three lines do intersect at one point. Is it possible to have exactly $17$ intersection points? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Arnie draws $20$ real numbers independently and uniformly at random from the interval $[0, 1].$ Given that the largest number that Arnie draws equals $\tfrac{19}{20},$ the expected value of the average of the $20$ numbers can be written as $\tfrac{m}{n}$ for relatively prime positive integers $m$ and $n.$ Find $m + n.$

$10$ numbers are placed on a circle. Their sum is equal to $100$. A sum of any three neighbouring numbers is no less than $29$. Find the minimal number $A$ such that for any such set of 10 numbers none of them is greater than $A$. Prove that this value for $A$ is really minimal. (A. Tolpygo, Kiev)

Hesam chose $10$ distinct positive integers and he gave all pairwise $\gcd$'s and pairwise ${\text lcm}$'s (a total of $90$ numbers) to Masoud. Can Masoud always find the first $10$ numbers, just by knowing these $90$ numbers? [i]Proposed by Morteza Saghafian [/i]

The maximum number of solid regular tetrahedrons can be placed against each other so that one of their edges coincides with a given line segment in space? [hide=original wording]Hoeveel massieve regelmatige viervlakken kan men maximaal tegen mekaar plaatsen zodat ´e´en van hun ribben samenvalt met een gegeven lijnstuk in de ruimte?[/hide]

[b](9.7)[/b] On the segment $[0, 2002]$ its ends and the point with coordinate $d$ are marked, where $d$ is a coprime number to $1001$. It is allowed to mark the midpoint of any segment with ends at the marked points, if its coordinate is integer. Is it possible, by repeating this operation several times, to mark all the integer points on a segment? [b](10.7)[/b] On the segment $[0, 2002]$ its ends and $n-1 > 0$ integer points are marked so that the lengths of the segments into which the segment $ [0, 2002]$ is divided are corpime in the total (i.e., have no common divisor greater than $1$). It is allowed to divide any segment with marked ends into $n$ equal parts and mark the division points if they are all integers. (The point can be marked a second time, but it remains marked.) Is it possible, by repeating this operation several times, mark all the integer points on the segment? [b](11.8)[/b] On the segment $ [0,N]$ its ends and $2 $ more points are marked so that the lengths segments into which the segment $[0,N]$ is divided are integer and coprime in total. If there are two marked points $A$ and $B$ such that the distance between them is a multiple of $3$, then we can divide from cutting $AB$ by $3$ equal parts, mark one of the division points and erase one of the points $A, B$. Is it true that for several such actions you can mark any predetermined integer point of the segment $[0,N]$?

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?

A square $ (n \minus{} 1) \times (n \minus{} 1)$ is divided into $ (n \minus{} 1)^2$ unit squares in the usual manner. Each of the $ n^2$ vertices of these squares is to be coloured red or blue. Find the number of different colourings such that each unit square has exactly two red vertices. (Two colouring schemse are regarded as different if at least one vertex is coloured differently in the two schemes.)

In a mathematical challenge, positive real numbers $a_{1}\geq a_{2} \geq ... \geq a_{n}$ and an initial sequence of positive real numbers $(b_{1}, b_{2},...,b_{n+1})$ are given to Secco. Let $C$ a non-negative real number. In a sequence $(x_{1},x_{2},...,x_{n+1})$, consider the following operation: Subtract $1$ of some $x_{j}$, $j \in \{1,2,...,n+1\}$, add $C$ to $x_{n+1}$ and replace $(x_{1},x_{2},...,x_{j-1})$ for $(x_{1}+a_{\sigma (1)}, x_{2}+a_{\sigma (2)}, ..., x_{j-1}+a_{\sigma (j-1)})$, where $\sigma$ is a permutation of $(1,2,...,j-1)$. Secco's goal is to make all terms of sequence $(b_{k})$ negative after a finite number of operations. Find all values of $C$, depending of $a_{1}, a_{2},..., a_{n}, b_{1}, b_{2}, ..., b_{n+1}$, for which Secco can attain his goal.

We consider the infinite chessboard covering the whole plane. In every field of the chessboard there is a nonnegative real number. Every number is the arithmetic mean of the numbers in the four adjacent fields of the chessboard. Prove that the numbers occurring in the fields of the chessboard are all equal.

A die is thrown six times. How many ways are there for the six rolls to sum to $21$?

The schoolboy wrote a homework essay on the topic “How I spent my summer.” Two of his comrades from a neighboring school decided not to bother themselves with work and rewrote his essay. But while rewriting they made several mistakes - each their own. Before submitting their work, both students gave their essays to four other friends to rewrite (each gave them to two acquaintances). These four schoolchildren do the same, and so on. With each rewrite, all previous mistakes are saved and, possibly, new ones are made. It is known that on some day each new essay contained at least $10$ errors. Prove that there was a day when at least $11$ new mistakes were made in total.

Consider coins with positive real denominations not exceeding 1. Find the smallest $C>0$ such that the following holds: if we have any $100$ such coins with total value $50$, then we can always split them into two stacks of $50$ coins each such that the absolute difference between the total values of the two stacks is at most $C$. [i]Merlijn Staps[/i]

For any triple $(a, b, c)$ of positive integers, not all equal, We are given sufficiently many rectangular blocks of size $a \times b \times c$. We use these blocks to fill up a cubic box of edge $10$. (a) Assume we have used at least $100$ blocks. Show that there are two blocks, one of which is a translate of the other. (b) Find a number smaller than $100$ (the smaller, the better) for which the above statement still holds.

$a_1,a_2,\dots,a_k$ and $b_1,b_2,\dots,a_n$ are integer sequences with $a_1=b_1=0$, $a_k=26,b_n=25$, and $k+n=23$. It is known that $a_{i+1}-a_i=2\enspace\text{or}\enspace3$ and $b_{j+1}-b_j=2\enspace\text{or}\enspace3$ for all applicable $i$ and $j$, and the numbers $a_2,\dots,a_k,b_2,\dots,b_n$ are pairwise different. Determine the total number of such pairs of sequences.

[u]Round 1[/u] [b]p1.[/b] How many distinct ways are there to scramble the letters in $EXETER$? [b]p2.[/b] Given that $\frac{x - y}{x - z}= 3$, find $\frac{x - z}{y - z}$. [b]p3.[/b] When written in base $10$, $9^9 =\overline{ABC420DEF}.$ Find the remainder when $A + B + C + D + E + F$ is divided by $9$. [u]Round 2[/u] [b]p4.[/b] How many positive integers, when expressed in base $7$, have exactly $3$ digits, but don't contain the digit $3$? [b]p5.[/b] Pentagon $JAMES$ is such that its internal angles satisfy $\angle J = \angle A = \angle M = 90^o$ and $\angle E = \angle S$. If $JA = AM = 4$ and $ME = 2$, what is the area of $JAMES$? [b]p6.[/b] Let $x$ be a real number such that $x = \frac{1+\sqrt{x}}{2}$ . What is the sum of all possible values of $x$? [u]Round 3[/u] [b]p7.[/b] Farmer James sends his favorite chickens, Hen Hao and PEAcock, to compete at the Fermi Estimation All Star Tournament (FEAST). The first problem at the FEAST requires the chickens to estimate the number of boarding students at Eggs-Eater Academy given the number of dorms $D$ and the average number of students per dorm $A$. Hen Hao rounds both $D$ and $A$ down to the nearest multiple of $10$ and multiplies them, getting an estimate of $1200$ students. PEAcock rounds both $D$ and $A$ up to the nearest multiple of $10$ and multiplies them, getting an estimate of $N$ students. What is the maximum possible value of $N$? [b]p8.[/b] Farmer James has decided to prepare a large bowl of egg drop soup for the Festival of Eggs-Eater Annual Soup Tasting (FEAST). To flavor the soup, Hen Hao drops eggs into it. Hen Hao drops $1$ egg into the soup in the first hour, $2$ eggs into the soup in the second hour, and so on, dropping $k$ eggs into the soup in the $k$th hour. Find the smallest positive integer $n$ so that after exactly n hours, Farmer James finds that the number of eggs dropped in his egg drop soup is a multiple of $200$. [b]p9.[/b] Farmer James decides to FEAST on Hen Hao. First, he cuts Hen Hao into $2018$ pieces. Then, he eats $1346$ pieces every day, and then splits each of the remaining pieces into three smaller pieces. How many days will it take Farmer James to eat Hen Hao? (If there are fewer than $1346$ pieces remaining, then Farmer James will just eat all of the pieces.) [u]Round 4[/u] [b]p10.[/b] Farmer James has three baskets, and each basket has one magical egg. Every minute, each magical egg disappears from its basket, and reappears with probability $\frac12$ in each of the other two baskets. Find the probability that after three minutes, Farmer James has all his eggs in one basket. [b]p11.[/b] Find the value of $\frac{4 \cdot 7}{\sqrt{4 +\sqrt7} +\sqrt{4 -\sqrt7}}$. [b]p12.[/b] Two circles, with radius $6$ and radius $8$, are externally tangent to each other. Two more circles, of radius $7$, are placed on either side of this configuration, so that they are both externally tangent to both of the original two circles. Out of these $4$ circles, what is the maximum distance between any two centers? PS. You should use hide for answers. Rounds 5-8 have been posted [url=https://artofproblemsolving.com/community/c3h2949222p26406222]here[/url]. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $n \geq 2$ and $m$ be positive integers. $m$ ballot boxes are placed in a line. Two players $A$ and $B$ play by turns, beginning with $A$, in the following manner. Each turn, $A$ chooses two boxes and places a ballot in each of them. Afterwards, $B$ chooses one of the boxes, and removes every ballot from it. $A$ wins if after some turn of $B$, there exists a box containing $n$ ballots. For each $n$, find the minimum value of $m$ such that $A$ can guarantee a win independently of how $B$ plays.

Let $T_n$ be the number of non-congruent triangles with positive area and integer side lengths summing to $n$. Prove that $T_{2022}=T_{2019}$. [i]Proposed by Constantinos Papachristoforou[/i]