Find the largest constant $c$, such that if there are $N$ discs in the plane such that every two of them intersect, then there must exist a point which lies in the common intersection of $cN + O(1)$ discs

An integer is called [i]formidable[/i] if it can be written as a sum of distinct powers of $4$, and [i]successful [/i] if it can be written as a sum of distinct powers of $6$. Can $2005$ be written as a sum of a [i]formidable [/i] number and a [i]successful [/i] number? Prove your answer.

Given an equilateral triangle, all points on its sides are colored in one of two given colors. Prove that the is a right-angled triangle such that its three vertices are in the same color and on the sides of the equilateral triangle. [i]Alhaji Akbar, Jakarta[/i]

Let $A$ be a set of numbers chosen from $1,2,..., 2015$ with the property that any two distinct numbers, say $x$ and $y$, in $A$ determine a unique isosceles triangle (which is non equilateral) whose sides are of length $x$ or $y$. What is the largest possible size of $A$?

There are many opposition societies in the city of N. Each society consists of $10$ members. It is known that for every $2004$ societies there is a person belonging to at least $11$ of them. Prove that the government can arrest $2003$ people so that at least one member of each society is arrested. [i]Proposed by V.Dolnikov, D.Karpov[/i]

Any two vertices $A,B$ of a regular $n$-gon are connected by an oriented segment (i.e. either $A\to B$ or $B\to A$). Find the maximum possible number of quadruples $(A,B,C,D)$ of vertices such that $A\to B\to C\to D\to A$.

Let us name a move of the chess knight horizontal if it moves two cells horizontally and one vertically, and vertical otherwise. It is required to place the knight on a cell of a ${46} \times {46}$ board and alternate horizontal and vertical moves. Prove that if each cell is visited not more than once then the number of moves does not exceed 2024. Alexandr Gribalko

There are n cups arranged on the circle. Under one of cups is hiden a coin. For every move, it is allowed to choose 4 cups and verify if the coin lies under these cups. After that, the cups are returned into its former places and the coin moves to one of two neigbor cups. What is the minimal number of moves we need in order to eventually find where the coin is?

Maisy and Jeff are playing a game with a deck of cards with $4$ $0$’s, $4$ $1$’s, $4$ $2$’s, all the way up to $4$ $9$’s. You cannot tell apart cards of the same number. After shuffling the deck, Maisy and Jeff each take $4$ cards, make the largest $4$-digit integer they can, and then compare. The person with the larger $4$-digit integer wins. Jeff goes first and draws the cards $2,0,2,1$ from the deck. Find the number of hands Maisy can draw to beat that, if the order in which she draws the cards matters. [i]Proposed by Richard Chen[/i]

A grid consists of all points of the form $(m, n)$ where $m$ and $n$ are integers with $|m|\le 2019,|n| \le 2019$ and $|m| +|n| < 4038$. We call the points $(m,n)$ of the grid with either $|m| = 2019$ or $|n| = 2019$ the [i]boundary points[/i]. The four lines $x = \pm 2019$ and $y= \pm 2019$ are called [i]boundary lines[/i]. Two points in the grid are called [i]neighbours [/i] if the distance between them is equal to $1$. Anna and Bob play a game on this grid. Anna starts with a token at the point $(0,0)$. They take turns, with Bob playing first. 1) On each of his turns. Bob [i]deletes [/i] at most two boundary points on each boundary line. 2) On each of her turns. Anna makes exactly three [i]steps[/i] , where a [i]step [/i] consists of moving her token from its current point to any neighbouring point, which has not been deleted. As soon as Anna places her token on some boundary point which has not been deleted, the game is over and Anna wins. Does Anna have a winning strategy? [i]Proposed by Demetres Christofides, Cyprus[/i]

In a new edition of QoTD duels, $n \ge 2$ ranked contestants (numbered 1 to $n$) play a round robin tournament (i.e. each pair of contestants compete against each other exactly once); no draws are possible. Define an upset to be a pair $(i, j)$ where$ i > j$ and contestant $i$ wins against contestant $j$. At the end of the tournament, contestant $i$ has $s_i$ wins for each $1 \le i \le n$. The result of the tournament is defined as the $n$-tuple $(s_1, s_2, \cdots , s_n)$. An $n$-tuple $S$ is called interesting if, among the distinct tournaments that produce $S$ as a result, the number of tournaments with an odd number of upsets is not equal to the number of tournaments with an even number of upsets. Find the number of interesting $n$-tuples in terms of $n$. [i](Two tournaments are considered distinct if the outcome of some match differs.)[/i]

Each point of a plane with both coordinates being integers has been colored black or white. Show that there exists an infinite subset of colored points, whose points are in the same color, having a center of symmetry. [EDIT: added condition about being infinite - now it makes sense]

Given a convex polygon $ G$, show that there are three vertices of $ G$ which form a triangle so that it's perimeter is not less than 70% of the polygon's perimeter.

