Pål has more chickens than he can manage to keep track of. Therefore, he keeps an index card for each chicken. He keeps the cards in ten boxes, each of which has room for $2021$ cards. Unfortunately, Pål is quite disorganized, so he may lose some of his boxes. Therefore, he makes several copies of each card and distributes them among different boxes, so that even if he can only find seven boxes, no matter which seven, these seven boxes taken together will contain at least one card for each of his chickens. What is the largest number of chickens Pål can keep track of using this system?

Find all triplets $(k, m, n)$ of positive integers having the following property: Square with side length $m$ can be divided into several rectangles of size $1\times k$ and a square with side length $n$.

In a country, there are $2018$ cities, some of which are connected by roads. Each city is connected to at least three other cities. It is possible to travel from any city to any other city using one or more roads. For each pair of cities, consider the shortest route between these two cities. What is the greatest number of roads that can be on such a shortest route?

A neighborhood consists of $10 \times 10$ squares. On New Year's Eve it snowed for the first time and since then exactly $10$ cm of snow fell on each square every night (and snow fell only at night). Every morning, the janitor selects one row or column and shovels all the snow from there onto one of the adjacent rows or columns (from each cell to the adjacent side). For example, he can select the seventh column and from each of its cells shovel all the snow into the cell of the left of it. You cannot shovel snow outside the neighborhood. On the evening of the 100th day of the year, an inspector will come to the city and find the cell with the snowdrift of maximal height. The goal of the janitor is to ensure that this height is minimal. What height of snowdrift will the inspector find? [i]Proposed by A. Solynin[/i]

Let $k$ be a positive real. $A$ and $B$ play the following game: at the start, there are $80$ zeroes arrange around a circle. Each turn, $A$ increases some of these $80$ numbers, such that the total sum added is $1$. Next, $B$ selects ten consecutive numbers with the largest sum, and reduces them all to $0$. $A$ then wins the game if he/she can ensure that at least one of the number is $\geq k$ at some finite point of time. Determine all $k$ such that $A$ can always win the game.

We are given $100$ points. $N$ of these are vertices of a convex $N$-gon and the other $100 - N$ of these are inside this $N$-gon. The labels of these points make it impossible to tell whether or not they are vertices of the $N$-gon. It is known that no three points are collinear and that no $4$ points belong to two parallel lines. It has been decided to ask questions of the following type: What is the area of the triangle $XYZ$, where $X, Y$ and $Z$ are labels representing three of the $100$ given points? Prove that $300$ such questions are sufficient in order to clarify which points are vertices and to determine the area of the $N$-gon. (D. Fomin, Leningrad)

Let $n \ge 3$ be a positive integer, and let $S$ be a set of $n$ distinct points in the plane. Call an unordered pair of distinct points ${A,B}$ [i]tasty[/i] if there exists a circle passing through $A$ and $B$ not passing through or containing any other point in $S$. Find the maximum number of tasty pairs over all possible sets $S$ of $n$ points. [i]Tiger Zhang[/i]

$101$ wise men stand in a circle. Each of them either thinks that the Earth orbits Jupiter or that Jupiter orbits the Earth. Once a minute, all the wise men express their opinion at the same time. Right after that, every wise man who stands between two people with a different opinion from him changes his opinion himself. The rest do not change. Prove that at one point they will all stop changing opinions.

For every positive integer $m$, a $m\times 2018$ rectangle consists of unit squares (called "cell") is called [i]complete[/i] if the following conditions are met: i. In each cell is written either a "$0$", a "$1$" or nothing; ii. For any binary string $S$ with length $2018$, one may choose a row and complete the empty cells so that the numbers in that row, if read from left to right, produce $S$ (In particular, if a row is already full and it produces $S$ in the same manner then this condition ii. is satisfied). A [i]complete[/i] rectangle is called [i]minimal[/i], if we remove any of its rows and then making it no longer [i]complete[/i]. a. Prove that for any positive integer $k\le 2018$ there exists a [i]minimal[/i] $2^k\times 2018$ rectangle with exactly $k$ columns containing both $0$ and $1$. b. A [i]minimal[/i] $m\times 2018$ rectangle has exactly $k$ columns containing at least some $0$ or $1$ and the rest of columns are empty. Prove that $m\le 2^k$.

Prove that there exists some positive real number $\lambda$ such that for any $D_{>1}\in\mathbb{R}$, one can always find an acute triangle $\triangle ABC$ in the Cartesian plane such that [list] [*] $A, B, C$ lie on lattice points; [*] $AB, BC, CA>D$; [*] $S_{\triangle ABC}<\frac{\sqrt 3}{4}D^2+\lambda\cdot D^{4/5}$.

More than three quarters of the circumference of a circle is colored black. Prove that there exists a rectangle such that all of its vertices are black. Actually the result holds if "three quarters" is replaced by "one half"...

Some $n > 2$ lamps are cyclically connected: lamp $1$ with lamp $2$, ... , lamp $k$ with $k+1$, ... , lamp $n$ with lamp $1$. At the beginning, all lamps are off. When one pushes the switch of a lamp, that lamp and the two ones connected to it change status (from off to on, or vice-versa). Determine the number of configurations of lamps reachable from the initial one, through some set of switches being pushed.

