The tangents at $B$ and $C$ to the circumcircle of the acute-angled triangle $ABC$ meet at $X$. Let $M$ be the midpoint of $BC$. Prove that [i](a)[/i] $\angle BAM = \angle CAX$, and [i](b)[/i] $\frac{AM}{AX} = \cos\angle BAC.$

An angle is given in a plane. Using only a compass, one must find out $(a)$ if this angle is acute. Find the minimal number of circles one must draw to be sure. $(b)$ if this angle equals $31^{\circ}$.(One may draw as many circles as one needs).

Let $ABCD$ be a convex quadrilateral with pairwise distinct side lengths such that $AC\perp BD$. Let $O_1,O_2$ be the circumcenters of $\Delta ABD, \Delta CBD$, respectively. Show that $AO_2, CO_1$, the Euler line of $\Delta ABC$ and the Euler line of $\Delta ADC$ are concurrent. (Remark: The [i]Euler line[/i] of a triangle is the line on which its circumcenter, centroid, and orthocenter lie.) [i]Proposed by usjl[/i]

In Lineland there are $n\geq1$ towns, arranged along a road running from left to right. Each town has a [i]left bulldozer[/i] (put to the left of the town and facing left) and a [i]right bulldozer[/i] (put to the right of the town and facing right). The sizes of the $2n$ bulldozers are distinct. Every time when a left and right bulldozer confront each other, the larger bulldozer pushes the smaller one off the road. On the other hand, bulldozers are quite unprotected at their rears; so, if a bulldozer reaches the rear-end of another one, the first one pushes the second one off the road, regardless of their sizes. Let $A$ and $B$ be two towns, with $B$ to the right of $A$. We say that town $A$ can [i]sweep[/i] town $B$ [i]away[/i] if the right bulldozer of $A$ can move over to $B$ pushing off all bulldozers it meets. Similarly town $B$ can sweep town $A$ away if the left bulldozer of $B$ can move over to $A$ pushing off all bulldozers of all towns on its way. Prove that there is exactly one town that cannot be swept away by any other one.

Two fair six-sided dice are rolled. The probability that the positive difference between the two rolls is at least $4$ can be written in simplest form as $\frac{m}{n}$. Compute $m + n$.

The Abba tribe language alphabet contains two letters only. Not a word of this language is a beginning of another word. Can this tribe vocabulary contain $3$ four-letter, $10$ five-letter, $30$ six-letter and $5$ seven-letter words?

Find the $2019$th strictly positive integer $n$ such that $\binom{2n}{n}$ is not divisible by $5$.

A triangle with sides $a$, $b$, and $c$ is given. Denote by $s$ the semiperimeter, that is $s = \frac{a + b + c}{2}$. Construct a triangle with sides $s - a$, $s - b$, and $s - c$. This process is repeated until a triangle can no longer be constructed with the side lengths given. For which original triangles can this process be repeated indefinitely?

Bob starts with an empty whiteboard. He then repeatedly chooses one of the digits $1, 2, \ldots, 9$ (uniformly at random) and appends it to the end of the currently written number. Bob stops when the number on the board is a multiple of $25$. Let $E$ be the expected number of digits that Bob writes. If $E = \frac{m}{n}$ for relatively prime positive integers $m$ and $n$, find $100m+n$. [i]Proposed by Amogh Gaitonde[/i]

Let $p$ be a prime, and let $a_1, a_2, a_3, . . .$ be a sequence of positive integers so that $a_na_{n+2} = a^2_{n+1} + p$ for all positive integers $n$. Show that $a_{n+1}$ divides $a_n + a_{n+2}$ for all positive integers $n$.

Let be a natural number $ n\ge 3 $ and a number $ \alpha $ from the interval $ (0,1). $ Find all $ \text{n-tuples} $ of real numbers $ \left( x_0,x_1,x_2,\ldots, x_{n-1} \right) $ such that $ x_0=x_n,x_1=x_{n+1} $ and $$ x_{k+1}\le \left( 1-\alpha \right) x_k+\alpha x_{k-1}, $$ for all $ k $ in the set $ \{ 1,2,\ldots n \} . $ [i]Vasile Pop[/i]

