Figures $I$, $II$, and $III$ are squares. The perimeter of $I$ is $12$ and the perimeter of $II$ is $24$. The perimeter of $III$ is [asy] draw((0,0)--(15,0)--(15,6)--(12,6)--(12,9)--(0,9)--cycle); draw((9,0)--(9,9)); draw((9,6)--(12,6)); label("$III$",(4.5,4),N); label("$II$",(12,2.5),N); label("$I$",(10.5,6.75),N); [/asy] $\text{(A)}\ 9 \qquad \text{(B)}\ 18 \qquad \text{(C)}\ 36 \qquad \text{(D)}\ 72 \qquad \text{(D)}\ 81$

Factorise $ 5^{1985}\minus{}1$ as a product of three integers, each greater than $ 5^{100}$.

Find all pairs of functions $ f : \mathbb R \to \mathbb R$, $g : \mathbb R \to \mathbb R$ such that \[f \left( x + g(y) \right) = xf(y) - y f(x) + g(x) \quad\text{for all } x, y\in\mathbb{R}.\]

Find all pairs $(x,y)$ of positive real numbers such that $xy$ is an integer and $x+y = \lfloor x^2 - y^2 \rfloor$.

Let $\{a_1,...,a_n\}\subset \{-1,1\}$ and $a>0$ . Denote by $X$ and $Y$ the number of collections $\{\varepsilon_1,...,\varepsilon_n\}\subset \{-1,1\}$, such that $$max_{1\le k\le n}(\varepsilon_1a_1+...+\varepsilon_ka_k) >\alpha$$ and $$\varepsilon_1a_1+...+\varepsilon_na_n>a$$ respectively. Prove that $X\le 2Y$.

Given $2n$ points and $3n$ lines on the plane. Prove that there is a point $P$ on the plane such that the sum of the distances of $P$ to the $3n$ lines is less than the sum of the distances of $P$ to the $2n$ points.

Let $a_1,a_2,\cdots,a_{2000}$ be distinct positive integers such that $1 \leq a_1 < a_2 < \cdots < a_{2000} < 4000$ such that the LCM (least common multiple) of any two of them is $\geq 4000$. Show that $a_1 \geq 1334$

Let $\vartriangle XY Z$ be a triangle such that $\angle X = 70^o$. There exists a point $F$ inside triangle $\vartriangle XY Z$ such that $Y F$ bisects $\angle XY Z$ and $ZF$ bisects $\angle XZY$ . What is the measure of $\angle Y FZ$?

For positive integer $x>1$, define set $S_x$ as $$S_x=\{p^\alpha|p \textup{ is one of the prime divisor of }x,\alpha \in \mathbb{N},p^\alpha|x,\alpha \equiv v_p(x)(\textup{mod} 2)\},$$ where $v_p(n)$ is the power of prime divisor $p$ in positive integer $n.$ Let $f(x)$ be the sum of all the elements of $S_x$ when $x>1,$ and $f(1)=1.$ Let $m$ be a given positive integer, and the sequence $a_1,a_2,\cdots,a_n,\cdots$ satisfy that for any positive integer $n>m,$ $a_{n+1}=\max\{ f(a_n),f(a_{n-1}+1),\cdots,f(a_{n-m}+m)\}.$ Prove that (1)there exists constant $A,B(0<A<1),$ such that when positive integer $x$ has at least two different prime divisors, $f(x)<Ax+B$ holds; (2)there exists positive integer $N,l$, such that for any positive integer $n\geq N ,a_{n+l}=a_n$ holds.

Call a positive integer [b]good[/b] if either $N=1$ or $N$ can be written as product of [i]even[/i] number of prime numbers, not necessarily distinct. Let $P(x)=(x-a)(x-b),$ where $a,b$ are positive integers. (a) Show that there exist distinct positive integers $a,b$ such that $P(1),P(2),\cdots ,P(2010)$ are all good numbers. (b) Suppose $a,b$ are such that $P(n)$ is a good number for all positive integers $n$. Prove that $a=b$.

Let $AA_0$ be the altitude of the isosceles triangle $ABC~(AB = AC)$. A circle $\gamma$ centered at the midpoint of $AA_0$ touches $AB$ and $AC$. Let $X$ be an arbitrary point of line $BC$. Prove that the tangents from $X$ to $\gamma$ cut congruent segments on lines $AB$ and $AC$

In the city built are $2019$ metro stations. Some pairs of stations are connected. tunnels, and from any station through the tunnels you can reach any other. The mayor ordered to organize several metro lines: each line should include several different stations connected in series by tunnels (several lines can pass through the same tunnel), and in each station must lie at least on one line. To save money no more than $k$ lines should be made. It turned out that the order of the mayor is not feasible. What is the largest $k$ it could to happen?

