We are given a triangle $ABC$ such that $\angle BAC < 90^{\circ}$. The point $D$ is on the opposite side of the line $AB$ to $C$ such that $|AD| = |BD|$ and $\angle ADB = 90^{\circ}$. Similarly, the point $E$ is on the opposite side of $AC$ to $B$ such that $|AE| = |CE|$ and $\angle AEC = 90^{\circ}$. The point $X$ is such that $ADXE$ is a parallelogram. Prove that $|BX| = |CX|$.

Let $ABCD$ be a cyclic quadrilateral. Assume that the points $Q, A, B, P$ are collinear in this order, in such a way that the line $AC$ is tangent to the circle $ADQ$, and the line $BD$ is tangent to the circle $BCP$. Let $M$ and $N$ be the midpoints of segments $BC$ and $AD$, respectively. Prove that the following three lines are concurrent: line $CD$, the tangent of circle $ANQ$ at point $A$, and the tangent to circle $BMP$ at point $B$.

A set $X=\{ x_1,x_2,\ldots,x_n \}$ consisting of $n$ positive integers is given. It is known that the greatest common divisor of any four different elements of $X$ is $1$. For every number $x_i$ let $m_i$ be the number of elements of $X$, which are divisible by $x_i$ For every $n \geq 4$, find the maximal possible value of the sum $m_1+\ldots+m_n$ [i]A. Vaidzelevich[/i]

Let $K$ be an arbitrary point on side $BC$ of triangle $ABC$, and $KN$ be a bisector of triangle $AKC$. Lines $BN$ and $AK$ meet at point $F$, and lines $CF$ and $AB$ meet at point $D$. Prove that $KD$ is a bisector of triangle $AKB$.

Let $N$ be the number of ways to draw 22 straight edges between 10 labeled points, of which no three are collinear, such that no triangle with vertices among these 10 points is created, and there is at most one edge between any two labeled points. Compute $\dfrac{N}{9!}$.

Triangle $A_1 A_2 A_3$ has a right angle at $A_3$. A sequence of points is now defined by the following iterative process, where $n$ is a positive integer. From $A_n$ ($n \geq 3$), a perpendicular line is drawn to meet $A_{n-2}A_{n-1}$ at $A_{n+1}$. (a) Prove that if this process is continued indefinitely, then one and only one point $P$ is interior to every triangle $A_{n-2} A_{n-1} A_{n}$, $n \geq 3$. (b) Let $A_1$ and $A_3$ be fixed points. By considering all possible locations of $A_2$ on the plane, find the locus of $P$.

Prove that for any positive real number $\alpha$, the number $\lfloor\alpha n^2\rfloor$ is even for infinitely many positive integers $n$.

Let $a_0, a_1, a_2, \ldots$ be an arbitrary infinite sequence of positive numbers. Show that the inequality $1 + a_n > a_{n-1} \sqrt[n]{2}$ holds for infinitely many positive integers $n$.

A pile of $2000$ coins is given on a table. In each step, we choose a pile with at least three coins, remove one coin from it, and divide the rest of this pile into two piles (not necessarily of the same size). Is it possible that after several steps each pile on the table has exactly three coins?

On circle in clockwise order are written positive integers from $1$ to $2010$. Let us cross out number $1$, then number $10$, then number $19$, and so on every $9$th number in that direction. Which number will be first crossed out twice? How many numbers at that moment are not crossed out?

A graph is called 2-connected if after removing any vertex the remaining graph is still connected. Prove that for any 2-connected graph with degrees more than two, one can remove a vertex so that the remaining graph is still 2-connected.

Find all solutions for positive integers $(x,y,k,m)$ such that \[ 20x^k+24y^m = 2024\] with $k, m > 1$

Let $p, q$ and $r$ be positive real numbers such that the equation $$\lfloor pn \rfloor + \lfloor qn \rfloor + \lfloor rn \rfloor = n$$ is satisfied for infinitely many positive integers $n{}$. (a) Prove that $p, q$ and $r$ are rational. (b) Determine the number of positive integers $c$ such that there exist positive integers $a$ and $b$, for which the equation $$\left \lfloor \frac{n}{a} \right \rfloor+\left \lfloor \frac{n}{b} \right \rfloor+\left \lfloor \frac{cn}{202} \right \rfloor=n$$ is satisfied for infinitely many positive integers $n{}$.

Let $ABCDEF$ be a convex hexagon, such that the triangles $ABC$ and $DEF$ are equilateral and the diagonals $AD, BE$ and $CF$ are concurrent. Prove that $AC\parallel DF$ or $BE=AD+CF.$

Let $n$ be a positive integer. $S$ is the set of nonnegative integers $a$ such that $1<a<n$ and $a^{a-1}-1$ is divisible by $n$. Prove that if $S=\{ n-1 \}$ then $n=2p$ where $p$ is a prime number. [i]Mihai Cipu and Nicolae Ciprian Bonciocat[/i]

