Let \( I \) and \( M \) be the incenter and the centroid of a scalene triangle \( ABC \), respectively. A line passing through point \( I \) parallel to \( BC \) intersects \( AC \) and \( AB \) at points \( E \) and \( F \), respectively. Reconstruct triangle \( ABC \) given only the marked points \( E, F, I, \) and \( M \). [i]Proposed by Hryhorii Filippovskyi[/i]

The triangle $ABC$ is inscribed in the circle. Construct a point $P$ such that the points of intersection of lines $AP, BP$ and $CP$ with this circle are the vertices of an equilateral triangle. (A. Zaslavsky)

Let $d(n)$ denote the number of divisors of a positive integer $n$. If $k$ is a given odd number, prove that there exist an increasing arithmetic progression in positive integers $(a_1,a_2,\ldots a_{2019}) $ such that $gcd(k,d(a_1)d(a_2)\ldots d(a_{2019})) =1$

Construct an equilateral trapezoid given the height and the midline, if it is known that the midline is divided by diagonals into three equal parts. (Grigory Filippovsky)

Does the equation $$z(y-x)(x+y)=x^3$$ have finitely many solutions in the set of positive integers? [i]Proposed by Nikola Velov[/i]

In a plane there are four fixed points $A, B, C, D$, no $3$ collinear. Construct a square with sides $a, b, c, d$ such that $A \in a$, $B \in b$, $C \in c$, $D \in d$.

On the horizontal line from left to right are the points $P, \, \, Q, \, \, R, \, \, S$. Construct a square $ABCD$, for which on the line $AD$ lies lies the point $P$, on the line $BC$ lies the point $Q$, on the line $AB$ lies the point $R$, on the line $CD$ lies the point $S $.

The triangle $ABC$ is drawn on the board such that $AB + AC = 2BC$. The bisectors $AL_1, BL_2, CL_3$ were drawn in this triangle, after which everything except the points $L_1, L_2, L_3$ was erased. Use a compass and a ruler to reconstruct triangle $ABC$.

Given three lines $ a $, $ b $, $ c $ pairwise skew. Is it possible to construct a parallelepiped whose edges lie on the lines $ a $, $ b $, $ c $?

Given an acute angle and a circle inside the angle. Find a point $ M $ on the circle such that the sum of the distances of the point $ M $ from the sides of the angle is a minimum.

Let $n$ be a fixed positive integer and fix a point $O$ in the plane. There are $n$ lines drawn passing through the point $O$. Determine the largest $k$ (depending on $n$) such that we can always color $k$ of the $n$ lines red in such a way that no two red lines are perpendicular to each other. [i]Proposed by Nikola Velov[/i]

Construct triangle $ABC$, given $h_a$, $h_b$ (the altitudes from $A$ and $B$), and $m_a$, the median from vertex $A$.

Circle $\omega$ is inscribed in the $\vartriangle ABC$, with center $I$. Using only a ruler, divide segment $AI$ in half. (Grigory Filippovsky)

An arbitrary triangle $ABC$ is given. Construct a line that divides it into two polygons, which have equal radii of the circumscribed circles. (L. Blinkov)

Construct a quadrilateral with three sides $1$, $4$ and $3$ so that a circle could be circumscribed around it.

Given a segment $ AB $ and a line $ m $ parallel to this segment. Find the midpoint of the segment $ AB $ using only a ruler, i.e. drawing only straight lines.

Let $m, n \ge 2$ be integers. Carl is given $n$ marked points in the plane and wishes to mark their centroid.* He has no standard compass or straightedge. Instead, he has a device which, given marked points $A$ and $B$, marks the $m-1$ points that divide segment $\overline{AB}$ into $m$ congruent parts (but does not draw the segment). For which pairs $(m,n)$ can Carl necessarily accomplish his task, regardless of which $n$ points he is given? *Here, the [i]centroid[/i] of $n$ points with coordinates $(x_1, y_1), \dots, (x_n, y_n)$ is the point with coordinates $\left( \frac{x_1 + \dots + x_n}{n}, \frac{y_1 + \dots + y_n}{n}\right)$. [i]Proposed by Holden Mui and Carl Schildkraut[/i]

Let $m, n \ge 2$ be integers. Carl is given $n$ marked points in the plane and wishes to mark their centroid.* He has no standard compass or straightedge. Instead, he has a device which, given marked points $A$ and $B$, marks the $m-1$ points that divide segment $\overline{AB}$ into $m$ congruent parts (but does not draw the segment). For which pairs $(m,n)$ can Carl necessarily accomplish his task, regardless of which $n$ points he is given? *Here, the [i]centroid[/i] of $n$ points with coordinates $(x_1, y_1), \dots, (x_n, y_n)$ is the point with coordinates $\left( \frac{x_1 + \dots + x_n}{n}, \frac{y_1 + \dots + y_n}{n}\right)$. [i]Proposed by Holden Mui and Carl Schildkraut[/i]

A circle is circumscribed around an isosceles triangle $ABC$ with base $BC$. The bisector of the angle $C$ and the bisector of the angles $A$ intersect the circle at the points $E$ and $D$, respectively, and the segment $DE$ intersects the sides $BC$ and $AB$ at the points $P$ and $Q$, respectively. Reconstruct $\vartriangle ABC$ given points $D, P, Q$, if it is known in which half-plane relative to the line $DQ$ lies the vertex $A$. (Maria Rozhkova)

Two different points $A, M$ are given in a plane, $AM = d > 0$. Let a number $v > 0$ be given. Construct a rhombus $ABCD$ with the height of length $v$ and $M$ being a midpoint of $BC$. Discuss conditions of solvability and determine number of solutions. Can the resulting quadrilateral $ABCD$ be a square?

Let $b \geqslant 2$ be a positive integer. Anu has an infinite collection of notes with exactly $b-1$ copies of a note worth $b^k-1$ rupees, for every integer $k\geqslant 1$. A positive integer $n$ is called payable if Anu can pay exactly $n^2+1$ rupees by using some collection of her notes. Prove that if there is a payable number, there are infinitely many payable numbers. [i]Proposed by Shantanu Nene[/i]

Given a circle and two points $P$ and $Q$, construct a right triangle inscribed in the circle such that its two legs pass through the points $P$ and $Q$ respectively. For what positions of $P$ and $Q$ is this construction impossible?

Prove that infinitely many positive integers can be represented as $(a-1)/b + (b-1)/c + (c-1)/a$, where $a$, $b$ and $c$ are pairwise distinct positive integers greater than 1.

Given a circle $k$ and two points $A$ and $B$ outside the circle. Specify how to can construct a circle with a compass and ruler, so that $A$ and $B$ lie on that circle and that circle is tangent to $k$.

Let $r>1$ be a rational number. Alice plays a solitaire game on a number line. Initially there is a red bead at $0$ and a blue bead at $1$. In a move, Alice chooses one of the beads and an integer $k \in \mathbb{Z}$. If the chosen bead is at $x$, and the other bead is at $y$, then the bead at $x$ is moved to the point $x'$ satisfying $x'-y=r^k(x-y)$. Find all $r$ for which Alice can move the red bead to $1$ in at most $2021$ moves.