Let $ABC$ be a triangle and let $\Gamma$ be its circumcircle. Let $D$ be a point on $AB$ such that $CD$ is parallel to the line tangent to $\Gamma$ at $A$. Let $E$ be the intersection of $CD$ with $\Gamma$ distinct from $C$, and $F$ the intersection of $BC$ with the circumcircle of $\bigtriangleup ADC$ distinct from $C$. Finally, let $G$ be the intersection of the line $AB$ and the internal bisector of $\angle DCF$. Show that $E,\ G,\ F$ and $C$ lie on the same circle.

For any positive integers $n$ and $m$ satisfying the equation $n^3+(n+1)^3+(n+2)^3=m^3$, prove that $4\mid n+1$.

Find all integer solutions of the equation $2x^6 + y^7 = 11$.

The difference between the larger root and the smaller root of $ x^2 \minus{} px \plus{} (p^2 \minus{} 1)/4 \equal{} 0$ is: $ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ p \qquad \textbf{(E)}\ p\plus{}1$

Determine all pairs $(x, y)$ of positive integers such that \[\sqrt[3]{7x^2-13xy+7y^2}=|x-y|+1.\] [i]Proposed by Titu Andreescu, USA[/i]

Define a sequence of positive integers $\{a_n\}$ through the recursive formula: $a_{n+1}=a_n+b_n(n\ge 1)$,where $b_n$ is obtained by rearranging the digits of $a_n$ (in decimal representation) in reverse order (for example,if $a_1=250$,then $b_1=52,a_2=302$,and so on). Can $a_7$ be a prime?

Solve the following equation in real numbers: $\frac{(x^2-1)(|x|+1)}{x+sgnx}=[x+1].$

How many positive integers divide at least two of the numbers $120$, $144$, and $180$? [i]Proposed by Evan Chen[/i]

Show that the number $11^{100}-1$ is both divisible by $6000$ and its last four decimal digits are $6000$.

Let $ABCD$ be a trapezoid of bases $AB$ and $CD$ . Let $O$ be the intersection point of the diagonals $AC$ and $BD$. If the area of the triangle $ABC$ is $150$ and the area of the triangle $ACD$ is $120$, calculate the area of the triangle $BCO$.

$(CZS 4)$ Let $K_1,\cdots , K_n$ be nonnegative integers. Prove that $K_1!K_2!\cdots K_n! \ge \left[\frac{K}{n}\right]!^n$, where $K = K_1 + \cdots + K_n$

Let $x_i$, $y_i$, $z_i$, $w_i \in \mathbb{R}^+, i = 1, 2,\cdots n$, such that$$\sum \limits_{i=1}^nx_i=nx,\ \sum \limits_{i=1}^ny_i=ny,\ \sum \limits_{i=1}^nw_i=nw $$ $$\Gamma \left(z_i\right)\geq \Gamma \left(w_i\right),\ \sum \limits_{i=1}^n\Gamma \left(z_i\right)=n\Gamma^* (z)$$Then$$\sum \limits_{i=1}^n \frac{\left(\Gamma \left(x_i\right)+\Gamma \left(y_i\right)\right)^2}{\Gamma \left(z_i\right)-\Gamma \left(w_i\right)}\geq n\frac{\left(\Gamma \left(x\right)+\Gamma \left(y\right)\right)^2}{\Gamma^* \left(z\right)-\Gamma \left(w\right)}$$

Find all functions $f: \mathbb{R^{+}} \rightarrow \mathbb {R^{+}}$ such that $f(f(x)+\frac{y+1}{f(y)})=\frac{1}{f(y)}+x+1$ for all $x, y>0$. [i]Proposed by Dominik Burek, Poland[/i]

Let $I$ be incentre of scalene $\triangle ABC$ and let $L$ be midpoint of arc $BAC$. Let $M$ be midpoint of $BC$ and let the line through $M$ parallel to $AI$ intersect $LI$ at point $P$. Let $Q$ lie on $BC$ such that $PQ\perp LI$. Let $S$ be midpoint of $AM$ and $T$ be midpoint of $LI$. Prove that $IS\perp BC$ if and only if $AQ\perp ST$. [i]~Mahavir Gandhi[/i]