When a positive integer $N$ is fed into a machine, the output is a number calculated according to the rule shown below. [asy] size(300); defaultpen(linewidth(0.8)+fontsize(13)); real r = 0.05; draw((0.9,0)--(3.5,0),EndArrow(size=7)); filldraw((4,2.5)--(7,2.5)--(7,-2.5)--(4,-2.5)--cycle,gray(0.65)); fill(circle((5.5,1.25),0.8),white); fill(circle((5.5,1.25),0.5),gray(0.65)); fill((4.3,-r)--(6.7,-r)--(6.7,-1-r)--(4.3,-1-r)--cycle,white); fill((4.3,-1.25+r)--(6.7,-1.25+r)--(6.7,-2.25+r)--(4.3,-2.25+r)--cycle,white); fill((4.6,-0.25-r)--(6.4,-0.25-r)--(6.4,-0.75-r)--(4.6,-0.75-r)--cycle,gray(0.65)); fill((4.6,-1.5+r)--(6.4,-1.5+r)--(6.4,-2+r)--(4.6,-2+r)--cycle,gray(0.65)); label("$N$",(0.45,0)); draw((7.5,1.25)--(11.25,1.25),EndArrow(size=7)); draw((7.5,-1.25)--(11.25,-1.25),EndArrow(size=7)); label("if $N$ is even",(9.25,1.25),N); label("if $N$ is odd",(9.25,-1.25),N); label("$\frac N2$",(12,1.25)); label("$3N+1$",(12.6,-1.25)); [/asy] For example, starting with an input of $N = 7$, the machine will output $3 \cdot 7 + 1 = 22$. Then if the output is repeatedly inserted into the machine five more times, the final output is $26$. $$ 7 \to 22 \to 11 \to 34 \to 17 \to 52 \to 26$$ When the same 6-step process is applied to a different starting value of $N$, the final output is $1$. What is the sum of all such integers $N$? $$ N \to \_\_ \to \_\_ \to \_\_ \to \_\_ \to \_\_ \to 1$$ $\textbf{(A)}\ 73 \qquad \textbf{(B)}\ 74 \qquad \textbf{(C)}\ 75 \qquad \textbf{(D)}\ 82 \qquad \textbf{(E)}\ 83$

$(MON 5)$ Find the radius of the circle circumscribed about the isosceles triangle whose sides are the solutions of the equation $x^2 - ax + b = 0$.

Let $XY$ be a chord of a circle $\Omega$, with center $O$, which is not a diameter. Let $P, Q$ be two distinct points inside the segment $XY$, where $Q$ lies between $P$ and $X$. Let $\ell$ the perpendicular line drawn from $P$ to the diameter which passes through $Q$. Let $M$ be the intersection point of $\ell$ and $\Omega$, which is closer to $P$. Prove that $$ MP \cdot XY \ge 2 \cdot QX \cdot PY$$

Prove that if $ \alpha$ and $ \beta$ are positive irrational numbers satisfying $ \frac{1}{\alpha}\plus{}\frac{1}{\beta}\equal{} 1$, then the sequences \[ \lfloor\alpha\rfloor,\lfloor 2\alpha\rfloor,\lfloor 3\alpha\rfloor,\cdots\] and \[ \lfloor\beta\rfloor,\lfloor 2\beta\rfloor,\lfloor 3\beta\rfloor,\cdots\] together include every positive integer exactly once.

Find all the integer solutions of the equation $ m^4 + 2n^2 = 9mn$.

Let $m$ and $n$ be positive integers with $m\geq n$. There are $m$ cupcakes of different flavors arranged around a circle and $n$ people who like cupcakes. Each person assigns a nonnegative real number score to each cupcake, depending on how much they like the cupcake. Suppose that for each person $P$, it is possible to partition the circle of $m$ cupcakes into $n$ groups of consecutive cupcakes so that the sum of $P$'s scores of the cupcakes in each group is at least $1$. Prove that it is possible to distribute the $m$ cupcakes to the $n$ people so that each person $P$ receives cupcakes of total score at least $1$ with respect to $P$.

An aqueous solution is known to contain $\text{Ag}^+, \text{Mg}^{2+},$ and $\text{Sr}^{2+}$ ions. Which reagent should be used to selectively precipitate the $\text{Ag}^+$? ${ \textbf{(A)}\ 0.20 \text{M NaCl} \qquad\textbf{(B)}\ 0.20 \text{M NaOH} \qquad\textbf{(C)}\ 0.20 \text{M Na}_2\text{SO}_4 \qquad\textbf{(D)}\ 0.20 \text{M Na}_3\text{PO}_4 }$

Does there exist a function $s\colon \mathbb{Q} \rightarrow \{-1,1\}$ such that if $x$ and $y$ are distinct rational numbers satisfying ${xy=1}$ or ${x+y\in \{0,1\}}$, then ${s(x)s(y)=-1}$? Justify your answer. [i]Proposed by Dan Brown, Canada[/i]

Define for positive integer $n$, a function $f_n(x)=\frac{\ln x}{x^n}\ (x>0).$ In the coordinate plane, denote by $S_n$ the area of the figure enclosed by $y=f_n(x)\ (x\leq t)$, the $x$-axis and the line $x=t$ and denote by $T_n$ the area of the rectagle with four vertices $(1,\ 0),\ (t,\ 0),\ (t,\ f_n(t))$ and $(1,\ f_n(t))$. (1) Find the local maximum $f_n(x)$. (2) When $t$ moves in the range of $t>1$, find the value of $t$ for which $T_n(t)-S_n(t)$ is maximized. (3) Find $S_1(t)$ and $S_n(t)\ (n\geq 2)$. (4) For each $n\geq 2$, prove that there exists the only $t>1$ such that $T_n(t)=S_n(t)$. Note that you may use $\lim_{x\to\infty} \frac{\ln x}{x}=0.$

Is it true that for any positive integer $n>1$, there exists an infinite arithmetic progression $M_n$ of positive integers, such that for any $m \in M_n$, the number $n^m-1$ is not a perfect power (a positive integer is a perfect power if it is of the form $a^b$ for positive integers $a, b>1$)?