Given are natural numbers $n>m>1$. We draw $m$ numbers from the set $\{1,2,...,n\}$ one by one without putting the drawn numbers back. Find the expected value of the difference between the largest and the smallest of the drawn numbers.

Let $ABC$ be a triangle and $D$ be a point inside triangle $ABC$. $\Gamma$ is the circumcircle of triangle $ABC$, and $DB$, $DC$ meet $\Gamma$ again at $E$, $F$ , respectively. $\Gamma_1$, $\Gamma_2$ are the circumcircles of triangle $ADE$ and $ADF$ respectively. Assume $X$ is on $\Gamma_2$ such that $BX$ is tangent to $\Gamma_2$. Let $BX$ meets $\Gamma$ again at $Z$. Prove that the line $CZ$ is tangent to $\Gamma_1$ . [i]Proposed by HakureiReimu[/i].

Let \( \varphi \) be the Euler's totient function. 1. For any given integer \( a > 1 \), does there exist \( l \in \mathbb{N}_+ \) such that for any \( k \in \mathbb{N}_+ \), \( l \mid k \) and \( a^2 \nmid l \), \( \frac{\varphi(k)}{\varphi(l)} \) is a non-negative power of \( a \)? 2. For integer \( x > a \), are there integers \( k_1 \) and \( k_2 \) satisfying: \[ \varphi(k_i) \in \left ( \frac{x}{a} ,x \right ], i = 1,2; \quad \varphi(k_1) \neq \varphi(k_2). \] And these two different \( k_i \) correspond to the same \( l_1 \) and \( l_2 \) as described in (1), yet \( \varphi(l_1) = \varphi(l_2) \). 3. Define \( \#E \) as the number of elements in set \( E \). For integer \( x > a \), let \( V(x) = \#\{v \in \mathbb{N}_+ \mid v = \varphi(k) \leq x\} \) and \( W(x) = \#\{w \in \mathbb{N}_+ \mid w = \varphi(l) \leq x, a^2 \mid l\} \). Compare \( V\left( \frac{x}{a} \right) \) with \( W(x) \).

The Fibonacci sequence $\{F_n\}$ is defined by $F_1 = F_2 = 1$ and $F_{n+2} = F_{n+1} + F_n$ for all positive integers $n$. Determine all triplets of positive integers $(k,m,n)$ such that $F_n = F_m^k$.

A sequence of reals $a_1, a_2, \cdots$ satisfies for all $m>1$, $$a_{m+1}a_{m-1}=a_m^2-a_1^2$$ Prove that for all $m>n>1$, the sequence satisfies the equation $$a_{m+n}a_{m-n}=a_m^2-a_n^2$$ [i]Proposed by Ivan Chan Kai Chin[/i]

Let $a, b, c, d$ be positive reals with $a - c = b - d > 0$. Show that $$\frac{ab}{cd} \ge \left(\frac{\sqrt{a} +\sqrt{b}}{\sqrt{c}+\sqrt{d}}\right)^4$$

Find the area of the region surrounded by the two curves $ y=\sqrt{x},\ \sqrt{x}+\sqrt{y}=1$ and the $ x$ axis.

Let $ABC$ be a triangle and $D$ a point on the side $BC$. Point $E$ is the symmetric of $D$ with respect to $AB$. Point $F$ is the symmetric of $E$ with respect to $AC$. Point $P$ is the intersection of line $DF$ with line $AC$. Prove that the quadrilateral $AEDP$ is cyclic. (Malik Talbi)

Consider a rhombus $ABCD$. Point $M$ and $N$ are given on the line segments $AC$ and $BC$ respectively, such that $DM = MN$. Lines $AC$ and $DN$ meet at point $P$ and lines $AB$ and $DM$ meet at point $R$. Prove that $RP = PD$.

Alice knows that $3$ red cards and $3$ black cards will be revealed to her one at a time in random order. Before each card is revealed, Alice must guess its color. If Alice plays optimally, the expected number of cards she will guess correctly is $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Given $X \subset \mathbb{N}$, define $d(X)$ as the largest $c \in [0, 1]$ such that for any $a < c$ and $n_0\in \mathbb{N}$, there exists $m, r \in \mathbb{N}$ with $r \geq n_0$ and $\frac{\mid X \cap [m, m+r)\mid}{r} \geq a$. Let $E, F \subset \mathbb{N}$ such that $d(E)d(F) > 1/4$. Prove that for any prime $p$ and $k\in\mathbb{N}$, there exists $m \in E, n \in F$ such that $m\equiv n \pmod{p^k}$

Find a sequence of $ 2012 $ distinct integers bigger than $ 0 $ such that their sum is a perfect square and their product is a perfect cube.

