Let u be a fixed positive integer. Prove that the equation $n! = u^{\alpha} - u^{\beta}$ has a finite number of solutions $(n, \alpha, \beta).$

Let $PA$ and $PB$ be the tangent of a circle $\omega$ from a point $P$ outside the circle. Let $M$ be any point on $AP$ and $N$ is the midpoint of segment $AB$. $MN$ cuts $\omega$ at $C$ such that $N$ is between $M$ and $C$. Suppose $PC$ cuts $\omega$ at $D$ and $ND$ cuts $PB$ at $Q$. Prove $MQ$ is parallel to $AB$.

Compute the number of ordered pairs of integers $(a, b),$ with $2 \le a, b \le 2021,$ that satisfy the equation \[a^{\log_b \left(a^{-4}\right)} = b^{\log_a \left(ba^{-3}\right)}.\]

Let $n$ be a positive integer. Suppose that $A,B,$ and $M$ are $n\times n$ matrices with real entries such that $AM=MB,$ and such that $A$ and $B$ have the same characteristic polynomial. Prove that $\det(A-MX)=\det(B-XM)$ for every $n\times n$ matrix $X$ with real entries.

Find the minimum of $\sum\limits_{k=0}^{40} \left(x+\frac{k}{2}\right)^2$ where $x$ is a real numbers

Does there exist a circle and an infinite set of points on it such that the distance between any two points of the set is rational?

Given $2012$ distinct points $A_1,A_2,\dots,A_{2012}$ on the Cartesian plane. For any permutation $B_1,B_2,\dots,B_{2012}$ of $A_1,A_2,\dots,A_{2012}$ define the [i]shadow[/i] of a point $P$ as follows: [i]Point $P$ is rotated by $180^{\circ}$ around $B_1$ resulting $P_1$, point $P_1$ is rotated by $180^{\circ}$ around $B_2$ resulting $P_2$, ..., point $P_{2011}$ is rotated by $180^{\circ}$ around $B_{2012}$ resulting $P_{2012}$. Then, $P_{2012}$ is called the shadow of $P$ with respect to the permutation $B_1,B_2,\dots,B_{2012}$.[/i] Let $N$ be the number of different shadows of $P$ up to all permutations of $A_1,A_2,\dots,A_{2012}$. Determine the maximum value of $N$. [i]Proposer: Hendrata Dharmawan[/i]

Each integer is colored with exactly one of $3$ possible colors -- black, red or white -- satisfying the following two rules : the negative of a black number must be colored white, and the sum of two white numbers (not necessarily distinct) must be colored black. [b](a)[/b] Show that, the negative of a white number must be colored black and the sum of two black numbers must be colored white. [b](b)[/b] Determine all possible colorings of the integers that satisfy these rules.

Define the polynomial $f(x) = x^4 + x^3 + x^2 + x + 1$. Compute the number of positive integers $n$ less than equal to $2022$ such that $f(n)$ is $1$ more than multiple of $5$.

In triangle $ ABC$, $ M$ is the midpoint of side $ BC$ and $ G$ is the centroid of triangle $ ABC$. A line $ l$ passes through $ G$, intersecting line $ AB$ at $ P$ and line $ AC$ at $ Q$, where $ P\ne B$ and $ Q\ne C$. If $ [XYZ]$ denotes the area of triangle $ XYZ$, show that $ \frac{[BGM]}{[PAG]}\plus{}\frac{[CMG]}{[QGA]}\equal{}\frac32$.

Positive reals $a,b,c$ satisfy $ab+bc+ca=abc$. Prove that: $\frac{a^4+b^4}{ab(a^3+b^3)} + \frac{b^4+c^4}{bc(b^3+c^3)}+\frac{c^4+a^4}{ca(c^3+a^3)} \geq 1$

A number is called [i]good[/i] if it can be written as the sum of the squares of three consecutive positive integers. A number is called excellent if it can be written as the sum of the squares of four consecutive positive integers. (For instance, $14 = 1^2 + 2^2 + 3^2$ is good and $30 =1^2 +2^2 +3^2+4^2$ is excellent.) A good number $G$ is called [i]splendid[/i] if there exists an excellent number $E$ such that $3G-E = 2025.$ If the sum of all splendid numbers is $S,$ find the remainder when $S$ is divided by $1000.$