Prove that the product of two natural numbers with their sum cannot be the third power of a natural number.

Find all rational numbers $a$,for which there exist infinitely many positive rational numbers $q$ such that the equation $[x^a].{x^a}=q$ has no solution in rational numbers.(A.Vasiliev)

Let $A,B,C$ be three points in that order on a line $\ell$ in the plane, and suppose $AB>BC$. Draw semicircles $\Gamma_1$ and $\Gamma_2$ respectively with $AB$ and $BC$ as diameters, both on the same side of $\ell$. Let the common tangent to $\Gamma_1$ and $\Gamma_2$ touch them respectively at $P$ and $Q$, $P\ne Q$. Let $D$ and $E$ be points on the segment $PQ$ such that the semicircle $\Gamma_3$ with $DE$ as diameter touches $\Gamma_2$ in $S$ and $\Gamma_1$ in $T$. [list=1][*]Prove that $A,C,S,T$ are concyclic. [*]Prove that $A,C,D,E$ are concyclic.[/list]

The two circles ${{w} _ {1}}, \, \, {{w} _ {2}}$ touch externally at the point $Q$. The common external tangent of these circles is tangent to ${{w} _ {1}}$ at the point $B$, $BA$ is the diameter of this circle. A tangent to the circle ${{w} _ {2}} $ is drawn through the point $A$, which touches this circle at the point $C$, such that the points $B$ and $C$ lie in one half-plane relative to the line $AQ$. Prove that the circle ${{w} _ {1}}$ bisects the segment $C $. (Igor Nagel)

Let be a natural number $ n\ge 2 $ and $ n $ positive real numbers $ a_1,a_n,\ldots ,a_n $ that satisfy the inequalities $$ \sum_{j=1}^i a_j\le a_{i+1} ,\quad \forall i\in\{ 1,2,\ldots ,n-1 \} . $$ Prove that $$ \sum_{k=1}^{n-1} \frac{a_k}{a_{k+1}}\le n/2 . $$

Determine the number of solutions of the simultaneous equations $ x^2 \plus{} y^3 \equal{} 29$ and $ \log_3 x \cdot \log_2 y \equal{} 1.$

For a nonnegative integer $n$, let $s(n)$ be the sum of the digits of the binary representation of $n$. Prove that $$\sum_{n=1}^{2^{2022}-1} \frac{(-1)^{s(n)}}{n+2022}>0.$$

Let $n$ be a positive integer and $\mathcal S$ be the set of points $(x, y)$ with $x, y \in \{1, 2, \ldots , n\}$. Let $\mathcal T$ be the set of all squares with vertices in the set $\mathcal S$. We denote by $a_k$ ($k \geq 0$) the number of (unordered) pairs of points for which there are exactly $k$ squares in $\mathcal T$ having these two points as vertices. Prove that $a_0 = a_2 + 2a_3$. [i]Yugoslavia[/i]

