Found problems: 329
Given points $M$ and $N$, the bases of heights $AM$ and $BN$ of $\vartriangle ABC$ and the line to which the side $AB$ belongs. Construct $\vartriangle ABC$.
On the board was drawn a circle with a marked center, a quadrangle inscribed in it, and a circle inscribed in it, also with a marked center. Then they erased the quadrilateral (keeping one vertex) and the inscribed circle (keeping its center). Restore any of the erased vertices of the quadrilateral using only a ruler and no more than six lines.
Coordinate axes (without any marks, with the same scale) and the graph of a quadratic trinomial $y = x^2 + ax + b$ are drawn in the plane. The numbers $a$ and $b$ are not known. How to draw a unit segment using only ruler and compass?
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 $.
Show that for any positive integer $n > 2$ we can find $n$ distinct positive integers such that the sum of their reciprocals is $1$.
Given two intersecting circles with centers $O_1, O_2$. Construct the circle touching one of them externally and the second one internally such that the distance from its center to $O_1O_2$ is maximal.
(M.Volchkevich)
Prove that among every ten consecutive natural numbers there is one that is coprime to each of the other nine.
Given an isosceles trapezoid $ABCD$ and a point $P$. Prove that a quadrilateral can be constructed from segments $PA, PB, PC, PD$.
Note: It is allowed that the vertices of a quadrilateral lie not only not only on the sides of the trapezoid, but also on their extensions.
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.
Construct the $ \triangle ABC $, with $ AC <BC $, if the circumcircle is known, and the points $ D, E, F $ in it, where they intersect, respectively, the altitude, the median and the angle bisector that they start from the vertex $ C $.
The student drew a triangle $ABC$ on the board, in which $AB>BC$. On the side $AB$ is taken point $D$ such that $BD = AC$. Let points $E$ and $F$ be the midpoints of the segments $AD$ and $BC$ respectively. Then the whole picture was erased, leaving only dots $E$ and $F$. Restore triangle $ABC$.
Justify the following construction of the bisector of an angle with an inaccessible vertex:
[img]https://cdn.artofproblemsolving.com/attachments/9/d/be4f7799d58a28cab3b4c515633b0e021c1502.png[/img]
$M \in a$ and $N \in b$ are taken, the $4$ bisectors of the $4$ internal angles formed by $MN$ are traced with $a$ and $ b$. Said bisectors intersect at $P$ and $Q$, then $PQ$ is the bisector sought.
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)
Let's call a convex figure, the boundary of which consists of two segments and an arc of a circle, a mushroom-gon (see fig.). An arbitrary mushroom-gon is given. Use a compass and straightedge to draw a straight line dividing its area in half.
[img]https://cdn.artofproblemsolving.com/attachments/d/e/e541a83a7bb31ba14b3637f82e6a6d1ea51e22.png[/img]
In an acute triangle $ABC$, altitudes at vertices $A$ and $B$ and bisector line at angle $C$ intersect the circumcircle again at points $A_1, B_1$ and $C_0$. Using the straightedge and compass, reconstruct the triangle by points $A_1, B_1$ and $C_0$.
Given two circles of radii $r$ and $r'$ exterior to each other, construct a line parallel to a given line and intersecting the two circles in chords with the sum of lengths $\ell$.
Let $K, T$ be the points of tangency of inscribed and exscribed circles to the side $BC$ triangle $ABC$, $M$ is the midpoint of the side $BC$. Using a compass and a ruler, construct triangle ABC given rays $AK$ and $AT$ (points $K, T$ are not marked on them) and point $M$.
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.
Given three lines $ a $, $ b $, $ c $ pairwise skew. Is it possible to construct a parallelepiped whose edges lie on the lines $ a $, $ b $, $ c $?
The $1 \times 1$ cells located around the perimeter of a $4 \times 4$ square are filled with the numbers $1,
2, \ldots, 12$ so that the sums along each of the four sides are equal. In the upper left corner cell is the number $1$, in the upper right - the number $5$, and in the lower right - the number $11$.
[img]https://i.ibb.co/PM0ry1D/Kyiv-City-MO-2021-Round-1-10-2.png[/img]
Under these conditions, what number can be located in the last corner cell?
[i]Proposed by Mariia Rozhkova[/i]
Consider points $A, B, C$. Draw a line through $A$ so that the sum of distances from $B$ and $C$ to this line is equal to the length of a given segment.
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?
An infinite sequence $ \,x_{0},x_{1},x_{2},\ldots \,$ of real numbers is said to be [b]bounded[/b] if there is a constant $ \,C\,$ such that $ \, \vert x_{i} \vert \leq C\,$ for every $ \,i\geq 0$. Given any real number $ \,a > 1,\,$ construct a bounded infinite sequence $ x_{0},x_{1},x_{2},\ldots \,$ such that
\[ \vert x_{i} \minus{} x_{j} \vert \vert i \minus{} j \vert^{a}\geq 1
\]
for every pair of distinct nonnegative integers $ i, j$.
Given two non-intersecting chords $AB$ and $CD$ of a circle $k$ and a length $a <CD$. Determine a point $X$ on $k$ with the following property: If lines $XA$ and $XB$ intersect $CD$ at points $P$ and $Q$ respectively, then $PQ = a$. Show how to construct all such points $X$ and prove that the obtained points indeed have the desired property.
An interstellar hotel has $100$ rooms with capacities $101,102,\ldots, 200$ people. These rooms are occupied by $n$ people in total. Now a VIP guest is about to arrive and the owner wants to provide him with a personal room. On that purpose, the owner wants to choose two rooms $A$ and $B$ and move all guests from $A$ to $B$ without exceeding its capacity. Determine the largest $n$ for which the owner can be sure that he can achieve his goal no matter what the initial distribution of the guests is.