Let $f$ of degree at most 13 such that $f(k) = 13^k$ for $0 \leq k \leq 13$. Compute the last three digits of $f(14)$. [i]Proposed by Kaylee Ji[/i]

Determine all pairs of real numbers $(k, d)$ such that the system of equations $$\begin{cases} x^3 + y^3 = 2 \\ kx + d = y\end{cases}$$ has no solutions $(x, y)$ with $x$ and $y$ real numbers.

Evaluate \[\lim_{n\to\infty} \left(\int_0^{\pi} \frac{\sin ^ 2 nx}{\sin x}dx-\sum_{k=1}^n \frac{1}{k}\right)\]

Let positive numbers $a_1, a_2, ..., a_{3n}$ $(n \geq 2)$ constitute an arithmetic progression with common difference $d > 0$. Prove that among any $n + 2$ terms in this progression, there exist two terms $a_i, a_j$ $(i \neq j)$ satisfying $1 < \frac{|a_i - a_j|}{nd} < 2$.

Pasha placed numbers from 1 to 100 in the cells of the square $10\times 10$, each number exactly once. After that, Dima considered all sorts of squares, with the sides going along the grid lines, consisting of more than one cell, and painted in green the largest number in each such square (one number could be colored many times). Is it possible that all two-digit numbers are painted green?

Let $a, b, c, d, e, f, g, h, i$ be distinct integers from $1$ to $9$. The minimum possible positive value of $$\frac{a \cdot b \cdot c - d \cdot e \cdot f}{g \cdot h \cdot i}$$ can be written as $\frac{m}{n},$ where $m$ and $n$ are relatively prime positive integers. Find $m+n.$

Let $ a_1\geq \cdots \geq a_n \geq a_{n \plus{} 1} \equal{} 0$ be real numbers. Show that \[ \sqrt {\sum_{k \equal{} 1}^n a_k} \leq \sum_{k \equal{} 1}^n \sqrt k (\sqrt {a_k} \minus{} \sqrt {a_{k \plus{} 1}}). \] [i]Proposed by Romania[/i]

Let $ABC$ be a scalene triangle. Let $\ell$ be a line passing through point $B$ that lies outside of the triangle $ABC$ and creates different angles with sides $AB$ and $BC$ . The point $M$ is the midpoint of side $AC$ and the ponts $H_a$ and $H_c$ are the bases of the perpendicular lines on the line $\ell$ drawn from points $A$ and $C$ respectively. The circle circumscribing triangle $MBH_a$ intersects AB at the point $A_1$ and the circumscribed circle of triangle $MBH_c$ intersects $BC$ at point $C_1$. The point $A_2$ is symmetric to the point $A$ relative to the point $A_1$ and the point $C_2$ is symmetric to the point $C_1$ relative to the point $C_1$. Prove that the lines $\ell$, $AC_2$ and $CA_2$ intersect at one point. (Yana Kolodach)

Let $a$ be a real number and $A = \{(x, y) \in R \times R | \, x + y = a\}$, $B = \{(x,y) \in R \times R | \, x^3 + y^3 < a\}$ . Find all values of $a$ such that $A \cap B = \emptyset$ .

A dessert chef prepares the dessert for every day of a week starting with Sunday. The dessert each day is either cake, pie, ice cream, or pudding. The same dessert may not be served two days in a row. There must be cake on Friday because of a birthday. How many different dessert menus for the week are possible? $ \textbf{(A)}\ 729\qquad\textbf{(B)}\ 972\qquad\textbf{(C)}\ 1024\qquad\textbf{(D)}\ 2187\qquad\textbf{(E)}\ 2304 $

Let $a, b,c,d$ be positive integers such that $ac+bd$ is divisible by $a^2 +b^2$. Prove that $gcd(c^2 + d^2, a^2 + b^2) > 1$. Trần Nam Dũng

$12$ knights are sitting at a round table. Every knight is an enemy with two of the adjacent knights but with none of the others. $5$ knights are to be chosen to save the princess, with no enemies in the group. How many ways are there for the choice?

In the lower-left $3\times3$ square of an $8\times8$ chessboard there are nine pawns. Every pawn can jump horizontally or vertically over a neighboring pawn to the cell across it if that cell is free. Is it possible to arrange the nine pawns in the upperleft $3\times3$ square of the chessboard using finitely many such moves?