[b]p1.[/b] Find the last digit of $2022^{2022}$. [b]p2.[/b] Let $a_1 < a_2 <... < a_8$ be eight real numbers in an increasing arithmetic progression. If $a_1 + a_3 + a_5 + a_7 = 39$ and $a_2 + a_4 + a_6 + a_8 = 40$, determine the value of $a_1$. [b]p3.[/b] Patrick tries to evaluate the sum of the first $2022$ positive integers, but accidentally omits one of the numbers, $N$, while adding all of them manually, and incorrectly arrives at a multiple of $1000$. If adds correctly otherwise, find the sum of all possible values of $N$. [b]p4.[/b] A machine picks a real number uniformly at random from $[0, 2022]$. Andrew randomly chooses a real number from $[2020, 2022]$. The probability that Andrew’s number is less than the machine’s number is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Find $m + n$. [b]p5.[/b] Let $ABCD$ be a square and $P$ be a point inside it such that the distances from $P$ to sides $AB$ and $AD$ respectively are $2$ and $4$, while $PC = 6$. If the side length of the square can be expressed in the form $a +\sqrt{b}$ for positive integers $a, b$, then determine $a + b$. [b]p6.[/b] Positive integers $a_1, a_2, ..., a_{20}$ sum to $57$. Given that $M$ is the minimum possible value of the quantity $a_1!a_2!...a_{20}!$, find the number of positive integer divisors of $M$. [b]p7.[/b] Jessica has $16$ balls in a box, where $15$ of them are red and one is blue. Jessica draws balls out the box three at a time until one of the three is blue. If she ever draws three red marbles, she discards one of them and shuffles the remaining two back into the box. The expected number of draws it takes for Jessica to draw the blue ball can be written as a common fraction $\frac{m}{n}$ where $m, n$ are relatively prime positive integers. Find $m + n$. [b]p8.[/b] The Lucas sequence is defined by these conditions: $L_0 = 2$, $L_1 = 1$, and $L_{n+2} =L_{n+1} +L_n$ for all $n \ge 0$. Determine the remainder when $L^2_{2019} +L^2_{2020}$ is divided by $L_{2023}$. [b]p9.[/b] Let $ABCD$ be a parallelogram. Point $P$ is selected in its interior such that the distance from $P$ to $BC$ is exactly $6$ times the distance from $P$ to $AD$, and $\angle APB = \angle CPD = 90^o$. Given that $AP = 2$ and $CP = 9$, the area of $ABCD$ can be expressed as $m\sqrt{n}$ where $m$ and $n$ are positive integers and $n$ is not divisible by the square of any prime. Find $m + n$. [b]p10.[/b] Consider the polynomial $P(x) = x^{35} + ... + x + 1$. How many pairs $(i, j)$ of integers are there with $0 \le i < j \le 35$ such that if we flip the signs of the $x^i$ and $x^j$ terms in $P(x)$ to form a new polynomial $Q(x)$, then there exists a nonconstant polynomial $R(x)$ with integer coefficients dividing both $P(x)$ and $Q(x)$? PS. You should use hide for answers. Collected [url=https://artofproblemsolving.com/community/c5h2760506p24143309]here[/url].

There is a $8*8$ board and the numbers $1,2,3,4,...,63,64$. In all the unit squares of the board, these numbers are places such that only $1$ numbers goes to only one unit square. Prove that there is atleast $4$ $2*2$ squares such that the sum of the numbers in $2*2$ is greater than $100$.

Given the function $$y =|x^2 - 4x + 3|.$$ Study its continuity and differentiability at the point of abscissa $1$. Its graph determines with the $X$ axis a closed figure. Determine the area of said figure.

Examine if we can put the sixteen positive divisors of $2024$ on the cells of the table shown such that the sum of the four numbers of any line or row to be a multiple of $3$. $ \begin{tabular}{ | l | c | c | r| } \hline & & & \\ \hline & & & \\ \hline & & & \\ \hline & & & \\ \hline \end{tabular} $

Compute the number of ordered quadruples of positive integers $(a,b,c,d)$ such that $$a!b!c!d!=24!$$$\textbf{(A)}~4$ $\textbf{(B)}~4!$ $\textbf{(C)}~4^4$ $\textbf{(D)}~\text{None of the above}$

Let $AB=AC$ in $\triangle ABC$, and let $D$ be a point on segment $AB$. The tangent at $D$ to the circumcircle $\omega$ of $BCD$ hits $AC$ at $E$. The other tangent from $E$ to $\omega$ touches it at $F$, and $G=BF \cap CD$, $H=AG \cap BC$. Prove that $BH=2HC$. [i]Proposed by David Stoner[/i]