For a given integer $n\ge 2$, let $a_0,a_1,\ldots ,a_n$ be integers satisfying $0=a_0<a_1<\ldots <a_n=2n-1$. Find the smallest possible number of elements in the set $\{ a_i+a_j \mid 0\le i \le j \le n \}$.

[b]p1.[/b] Twenty five horses participate in a competition. The competition consists of seven runs, five horse compete in each run. Each horse shows the same result in any run it takes part. No two horses will give the same result. After each run you can decide what horses participate in the next run. Could you determine the three fastest horses? (You don’t have stopwatch. You can only remember the order of the horses.) [b]p2.[/b] Prove that the equation $x^6-143x^5-917x^4+51x^3+77x^2+291x+1575=0$ does not have solutions in integer numbers. [b]p3.[/b] Show how we can cut the figure shown in the picture into two parts for us to be able to assemble a square out of these two parts. Show how we can assemble a square. [img]https://cdn.artofproblemsolving.com/attachments/7/b/b0b1bb2a5a99195688638425cf10fe4f7b065b.png[/img] [b]p4.[/b] The city of Vyatka in Russia produces local drink, called “Vyatka Cola”. «Vyatka Cola» is sold in $1$, $3/4$, and $1/2$-gallon bottles. Ivan and John bought $4$ gallons of “Vyatka Cola”. Can we say for sure, that they can split the Cola evenly between them without opening the bottles? [b]p5.[/b] Positive numbers a, b and c satisfy the condition $a + bc = (a + b)(a + c)$. Prove that $b + ac = (b + a)(b + c)$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Consider 6 points on a plane such that 8 of the distances between them are equal to 1. Prove that there are at least 3 points that form an equilateral triangle.

In the country of [i]Sugarland[/i], there are $13$ students in the IMO team selection camp. $6$ team selection tests were taken and the results have came out. Assume that no students have the same score on the same test.To select the IMO team, the national committee of math Olympiad have decided to choose a permutation of these $6$ tests and starting from the first test, the person with the highest score between the remaining students will become a member of the team.The committee is having a session to choose the permutation. Is it possible that all $13$ students have a chance of being a team member? [i]Proposed by Morteza Saghafian[/i]

Consider the graph on $1000$ vertices $v_1, v_2, ...v_{1000}$ such that for all $1 \le i < j \le 1000$, $v_i$ is connected to $v_j$ if and only if $i$ divides $j$. Determine the minimum number of colors that must be used to color the vertices of this graph such that no two vertices sharing an edge are the same color.

A spider built a web on the unit circle. The web is a planar graph with straight edges inside the circle, bounded by the circumference of the circle. Each vertex of the graph lying on the circle belongs to a unique edge, which goes perpendicularly inward to the circle. For each vertex of the graph inside the circle, the sum of the unit outgoing vectors along the edges of the graph is zero. Prove that the total length of the web is equal to the number of its vertices on the circle.

$2023$ balls are divided into several buckets such that no bucket contains more than $99$ balls. We can remove balls from any bucket or remove an entire bucket, as many times as we want. Prove that we can remove them in such a way that each of the remaining buckets will have an equal number of balls and the total number of remaining balls will be at least $100$.

Let N be a positive integer greater than 2. We number the vertices of a regular 2n-gon clockwise with the numbers 1, 2, . . . ,N,−N,−N + 1, . . . ,−2,−1. Then we proceed to mark the vertices in the following way. In the first step we mark the vertex 1. If ni is the vertex marked in the i-th step, in the i+1-th step we mark the vertex that is |ni| vertices away from vertex ni, counting clockwise if ni is positive and counter-clockwise if ni is negative. This procedure is repeated till we reach a vertex that has already been marked. Let $f(N)$ be the number of non-marked vertices. (a) If $f(N) = 0$, prove that 2N + 1 is a prime number. (b) Compute $f(1997)$.

We call a square table of a binary, if at each cell is written a single number 0 or 1. The binary table is called regular if each row and each column exactly two units. Determine the number of regular size tables $n\times n$ ($n> 1$ - given a fixed positive integer). (We can assume that the rows and columns of the tables are numbered: the cases of coincidence in turn, reflect, and so considered different).

