What is the largest possible rational root of the equation $ax^2 + bx + c = 0{}$ where $a, b$ and $c{}$ are positive integers that do not exceed $100{}$?

Consider two coprime integers $p{}$ and $q{}$ which are greater than $1{}$ and differ from each other by more than $1{}$. Prove that there exists a positive integer $n{}$ such that \[\text{lcm}(p+n, q+n)<\text{lcm}(p,q).\]

Consider two concentric circles $\Omega$ and $\omega$. Chord $AD$ of the circle $\Omega$ is tangent to $\omega$. Inside the minor disk segment $AD$ of $\Omega$, an arbitrary point $P{}$ is selected. The tangent lines drawn from the point $P{}$ to the circle $\omega$ intersect the major arc $AD$ of the circle $\Omega$ at points $B{}$ and $C{}$. The line segments $BD$ and $AC$ intersect at the point $Q{}$. Prove that the line segment $PQ$ passes through the midpoint of line segment $AD$. Note. A circle together with its interior is called a disk, and a chord $XY$ of the circle divides the disk into disk segments, a minor disk segment $XY$ (the one of smaller area) and a major disk segment $XY$.

In a checkered square, there is a closed door between any two cells adjacent by side. A beetle starts from some cell and travels through cells, passing through doors; she opens a closed door in the direction she is moving and leaves that door open. Through an open door, the beetle can only pass in the direction the door is opened. Prove that if at any moment the beetle wants to return to the starting cell, it is possible for her to do that.

In an infinite arithmetic progression of positive integers there are two integers with the same sum of digits. Will there necessarily be one more integer in the progression with the same sum of digits? Proposed by A. Shapovalov

It is known that among several banknotes of pairwise distinct face values (which are positive integers) there are exactly $N{}$ fakes. In a single test, a detector determines the sum of the face values of all real banknotes in an arbitrary set we have selected. Prove that by using the detector $N{}$ times, all fake banknotes can be identified, if a) $N=2$ and b) $N=3$. Proposed by S. Tokarev

There are $N{}$ friends and a round pizza. It is allowed to make no more than $100{}$ straight cuts without shifting the slices until all cuts are done; then the resulting slices are distributed among all the friends so that each of them gets a share off pizza having the same total area. Is there a cutting which gives the above result if a) $N=201$ and b) $N=400$?

One hundred friends, including Alice and Bob, live in several cities. Alice has determined the distance from her city to the city of each of the other 99 friends and totaled these 99 numbers. Alice’s total is 1000 km. Bob similarly totaled his distances to everyone else. What is the largest total that Bob could have obtained? (Consider the cities as points on the plane; if two people live in the same city, the distance between their cities is considered zero).

The numbers $1, 19, 199, 1999,\ldots$ are written on several cards, one card for each number. Is it possible to choose at least three cards so that the sum of the numbers on the chosen cards equals a number in which all digits, except for a single digit, are twos? Suppose you have chosen several cards so that the sum of the numbers on the chosen cards equals a number, all of whose digits are twos, except for a single digit. What can this single different digit be?

Baron Munchausen claims that he has drawn a polygon and chosen a point inside the polygon in such a way that any line passing through the chosen point divides the polygon into three polygons. Could the Baron’s claim be correct?

Let $n>1$ be an integer. A rook stands in one of the cells of an infinite chessboard that is initially all white. Each move of the rook is exactly $n{}$ cells in a single direction, either vertically or horizontally, and causes the $n{}$ cells passed over by the rook to be painted black. After several such moves, without visiting any cell twice, the rook returns to its starting cell, with the resulting black cells forming a closed path. Prove that the number of white cells inside the black path gives a remainder of $1{}$ when divided by $n{}$.

On the sides of a regular nonagon $ABCDEFGHI$, triangles $XAB, YBC, ZCD$ and $TDE$ are constructed outside the nonagon. The angles at $X, Y, Z, T$ in these triangles are each $20^\circ$. The angles $XAB, YBC, ZCD$ and $TDE$ are such that (except for the first angle) each angle is $20^\circ$ greater than the one listed before it. Prove that the points $X, Y , Z, T$ lie on the same circle.

Peter added a positive integer $M{}$ to a positive integer $N{}$ and noticed that the sum of the digits of the resulting integer is the same as the sum of the digits of $N{}$. Then he added $M{}$ to the result again, and so on. Will Peter eventually get a number with the same digit sum as the number $N{}$ again?

Find the maximum integer $m$ such that $m! \cdot 2022!$ is a factorial of an integer.

