Find all functions $f : \mathbb{N} \rightarrow \mathbb{N} $ satisfying \[ f(mn) = \operatorname{lcm} (m,n) \cdot \gcd( f(m), f(n) ) \] for all positive integer $m,n$.

The circles $\gamma$ and $\delta$ are internally tangent to the circle $\omega$ at $A$ and $B$. From $A$, draw two tangent lines $\ell_1, \ell_2$ to $\delta$, . From $B$ draw two tangent lines $t_1, t_2$ to $\gamma$ . Let $\ell_1$ intersect $t_1$ at $X$ and $\ell_2$ intersect $t_2$ at $Y$ . Prove that the quadrilateral $AX BY$ is cyclic. Nguyen Van Linh, High School of Natural Sciences, Hanoi National University

Find all $f:\mathbb{R}\rightarrow \mathbb{R}$ satisfying (for all $x,y \in \mathbb{R}$): $f(x+y)^2 - f(2x^2) = f(y-x)f(y+x) + 2x\cdot f(y)$.

We are given a $\Delta ABC$ with $\angle BAC=39^\circ$ and $\angle ABC=77^\circ$. Points $M$ and $N$ are chosen on $BC$ and $CA$ respectively, so that $\angle MAB=34^\circ$ and $\angle NBA=26^\circ$. Find $\angle BNM$.

Let $n$ be a positive integer. Determine all positive real numbers $x$ satisfying $nx^2 +\frac{2^2}{x + 1}+\frac{3^2}{x + 2}+...+\frac{(n + 1)^2}{x + n}= nx + \frac{n(n + 3)}{2}$

For integer $n\geq2$, let $x_1, x_2, \ldots, x_n$ be real numbers satisfying \[x_1+x_2+\ldots+x_n=0, \qquad \text{and}\qquad x_1^2+x_2^2+\ldots+x_n^2=1.\]For each subset $A\subseteq\{1, 2, \ldots, n\}$, define\[S_A=\sum_{i\in A}x_i.\](If $A$ is the empty set, then $S_A=0$.) Prove that for any positive number $\lambda$, the number of sets $A$ satisfying $S_A\geq\lambda$ is at most $2^{n-3}/\lambda^2$. For which choices of $x_1, x_2, \ldots, x_n, \lambda$ does equality hold?

Box is thinking of a number, whose digits are all “$1$”. When he squares the number, the sum of its digit is $85$. How many digits is Box’s number?

An equilateral triangle with side length 2023 has area $A$ and a regular hexagon with side length 289 has area $B$. If $\frac{A}{B}$ can be expressed in the form $\frac{m}{n}$ where $m$ and $n$ are relatively prime, find $m+n$. [i]Proposed by Andy Xu[/i]

Let $a, b$, and $c$ denote the three sides of a billiard table in the shape of an equilateral triangle. A ball is placed at the midpoint of side $a$ and then propelled toward side $b$ with direction defined by the angle $\theta$. For what values of $\theta$ will the ball strike the sides $b, c, a$ in that order?

Compute the number of ways to fill each cell in a $8 \times 8$ square grid with one of the letters $H, M,$ or $T$ such that every $2 \times 2$ square in the grid contains the letters $H, M, M, T$ in some order.

Prove that the inequality $ (x^{k}\minus{}y^{k})^{n}<(x^{n}\minus{}y^{n})^{k}$ holds forall reals $ x>y>0$ and positive integers $ n>k$.

In acute triangle $\triangle ABC$, point $R$ lies on the perpendicular bisector of $AC$ such that $\overline{CA}$ bisects $\angle BAR$. Let $Q$ be the intersection of lines $AC$ and $BR$. The circumcircle of $\triangle ARC$ intersects segment $\overline{AB}$ at $P\neq A$, with $AP=1$, $PB=5$, and $AQ=2$. Compute $AR$.

Let $x_1,x_2,\ldots,x_n$ be real numbers. Prove that \[ \sum_{i,j=1}^n |x_i+x_j|\geq n\sum_{i=1}^n |x_i| \]