For a positive integer $n \ge 2 $, define set $ T = \{ (i,j) | 1 \le i < j \le n , i | j \} $. For nonnegative real numbers $ x_1 , x_2 , \cdots , x_n $ with $ x_1 + x_2 + \cdots + x_n = 1 $, find the maximum value of \[ \sum_{(i,j) \in T} x_i x_j \] in terms of $n$.

For which real numbers $c$ is $$\frac{e^x +e^{-x} }{2} \leq e^{c x^2 }$$ for all real $x?$

Given positive integers $a,c$ and integer $b$, prove that there exists a positive integer $x$ such that \[ a^x + x \equiv b \pmod c, \] that is, there exists a positive integer $x$ such that $c$ is a divisor of $a^x + x - b$.

A rectangle, $HOMF$, has sides $HO=11$ and $OM=5$. A triangle $\Delta ABC$ has $H$ as orthocentre, $O$ as circumcentre, $M$ be the midpoint of $BC$, $F$ is the feet of altitude from $A$. What is the length of $BC$ ? [asy] unitsize(0.3 cm); pair F, H, M, O; F = (0,0); H = (0,5); O = (11,5); M = (11,0); draw(H--O--M--F--cycle); label("$F$", F, SW); label("$H$", H, NW); label("$M$", M, SE); label("$O$", O, NE); [/asy]

Determine whether or not there exist numbers $x_1,x_2,\ldots ,x_{2009}$ from the set $\{-1,1\}$, such that: \[x_1x_2+x_2x_3+x_3x_4+\ldots+x_{2008}x_{2009}+x_{2009}x_1=999\]

Let $ABCD$ be a trapezoid with bases $AB$ and $CD$, inscribed in a circle of center $O$. Let $P$ be the intersection of the lines $BC$ and $AD$. A circle through $O$ and $P$ intersects the segments $BC$ and $AD$ at interior points $F$ and $G$, respectively. Show that $BF=DG$.

An infinite sequence of integers $a_1,a_2,a_3, ...$ is given with $a_1 = 0$ and further holds for every natural number $n$ that $a_{n+1} = a_n - n$ if $a_n \ge n$ and $a_{n+1} = a_n + n$ if $a_n < n$ . (a) Prove that there are infinitely many numbers in the sequence equal to $0$. (b) Express in terms of $k$ the ordinal number of the $k^e$ number from the sequence, which is equal to $0$.

In the arrangement of $pn$ real numbers below, the difference between the greatest and smallest numbers in each row is at most $d$, $d > 0$. \[ \begin{array}{l} a_{11} \,\, a_{12} \,\, ... \,\, a_{1n}\\ a_{21} \,\, a_{22} \,\, ... \,\, a_{2n}\\ \,\, . \,\, \,\, \,\, \,\, . \,\, \,\, \,\, \,\, \,\, \,\, \,\, \,\, .\\ \,\, . \,\, \,\, \,\, \,\, . \,\, \,\, \,\, \,\, \,\, \,\, \,\, \,\, .\\ \,\, . \,\, \,\, \,\, \,\, . \,\, \,\, \,\, \,\, \,\, \,\, \,\, \,\, .\\ a_{n1} \,\, a_{n2} \,\, ... \,\, a_{nn}\\ \end{array} \] Prove that, when the numbers in each column are rearranged in decreasing order, the difference between the greatest and smallest numbers in each row will still be at most d.

Each vertex $v$ and each edge $e$ of a graph $G$ are assigned numbers $f(v)\in\{1,2\}$ and $f(e)\in\{1,2,3\}$, respectively. Let $S(v)$ be the sum of numbers assigned to the edges incident to $v$ plus the number $f(v)$. We say that an assignment $f$ is [i]cool [/i]if $S(u) \ne S(v)$ for every pair $(u,v)$ of adjacent (i.e. connected by an edge) vertices in $G$. Prove that for every graph there exists a cool assignment.

Let $f : \mathbb{N} \longrightarrow \mathbb{N}$ be a function such that (a) $ f(m) < f(n)$ whenever $m < n$. (b) $f(2n) = f(n) + n$ for all $n \in \mathbb{N}$. (c) $n$ is prime whenever $f(n)$ is prime. Find $$\sum_{n=1}^{2022} f(n).$$

Let $a$ and $b$ be natural numbers such that $2a-b$, $a-2b$ and $a+b$ are all distinct squares. What is the smallest possible value of $b$ ?