Let $ n > 1$ be a fixed integer. Define functions $ f_0(x) \equal{} 0,$ $ f_1(x) \equal{} 1 \minus{} \cos(x),$ and for $ k > 0,$ \[ f_{k\plus{}1}(x) \equal{} f_k(x) \cdot \cos(x) \minus{} f_{k\minus{}1}(x).\] If $ F(x) \equal{} \sum^n_{r\equal{}1} f_r(x),$ prove that [b](a)[/b] $ 0 < F(x) < 1$ for $ 0 < x < \frac{\pi}{n\plus{}1},$ and [b](b)[/b] $ F(x) > 1$ for $ \frac{\pi}{n\plus{}1} < x < \frac{\pi}{n}.$

Let $A > 1$ and $B > 1$ be real numbers and (xn) be a sequence of numbers in the interval $[1,AB]$. Prove that there exists a sequence $(y_n)$ of numbers in the interval $[1,A]$ such that $$\frac{x_m}{x_n}\le B\frac{y_m}{y_n} \,\,\, for \,\,\, all \,\,\, m,n = 1,2,...$$

If $x \in \mathbb{R}\backslash \left \{\frac{k\pi}{2}\ |\ k\in \mathbb{Z} \right \}$, then $$\left (\sum \limits_{0\leq j<k\leq n} \sin (2(j+k)x)\right )^2 + \left (\sum \limits_{0\leq j<k\leq n} \cos (2(j+k)x)\right )^2 = \frac{\sin ^2 nx \sin ^2 (n+1)x}{\sin ^2x \sin^22x}$$

Given $N = 2^ap_1p_2...p_m$, $m \ge 1$, $a \in N$ with $p_1, p_2,..., p_m$ are different primes. It is known that $\sigma (N) = 3N $ where $\sigma (N)$ is the sum of all positive integers which are factors of $N$. Show that there exists a prime number $p$ such that $2^p- 1$ is also a prime, and $2^p - 1|N$.

We say that a covering of a $m\times n$ rectangle with dominos has a wall if there exists a horizontal or vertical line that splits the rectangle into two smaller rectangles and doesn't cut any of the dominos. prove that if these three conditions are satisfied: [b]a)[/b] $mn$ is an even number [b]b)[/b] $m\ge 5$ and $n\ge 5$ [b]c)[/b] $(m,n)\neq(6,6)$ then we can cover the rectangle with dominos in such a way that we have no walls. (20 points)

Let $a$ and $b$ be two positive integers. Prove that the integer \[a^2+\left\lceil\frac{4a^2}b\right\rceil\] is not a square. (Here $\lceil z\rceil$ denotes the least integer greater than or equal to $z$.) [i]Russia[/i]

For lunch, Lamy, Botan, Nene, and Polka each choose one of three options: a hot dog, a slice of pizza, or a hamburger. Lamy and Botan choose different items, and Nene and Polka choose the same item. In how many ways could they choose their items?

A school security guard works from Monday to Saturday from $7:30 am$ to $12:00 pm$ ($7:30$ to $12:00$). He also works the night shift, from Monday to Friday from $6pm$to $10pm$ ($18:00$ to $22:00$) . He receives $75MT$ per hour, up to $40$ hours of work per week. For the remaining hours of weekly work, he receives $95MT$ per hour. So, considering that a month has four weeks, what will be this security guard's monthly salary?

Let $ABCD$ be a cyclic quadrilateral with circumcenter $O$ lying in the interior. Let $E$ and $F$ be the midpoints of the segments $BC$ and $AD$, respectively. Let $X$ be the point lying on the same side of the line $EF$ as the vertex $C$ such that $\triangle EXF$ and $\triangle BOA$ are similar. Prove that $XC = XD$.

Let $n$ be a positive integer, $x_1,x_2,\ldots,x_{2n}$ be non-negative real numbers with sum $4$. Prove that there exist integer $p$ and $q$, with $0 \le q \le n-1$, such that \[ \sum_{i=1}^q x_{p+2i-1} \le 1 \mbox{ and } \sum_{i=q+1}^{n-1} x_{p+2i} \le 1, \] where the indices are take modulo $2n$. [i]Note:[/i] If $q=0$, then $\sum_{i=1}^q x_{p+2i-1}=0$; if $q=n-1$, then $\sum_{i=q+1}^{n-1} x_{p+2i}=0$.

Compute the number of ways to color the vertices of a regular heptagon red, green, or blue (with rotations and reflections distinct) such that no isosceles triangle whose vertices are vertices of the heptagon has all three vertices the same color.

Let $ABCD$ be a quadrilateral with $\overline{AB}\parallel\overline{CD}$, $AB=16$, $CD=12$, and $BC<AD$. A circle with diameter $12$ is inside of $ABCD$ and tangent to all four sides. Find $BC$.

Determine all positive integers $n$ for which there exists a set $S$ with the following properties: (i) $S$ consists of $n$ positive integers, all smaller than $2^{n-1}$; (ii) for any two distinct subsets $A$ and $B$ of $S$, the sum of the elements of $A$ is different from the sum of the elements of $B$.