A big circle is inscribed in a rhombus, each of two smaller circles touches two sides of the rhombus and the big circle as shown in the figure on the right. Prove that the four dashed lines spanning the points where the circles touch the rhombus as shown in the figure make up a square.

There are 2022 marked points on a straight line so that every two adjacent points are the same distance apart. Half of all the points are coloured red and the other half are coloured blue. Can the sum of the lengths of all the segments with a red left endpoint and a blue right endpoint be equal to the sum of the lengths of all the segments with a blue left endpoint and a red right endpoint?

Consider an acute non-isosceles triangle. In a single step it is allowed to cut any one of the available triangles into two triangles along its median. Is it possible that after a finite number of cuttings all triangles will be isosceles? Proposed by E. Bakaev

A $2N\times2N$ board is covered by non-overlapping dominos of $1\times2$ size. A lame rook (which can only move one cell at a time, horizontally or vertically) has visited each cell once on its route across the board. Call a move by the rook longitudinal if it is a move from one cell of a domino to another cell of the same domino. What is: the maximum possible number of longitudinal moves? the minimum possible number of longitudinal moves?

Is it possible to arrange $36$ distinct numbers in the cells of a $6 \times 6$ table, so that in each $1\times 5$ rectangle (both vertical and horizontal) the sum of the numbers equals $2022$ or $2023$?

Does there exist a natural number that can be represented as the product of two numeric palindromes in more than $100{}$ ways?

A pentagon $ABCDE$ is circumscribed about a circle. The angles at the vertices $A{}$, $C{}$ and $E{}$ of the pentagon are equal to $100^\circ$. Find the measure of the angle $\angle ACE$.

Is it possible to colour all integers greater than $1{}$ in three colours (each integer in one colour, all three colours must be used) so that the colour of the product of any two differently coloured numbers is different from the colour of each of the factors?

Alice has 8 coins. She knows for sure only that 7 of these coins are genuine and weigh the same, while the remaining one is counterfeit and is either heavier or lighter than any of the other 7. Bob has a balance scale. The scale shows which plate is heavier but does not show by how much. For each measurement, Alice pays Bob beforehand a fee of one coin. If a genuine coin has been paid, Bob tells Alice the correct weighing outcome, but if a counterfeit coin has been paid, he gives a random answer. Alice wants to identify 5 genuine coins and not to give any of these coins to Bob. Can Alice achieve this result for sure?

There are two letter sequences $A$ and $B$, both with length $100$ letters. In one move you can insert in any place of sequence ( possibly to start or to end) any number of same letters or remove any number of consecutive same letters. Prove that it is possible to make second sequence from first sequence using not more than $100$ moves.

Perimeter of triangle $ABC$ is $1$. Circle $\omega$ touches side $BC$, continuation of side $AB$ at $P$ and continuation of side $AC$ in $Q$. Line through midpoints $AB$ and $AC$ intersects circumcircle of $APQ$ at $X$ and $Y$. Find length of $XY$.

$P(x)$ is polynomial with degree $n>5$ and integer coefficients have $n$ different integer roots. Prove that $P(x)+3$ have $n$ different real roots.

A regular $100$-gon was cut into several parallelograms and two triangles. Prove that these triangles are congruent.

Given an integer $h > 1$. Let's call a positive common fraction (not necessarily irreducible) good if the sum of its numerator and denominator is equal to $h$. Let's say that a number $h$ is remarkable if every positive common fraction whose denominator is less than $h$ can be expressed in terms of good fractions (not necessarily various) using the operations of addition and subtraction. Prove that $h$ is remarkable if and only if it is prime. (Recall that an common fraction has an integer numerator and a natural denominator.)

The midpoints of all heights of a certain tetrahedron lie on its inscribed sphere. Is this tetrahedron necessarily regular then?

Chameleons of five colors live on the island. When one chameleon bites another, the color of bitten chameleon changes to one of these five colors according to some rule, and the new color depends only on the color of the bitten and the color of the bitting. It is known that $2023$ red chameleons can agree on a sequence of bites between themselves, after which they will all turn blue. What is the smallest $k$ that can guarantee that $k$ red chameleons, biting only each other, can turn blue? (For example, the rules might be: if a red chameleon bites a green one, the bitten one changes color to blue; if a green one bites a red one, the bitten one remains red, that is, "changes color to red"; if red bites red, the bitten one changes color to yellow, etc. The rules for changing colors may be different.)

A right-angled triangle has an angle equal to $30^\circ.$ Prove that one of the bisectors of the triangle is twice as short as another one. Egor Bakaev