The towns in one country are connected with bidirectional airlines, which are paid in at least one of the two directions. In a trip from town A to town B there are exactly 22 routes that are free. Find the least possible number of towns in the country.

Jeff has a deck of $12$ cards: $4$ $L$s, $4$ $M$s, and $4$ $T$s. Armaan randomly draws three cards without replacement. The probability that he takes $3$ $L$s can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m +n$.

[b]p1.[/b] Archimedes, Euclid, Fermat, and Gauss had a math competition. Archimedes said, “I did not finish $1$st or $4$th.” Euclid said, “I did not finish $4$th.” Fermat said, “I finished 1st.” Gauss said, “I finished $4$th.” There were no ties in the competition, and exactly three of the mathematicians told the truth. Who finished first and who finished last? Justify your answers. [b]p2.[/b] Find the area of the set in the xy-plane defined by $x^2 - 2|x| + y^2 \le 0$. Justify your answer. [b]p3.[/b] There is a collection of $2004$ circular discs (not necessarily of the same radius) in the plane. The total area covered by the discs is $1$ square meter. Show that there is a subcollection $S$ of discs such that the discs in S are non-overlapping and the total area of the discs in $S$ is at least $1/9$ square meter. [b]p4.[/b] Let $S$ be the set of all $2004$-digit integers (in base $10$) all of whose digits lie in the set $\{1, 2, 3, 4\}$. (For example, $12341234...1234$ is in $S$.) Let $n_0$ be the number of $s \in S$ such that $s$ is a multiple of $3$, let $n_1$ be the number of $s \in S$ such that $s$ is one more than a multiple of $3$, and let $n_2$ be the number of $s \in S$ such that $s$ is two more than a multiple of $3$. Determine which of $n_0$, $n_1$, $n_2$ is largest and which is smallest (and if there are any equalities). Justify your answers. [b]p5.[/b] There are $6$ members on the Math Competition Committee. The problems are kept in a safe. There are $\ell$ locks on the safe and there are $k$ keys, several for each lock. The safe does not open unless all of the locks are unlocked, and each key works on exactly one lock. The keys should be distributed to the $6$ members of the committee so that each group of $4$ members has enough keys to open all of the $\ell$ locks. However, no group of $3$ members should be able to open all of the $\ell$ locks. (a) Show that this is possible with $\ell = 20$ locks and $k = 60$ keys. That is, it is possible to use $20$ locks and to choose and distribute 60 keys in such a way that every group of $4$ can open the safe, but no group of $3$ can open the safe. (b) Show that we always must have $\ell \ge 20$ and $k\ge60$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $A_1,A_2,...,A_n$ be $n$ finite subsets of a set $X, n \ge 2$, such that (i) $|A_i| \ge 2, 1 \le i \le n$, (ii) $ |A_i \cap A_j | \ne 1, j \le i < j \le n$. Prove that the elements of $A_1 \cup A_2 \cup ... \cup A_n$ may be colored with $2$ colors so that no $A_i$ is colored by the same color.

A $100 \times 100 \times 100$ cube is divided into a million unit cubes and in each small cube there is a light bulb. Three faces $100 \times 100$ of the large cube having a common vertex are painted: one in red, one in blue and the other in green. Call a $\textit{column}$ a set of $100$ cubes forming a block $1 \times 1 \times 100$. Each of the $30 000$ columns have one painted end cell, on which there is a switch. After pressing a switch, the states of all light bulbs of this column are changed. Petya pressed several switches, getting a situation with exactly $k$ lamps on. Prove that Vasya can press several switches so that all lamps are off, but by using no more than $\frac {k} {100}$ switches on the red face.

There is a square of checkered paper measuring $102 \times 102$ squares and a connected figure of unknown shape, consisting of 101 cells. What is the largest number of such figures that can be cut from this square with a guarantee? A figure made up of cells is called [i]connected [/i] if any two its cells can be connected by a chain of its cells in which any two adjacent cells have a common side.