The wizards $A, B, C, D$ know that the integers $1, 2, \ldots, 12$ are written on 12 cards, one integer on each card, and that each wizard will get three cards and will see only his own cards. Having received the cards, the wizards made several statements in the following order. [list=A] [*]“One of my cards contains the number 8”. [*]“All my numbers are prime”. [*]“All my numbers are composite and they all have a common prime divisor”. [*]“Now I know all the cards of each wizard”. [/list] What were the cards of $A{}$ if everyone was right? [i]Mikhail Evdokimov[/i]

Let $N$ be an integer greater than $1$ and let $T_n$ be the number of non empty subsets $S$ of $\{1,2,.....,n\}$ with the property that the average of the elements of $S$ is an integer.Prove that $T_n - n$ is always even.

Let $m$, $n$ be positive integers. On an $m\times{n}$ checkerboard, divided into $1\times1$ squares, we consider all paths that go from upper right vertex to the lower left vertex, travelling exclusively on the grid lines by going down or to the left. We define the area of a path as the number of squares on the checkerboard that are below this path. Let $p$ be a prime such that $r_{p}(m)+r_{p}(n)\geq{p}$, where $r_{p}(m)$ denotes the remainder when $m$ is divided by $p$ and $r_{p}(n)$ denotes the remainder when $n$ is divided by $p$. How many paths have an area that is a multiple of $p$?

$(NET 4)$ A boy has a set of trains and pieces of railroad track. Each piece is a quarter of circle, and by concatenating these pieces, the boy obtained a closed railway. The railway does not intersect itself. In passing through this railway, the train sometimes goes in the clockwise direction, and sometimes in the opposite direction. Prove that the train passes an even number of times through the pieces in the clockwise direction and an even number of times in the counterclockwise direction. Also, prove that the number of pieces is divisible by $4.$

In a certain college containing $1000$ students, students may choose to major in exactly one of math, computer science, finance, or English. The [i]diversity ratio[/i] $d(s)$ of a student $s$ is the defined as number of students in a different major from $s$ divided by the number of students in the same major as $s$ (including $s$). The [i]diversity[/i] $D$ of the college is the sum of all the diversity ratios $d(s)$. Determine all possible values of $D$.

Two squirrels, Bushy and Jumpy, have collected $2021$ walnuts for the winter. Jumpy numbers the walnuts from 1 through $2021$, and digs $2021$ little holes in a circular pattern in the ground around their favourite tree. The next morning Jumpy notices that Bushy had placed one walnut into each hole, but had paid no attention to the numbering. Unhappy, Jumpy decides to reorder the walnuts, and Bushy decides to interfere with Jumpy. The two take turns to reorder the walnuts. Each time, Bushy chooses $1232$ walnuts and reorders them and then Jumpy chooses $n$ walnuts to reorder. Find the least positive integer $n$ such that whatever Bushy does, Jumpy can ensure that the $i$th hole from the left has the $i$th walnut [i]Ift0501[/i]

$A$ is a compact convex set in plane. Prove that there exists a point $O \in A$, such that for every line $XX'$ passing through $O$, where $X$ and $X'$ are boundary points of $A$, then \[ \frac12 \leq \frac {OX}{OX'} \leq 2.\]

Peter and Basil take turns drawing roads on a plane, Peter starts. The road is either horizontal or a vertical line along which one can drive in only one direction (that direction is determined when the road is drawn). Can Basil always act in such a way that after each of his moves one could drive according to the rules between any two constructed crossroads, regardless of Peter's actions? Alexandr Perepechko

$n$ numbers are written down along the circumference. Their sum equals to zero, and one of them equals $1$. a) Prove that there are two neighbours with their difference not less than $n/4$. b) Prove that there is a number that differs from the arithmetic mean of its two neighbours not less than on $8/(n^2)$. c) Try to improve the previous estimation, i.e what number can be used instead of $8$? d) Prove that for $n=30$ there is a number that differs from the arithmetic mean of its two neighbours not less than on $2/113$, give an example of such $30$ numbers along the circumference, that not a single number differs from the arithmetic mean of its two neighbours more than on $2/113$.

In a sequence of positive integers, a inversion is a pair of positions, where the number in left is greater than the number in right. For example in the sequence $2, 5, 3, 1, 3$ has $5$ inversions{(5,1),(3,1),(5,3),(2,1),(5,3)}. Find the greatest number of inversions in a sequence where the sum of elements is $n$ a) where $n=7$ b) where $n=2019$

In the plane are given 100 lines such that no 2 are parallel and no 3 meet in a point. The intersection points are marked. Then all the lines and k of the marked points are erased. Given the remained points of intersection for what max k one can reconstruct the lines? [i]Proposed by A. Golovanov[/i]

There are $n$ fleas on an infinite sheet of triangulated paper. Initially the fleas are in different small triangles, all of which are inside some equilateral triangle consisting of $n^2$ small triangles. Once a second each flea jumps from its original triangle to one of the three small triangles having a common vertex but no common side with it. For which natural numbers $n$ does there exist an initial configuration such that after a finite number of jumps all the $n$ fleas can meet in a single small triangle?