There is a bacterium in one of the cells of a $10 \times 10{}$ checkered board. At the first move, the bacterium shifts to a cell adjacent by side to the original one, and divides into two bacteria (both stay in the same cell). Then again, one of the bacteria on the board shifts to a cell adjacent by side and divides into two bacteria, and so on. Is it possible that after some number of such moves the number of bacteria in each cell of the board is the same? Alexandr Gribalko

Let us call a positive integer pedestrian if all its decimal digits are equal to 0 or 1. Suppose that the product of some two pedestrian integers also is pedestrian. Is it necessary in this case that the sum of digits of the product equals the product of the sums of digits of the factors? Viktor Kleptsyn, Konstantin Knop

The triangles $AB'C, CA'B$ and $BC'A$ are constructed on the sides of the equilateral triangle $ABC.$ In the resulting hexagon $AB'CA'BC'$ each of the angles $\angle A'BC',\angle C'AB'$ and $\angle B'CA'$ is greater than $120^\circ$ and the sides satisfy the equalities $AB' = AC',BC' = BA'$ and $CA' = CB'.$ Prove that the segments $AB',BC'$ and $CA'$ can form a triangle. David Brodsky

The positive integers from 1 to 100 are painted into three colors: 50 integers are red, 25 integers are yellow and 25 integers are green. The red and yellow integers can be divided into 25 triples such that each triple includes two red integers and one yellow integer which is greater than one of the red integers and smaller than another one. The same assertion is valid for the red and green integers. Is it necessarily possible to divide all the 100 integers into 25 quadruples so that each quadruple includes two red integers, one yellow integer and one green integer such that the yellow and the green integer lie between the red ones? Alexandr Gribalko

Let $X{}$ be a set of integers which can be partitioned into $N{}$ disjoint increasing arithmetic progressions (infinite in both directions), and cannot be partitioned into a smaller number of such progressions. Is such partition into $N{}$ progressions unique for every such $X{}$ if a) $N = 2{}$ and b) $N = 3$? Viktor Kleptsyn

There are 2023 dice on the table. For 1 dollar, one can pick any dice and put it back on any of its four (other than top or bottom) side faces. How many dollars at a minimum will guarantee that all the dice have been repositioned to show equal number of dots on top faces? Egor Bakaev

А positive integer $n{}$ is given. For every $x{}$ consider the sum \[Q(x)=\sum_{k=1}^{10^n}\left\lfloor\frac{x}{k}\right\rfloor.\]Find the difference $Q(10^n)-Q(10^n-1)$. Alexey Tolpygo

Let $I{}$ be the incenter of triangle $ABC{}.$ Let $N{}$ be the foot of the bisector of angle $B{}.$ The tangent line to the circumcircle of triangle $AIN$ at $A{}$ and the tangent line to the circumcircle of triangle $CIN{}$ at $C{}$ intersect at $D{}.$ Prove that lines $AC{}$ and $DI$ are perpendicular. Mikhail Evdokimov

Let $a_1, a_2, a_3,\ldots$ and $b_1, b_2, b_3,\ldots$ be infinite increasing arithmetic progressions. Their terms are positive numbers. It is known that the ratio $a_k/b_k$ is an integer for all k. Is it true that this ratio does not depend on $k{}$? Boris Frenkin

The distance between any two of five given points exceeds 2. Is it true that the distance between some two of these points exceeds 3 if these five points are in a) the plane; and b) three-dimensional space? Alexey Tolpygo

There are $N{}$ mess-loving clerks in the office. Each of them has some rubbish on the desk. The mess-loving clerks leave the office for lunch one at a time (after return of the preceding one). At that moment all those remaining put half of rubbish from their desks on the desk of the one who left. Can it so happen that after all of them have had lunch the amount of rubbish at the desk of each one will be the same as before lunch if a) $N = 2{}$ and b) $N = 10$? Alexey Zaslavsky

Medians $BK{}$ and $CN{}$ of triangle $ABC$ intersect at $M{}.$ Consider quadrilateral $ANMK$ and find the maximum possible number of its sides having length 1. Egor Bakaev

There is a single coin on each square of a $5 \times 5$ board. All the coins look the same. Two of them are fakes and have equal weight. Genuine coins are heavier than fake ones and also weigh the same. The fake coins are on the squares sharing just one vertice. Is it possible to determine for sure a) 13 genuine coins; b) 15 genuine coins; and c) 17 genuine coins in a single weighing on a balance with no unit weights? Rustem Zhenodarov, Alexandr Gribalko, Sergey Tokarev