[b]p1.[/b] Two perpendicular chords intersect in a circle. The lengths of the segments of one chord are $3$ and $4$. The lengths of the segments of the other chord are $6$ and $2$. Find the diameter of the circle. [b]p2.[/b] Determine the greatest integer that will divide $13,511$, $13,903$ and $14,589$ and leave the same remainder. [b]p3.[/b] Suppose $A, B$ and $C$ are the angles of the triangle. Show that $\cos^2 A + \cos^2 B + \cos^2 C + 2 \cos A \cos B \cos C = 1$ [b]p4.[/b] Given the linear fractional transformation $f_1(x) =\frac{2x - 1}{x + 1}$. Define $f_{n+1}(x) = f_1(f_n(x))$ for $n = 1, 2, 3,...$ . It can be shown that $f_{35} = f_5$. (a) Find a function $g$ such that $f_1(g(x)) = g(f_1(x)) = x$. (b) Find $f_{28}$. [b]p5.[/b] Suppose $a$ is a complex number such that $a^{10} + a^5 + 1 = 0$. Determine the value of $a^{2005} + \frac{1}{a^{2005}}$. PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

Let $S$ be the set of $10$-tuples of non-negative integers that have sum $2019$. For any tuple in $S$, if one of the numbers in the tuple is $\geq 9$, then we can subtract $9$ from it, and add $1$ to the remaining numbers in the tuple. Call thus one operation. If for $A,B\in S$ we can get from $A$ to $B$ in finitely many operations, then denote $A\rightarrow B$. (1) Find the smallest integer $k$, such that if the minimum number in $A,B\in S$ respectively are both $\geq k$, then $A\rightarrow B$ implies $B\rightarrow A$. (2) For the $k$ obtained in (1), how many tuples can we pick from $S$, such that any two of these tuples $A,B$ that are distinct, $A\not\rightarrow B$.

Prove that all subsets of a finite set can be arranged in a sequence in which every two successive subsets differ in exactly one element.

A Bluetooth device can connect to any other Bluetooth device that is not more than $10$ meters from him. A piconet is called a bluetooth network consisting of one master and a plurality of connected slaves. What is the greatest number of slaves, what can be on the pickup provided that all devices are on the same level and all slaves are out of range of each other?

Let $a$ and $b$ be distinct positive integers. The following infinite process takes place on an initially empty board. [list=i] [*] If there is at least a pair of equal numbers on the board, we choose such a pair and increase one of its components by $a$ and the other by $b$. [*] If no such pair exists, we write two times the number $0$. [/list] Prove that, no matter how we make the choices in $(i)$, operation $(ii)$ will be performed only finitely many times. Proposed by [I]Serbia[/I].

Several boys and girls are dancing a waltz at a ball. Is it possible that each girl can always get to dance the next dance with either a more handsome or more clever boy than for the previous dance, and that each time at least $80\%$ of the girls get to dance the next dance with a boy who is more handsome and more clever? (The numbers of boys and girls are equal and all are dancing.) (AY Belov)

Consider $111$ distinct points which lie on or in the internal of a circle with radius 1.Prove that there are at least $1998$ segments formed by these points with length $\leq \sqrt{3}$

(a) An infinite sheet is divided into squares by two sets of parallel lines. Two players play the following game: the first player chooses a square and colours it red, the second player chooses a non-coloured square and colours it blue, the first player chooses a non-coloured square and colours it red, the second player chooses a non-coloured square and colours it blue, and so on. The goal of the first player is to colour four squares whose vertices form a square with sides parallel to the lines of the two parallel sets. The goal of the second player is to prevent him. Can the first player win? (b) What is the answer to this question if the second player is permitted to colour two squares at once? (DG Azov) PS. (a) for Juniors, (a),(b) for Seniors

$n\geq 4$ is an integer number. For any permutation $x_1,x_2,\cdots,x_n$ of the numbers $1,2 \cdots,n$ we write the number $$ x_1+2x_2+\cdots+nx_n $$ on the board. Compute the number of total distinct numbers written on the board.

2025 IMO leaders are discussing $100$ problems in a meeting. For each $i = 1, 2,\ldots , 100$, each leader will talk about the $i$-th problem for $i$-th minutes. The chair can assign one leader to talk about a problem of his choice, but he would have to wait for the leader to complete the entire talk of that problem before assigning the next leader and problem. The next leader can be the same leader. The next problem can be a different problem. Each leader’s longest idle time is the longest consecutive time that he is not talking. Find the minimum positive integer $T$ so that the chair can ensure that the longest idle time for any leader does not exceed $T$. [i]Proposed by usjl[/i]

There are $15$ boys and $15$ girls in the class. The first girl is friends with $4$ boys, the second with $5$, the third with $6$, . . . , the $11$th with $14$, and each of the other four girls is friends with all the boys. It turned out that there are exactly $3 \cdot 2^{25}$ ways to split the entire class into pairs, so that each pair has a boy and a girl who are friends. Prove that any of the friends of the first girl are friends with all the other girls too. [i]G.M.Sharafetdinova[/i]

A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even. [i]Proposed by Jeck Lim, Singapore[/i]

The first $510$ positive integers are written on a blackboard: $1, 2, 3, ..., 510$. An [i]operation [/i] consists of of erasing two numbers whose sum is a prime number. What is the maximum number of operations in a row what can be done? Show how it is accomplished and explain why it can be done in no more operations.