Define a sequence ${{a_n}}_{n\ge1}$ such that $a_1=1$ , $a_2=2$ and $a_{n+1}$ is the smallest positive integer $m$ such that $m$ hasn't yet occurred in the sequence and also $gcd(m,a_n)\neq{1}$. Show that all positive integers occur in the sequence.

Seyed has 998 white coins, a red coin, and an unusual coin with one red side and one white side. He can not see the color of the coins instead he has a scanner which checks if all of the coin sides touching the scanner glass are white. Is there any algorithm to find the red coin by using the scanner at most 17 times? [i]Proposed by Seyed Reza Hosseini[/i]

Let $x =\sqrt{a}+\sqrt{b}$, where $a$ and $b$ are natural numbers, $x$ is not an integer, and $x < 1976$. Prove that the fractional part of $x$ exceeds $10^{-19.76}$.

A $\emph{planar}$ graph is a connected graph that can be drawn on a sphere without edge crossings. Such a drawing will divide the sphere into a number of faces. Let $G$ be a planar graph with $11$ vertices of degree $2$, $5$ vertices of degree $3$, and $1$ vertex of degree $7$. Find the number of faces into which $G$ divides the sphere.

Let $0 < \theta < 2\pi$ be a real number for which $\cos (\theta) + \cos (2\theta) + \cos (3\theta) + ...+ \cos (2020\theta) = 0$ and $\theta =\frac{\pi}{n}$ for some positive integer $n$. Compute the sum of the possible values of $n \le 2020$.

Let $ n$ be a positive integer, and let $ x$ and $ y$ be a positive real number such that $ x^n \plus{} y^n \equal{} 1.$ Prove that \[ \left(\sum^n_{k \equal{} 1} \frac {1 \plus{} x^{2k}}{1 \plus{} x^{4k}} \right) \cdot \left( \sum^n_{k \equal{} 1} \frac {1 \plus{} y^{2k}}{1 \plus{} y^{4k}} \right) < \frac {1}{(1 \minus{} x) \cdot (1 \minus{} y)}. \] [i]Author: Juhan Aru, Estonia[/i]

Points $Y,Z$ lie on the smaller arc $BC$ of the circumcircle of an acute triangle $\bigtriangleup ABC$ ($Y$ lies on the smaller arc $BZ$). Let $X$ be a point such that the triangles $\bigtriangleup ABC,\bigtriangleup XYZ$ are similar (in this exact order) with $A,X$ lying on the same side of $YZ$. Lines $XY,XZ$ intersect sides $AB,AC$ at points $E,F$ respectively. Let $K$ be the intersection of lines $BY,CZ$. Prove that one of the intersections of the circumcircles of triangles $\bigtriangleup AEF,\bigtriangleup KBC$ lie on the line $KX$. [i]Proposed by Amirparsa Hosseini Nayeri - Iran[/i]

An island has $10$ cities, where some of the possible pairs of cities are connected by roads. A [i]tour route[/i] is a route starting from a city, passing exactly eight out of the other nine cities exactly once each, and returning to the starting city. (In other words, it is a loop that passes only nine cities instead of all ten cities.) For each city, there exists a tour route that doesn't pass the given city. Find the minimum number of roads on the island.

Construct a set $A\subset[0,1]\times[0,1]$ such that $A$ is dense in $[0,1]\times[0,1]$ and every vertical and every horizontal line intersects $A$ in at most one point.

There is a point $D$ on side $AC$ of acute triangle $\triangle ABC$. Let $AM$ be the median drawn from $A$ (so $M$ is on $BC$) and $CH$ be the altitude drawn from $C$ (so $H$ is on $AB$). Let $I$ be the intersection of $AM$ and $CH$, and let $K$ be the intersection of $AM$ and line segment $BD$. We know that $AK=8$, $BK=8$, and $MK=6$. Find the length of $AI$.

Determine, for any positive real number $a$, the number of solutions $(x,y)$ to the system of equations $$\begin{cases} |x|+|y|= 1 \\ x^2 + y^2 = a \end{cases}$$ where $x$ and $y$ are real numbers.

A particular coin can land on heads (H), on tails (T), or in the middle (M), each with probability $\frac{1}{3}$. Find the expected number of flips necessary to observe the contiguous sequence HMMTHMMT...HMMT, where the sequence HMMT is repeated 2016 times.

Let $ABC$ be a triangle with $AB > AC$. Point $P \in (AB)$ is such that $\angle ACP = \angle ABC$. Let $D$ be the reflection of $P$ into the line $AC$ and let $E$ be the point in which the circumcircle of $BCD$ meets again the line $AC$. Prove that $AE = AC$.