A die is an unitary cube with numbers from $1$ to $6$ written on its faces, so that each number appears once and the sum of the numbers on any two opposite faces is $7$. We construct a large $3 \cdot 3 \cdot 3$ cube using$ 27$ dice. Find all possible values of the sum of numbers which can be seen on the faces of the large cube.

Express the sum $S_m(n)=1^m+2^m+\ldots +(n-1)^m$ with Bernolli numbers.

Among $18$ parts placed in a row, some three in a row weigh $99 $ g each, and all the rest weigh $100$ g each. On a scale with an arrow, identify all $99$-gram parts.

The $U$-tile is made up of $1 \times 1$ squares and has the following shape: [img]https://cdn.artofproblemsolving.com/attachments/8/7/5795ee33444055794119a99e675ef977add483.png[/img] where there are two vertical rows of a squares, one horizontal row of $b$ squares, and also $a \ge 2$ and $b \ge 3$. Notice that there are different types of tile $U$ . For example, some types of $U$ tiles are as follows: [img]https://cdn.artofproblemsolving.com/attachments/0/3/ca340686403739ffbbbb578d73af76e81a630e.png[/img] Prove that for each integer $n \ge 6$, the board of $n\times n$ can be completely covered with $U$-tiles , with no gaps and no overlapping clicks. Clarifications: The $U$-tiles can be rotated. Any amount can be used in the covering of tiles of each type.

Zach rolls five tetrahedral dice, each of whose faces are labeled $1, 2, 3$, and $4$. Compute the probability that the sum of the values of the faces that the dice land on is divisible by $3$.

A balance has a left pan, a right pan, and a pointer that moves along a graduated ruler. Like many other grocer balances, this one works as follows: An object of weight $ L$ is placed in the left pan and another of weight $ R$ in the right pan, the pointer stops at the number $ R \minus{} L$ on the graduated ruler. There are $ n, (n \geq 2)$ bags of coins, each containing $ \frac{n(n\minus{}1)}{2} \plus{} 1$ coins. All coins look the same (shape, color, and so on). $ n\minus{}1$ bags contain real coins, all with the same weight. The other bag (we don’t know which one it is) contains false coins. All false coins have the same weight, and this weight is different from the weight of the real coins. A legal weighing consists of placing a certain number of coins in one of the pans, putting a certain number of coins in the other pan, and reading the number given by the pointer in the graduated ruler. With just two legal weighings it is possible to identify the bag containing false coins. Find a way to do this and explain it.

Let $n\ge5$ be an integer. A trapezoid with base lengths of $1$ and $r$ is tiled by $n$ (not necessarily congruent) equilateral triangles. In terms of $n$, find the maximum possible value of $r$. [i]Linus Tang[/i]

Let $n$ be a positive integer. There exist $n$ ordered triples$$(x_1, y_1, z_1), (x_2, y_2, z_2), \dots, (x_n, y_n, z_n)$$where each coordinate is an integer between $1$ and $100$ (inclusive), satisfying the following condition: [center] [i]For every infinite sequence $(a_1, a_2, a_3, \dots)$ of integers between $1$ and $100$, there exist a positive integer $i$ and an index $j$ (with $1 \leqslant j \leqslant n$) such that $(a_i, a_{i+1}, a_{i+2}) = (x_j, y_j, z_j)$.[/i] [/center] Determine the minimum possible value of $n$.

Let $n$ be a positive integer. Elfie the Elf travels in $\mathbb{R}^3$. She starts at the origin: $(0,0,0)$. In each turn she can teleport to any point with integer coordinates which lies at distance exactly $\sqrt{n}$ from her current location. However, teleportation is a complicated procedure: Elfie starts off [i]normal[/i] but she turns [i]strange[/i] with her first teleportation. Next time she teleports she turns [i]normal[/i] again, then [i]strange [/i]again... etc. For which $n$ can Elfie travel to any point with integer coordinates and be [i]normal [/i]when she gets there?

Prove that any finite set $H$ of lattice points on the plane has a subset $K$ with the following properties: [list] [*]any vertical or horizontal line in the plane cuts $K$ in at most $2$ points, [*]any point of $H\setminus K$ is contained by a segment with endpoints from $K$.[/list]