Prove that for any positive integer $n$ there exists a matrix of the form $$A=\begin{pmatrix}1&a&b&c\\0&1&a&b\\0&0&1&a\\0&0&0&1\end{pmatrix},$$ (a) with nonzero entries, (b) with positive entries, such that the entries of $A^n$ are all perfect squares.

The fifth and eighth terms of a geometric sequence of real numbers are $ 7!$ and $ 8!$ respectively. What is the first term? $ \textbf{(A)}\ 60\qquad \textbf{(B)}\ 75\qquad \textbf{(C)}\ 120\qquad \textbf{(D)}\ 225\qquad \textbf{(E)}\ 315$

There are a total of $n$ boys and girls sitting in a big circle. Now, Dave wants to walk around the circle. For a start point, if at any time, one of the following two conditions holds: 1. he doesn't see any girl 2. the number of boys he saw $\ge$ the number of girls he saw $+k$ Then we say this point is [i]good[/i]. What is the maximum of $r$ with the property that there is at least one good point whenever the number of girls is $r$?

Consider a checkered $3m\times 3m$ square, where $m$ is an integer greater than $1.$ A frog sits on the lower left corner cell $S$ and wants to get to the upper right corner cell $F.$ The frog can hop from any cell to either the next cell to the right or the next cell upwards. Some cells can be [i]sticky[/i], and the frog gets trapped once it hops on such a cell. A set $X$ of cells is called [i]blocking[/i] if the frog cannot reach $F$ from $S$ when all the cells of $X$ are sticky. A blocking set is [i] minimal[/i] if it does not contain a smaller blocking set.[list=a][*]Prove that there exists a minimal blocking set containing at least $3m^2-3m$ cells. [*]Prove that every minimal blocking set containing at most $3m^2$ cells.

There are $5$ accents in French, each applicable to only specific letters as follows: [list] [*] The cédille: ç [*] The accent aigu: é [*] The accent circonflexe: â, ê, î, ô, û [*] The accent grave: à, è, ù [*] The accent tréma: ë, ö, ü [/list] Cédric needs to write down a phrase in French. He knows that there are $3$ words in the phrase and that the letters appear in the order: \[cesontoiseaux.\] He does not remember what the words are and which letters have what accents in the phrase. If $n$ is the number of possible phrases that he could write down, then determine the number of distinct primes in the prime factorization of $n$.

How many natural numbers $n$ are there so that $n^2 + 2014$ is a perfect square? (A): $1$, (B): $2$, (C): $3$, (D): $4$, (E) None of the above.

Given a triangle $ABC$ with $M$ the midpoint of minor arc $BC$. Let $H$ be the feet of altitude from $A$ to $BC$. Let $S$ and $T$ be the reflections of $B$ and $C$ with respect to line $AM$. Suppose the circle $(HST)$ meets $BC$ again at a point $P$. Prove that $\angle AMP = 90^\circ$. [i](Proposed by Tan Rui Xuen)[/i]

Given are positive reals $x_1, x_2,..., x_n$ such that $\sum\frac {1}{1+x_i^2}=1$. Find the minimal value of the expression $\frac{\sum x_i}{\sum \frac{1}{x_i}}$ and find when it is achieved.

Find all real numbers $a,b,c,d,e$ in the interval $[-2,2]$, that satisfy: \begin{align*}a+b+c+d+e &= 0\\ a^3+b^3+c^3+d^3+e^3&= 0\\ a^5+b^5+c^5+d^5+e^5&=10 \end{align*}

You are somewhere on a ladder with $5$ rungs. You have a fair coin and an envelope that contains either a double-headed coin or a double-tailed coin, each with probability $1/2$. Every minute you flip a coin. If it lands heads you go up a rung, if it lands tails you go down a rung. If you move up from the top rung you win, if you move down from the bottom rung you lose. You can open the envelope at any time, but if you do then you must immediately flip that coin once, after which you can use it or the fair coin whenever you want. What is the best strategy (i.e. on what rung(s) should you open the envelope)?

What is the last three digits of the sum 11! + 12! + 13! +


+ 2006!

Is it possible to make a $100 \times 100$ table of numbers such that the sum of numbers in each column is positive while the sum of numbers in each row is negative?