Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that \[f(f(x)+x+f(y)f(z))=f(x+zf(x)+zf(y))-xf(z-1)\]for all $x,y,z\in\mathbb{R}$.

Show that the only solutions of the equation $x^{3}-3xy^2 -y^3 =1$ are given by $(x,y)=(1,0),(0,-1),(-1,1),(1,-3),(-3,2),(2,1)$.

We will say that a convex polygon $M$ has the property $(*)$ if the straight lines on which its sides lie, being moved outward by a distance of $1$ cm, form a polygon $M'$, similar to this one. a) Prove that if a convex polygon has property $(*)$ , then a circle can be inscribed in it. b) Find the fourth side of a quadrilateral satisfying condition $(*)$ if the lengths of its three consecutive sides are $9, 7$, and $3$ cm.

A communications network consisting of some terminals is called a [i]$3$-connector[/i] if among any three terminals, some two of them can directly communicate with each other. A communications network contains a [i]windmill[/i] with $n$ blades if there exist $n$ pairs of terminals $\{x_{1},y_{1}\},\{x_{2},y_{2}\},\ldots,\{x_{n},y_{n}\}$ such that each $x_{i}$ can directly communicate with the corresponding $y_{i}$ and there is a [i]hub[/i] terminal that can directly communicate with each of the $2n$ terminals $x_{1}, y_{1},\ldots,x_{n}, y_{n}$ . Determine the minimum value of $f (n)$, in terms of $n$, such that a $3$ -connector with $f (n)$ terminals always contains a windmill with $n$ blades.

Let $x$ be a natural number. We call $\{x_0,x_1,\dots ,x_l\}$ a [i]factor link [/i]of $x$ if the sequence $\{x_0,x_1,\dots ,x_l\}$ satisfies the following conditions: (1) $x_0=1, x_l=x$; (2) $x_{i-1}<x_i, x_{i-1}|x_i, i=1,2,\dots,l$ . Meanwhile, we define $l$ as the length of the [i]factor link [/i] $\{x_0,x_1,\dots ,x_l\}$. Denote by $L(x)$ and $R(x)$ the length and the number of the longest [i]factor link[/i] of $x$ respectively. For $x=5^k\times 31^m\times 1990^n$, where $k,m,n$ are natural numbers, find the value of $L(x)$ and $R(x)$.

Calculate $$\sqrt{6 + \sqrt{6 + \sqrt{6 +... }}}+\frac{6}{1+ \frac{6}{1+...}}$$

Albert and Barbara play the following game. On a table there are $1999$ sticks, and each player in turn removes some of them: at least one stick, but at most half of the currently remaining sticks. The player who leaves just one stick on the table loses the game. Barbara moves first. Decide which player has a winning strategy and describe that strategy.

Let \[ E_n=(a_1-a_2)(a_1-a_3)\ldots(a_1-a_n)+(a_2-a_1)(a_2-a_3)\ldots(a_2-a_n)+\ldots+(a_n-a_1)(a_n-a_2)\ldots(a_n-a_{n-1}). \] Let $S_n$ be the proposition that $E_n\ge0$ for all real $a_i$. Prove that $S_n$ is true for $n=3$ and $5$, but for no other $n>2$.

Find the smallest natural $ k $ such that among any $ k $ distinct and pairwise coprime naturals smaller than $ 2018, $ a prime can be found. [i]Vlad Robu[/i]

If $2^a+2^b=3^c+3^d$, the number of integers $a,b,c,d$ which can possibly be negative, is, at most: $\textbf{(A)}\ 4 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 2 \qquad \textbf{(D)}\ 1 \qquad \textbf{(E)}\ 0$

Let $p$ be a prime number and a table of size $(p^2+ p+1)\times (p^2+p + 1)$ which is divided into unit cells. The way to color some cells of this table is called nice if there are no four colored cells that form a rectangle (the sides of rectangle are parallel to the sides of given table). 1. Let $k$ be the number of colored cells in some nice coloring way. Prove that $k \le (p + 1)(p^2 + p + 1)$. Denote this number as $k_{max}$. 2. Prove that all ordered tuples $(a, b, c)$ with $0 \le a, b, c < p$ and $a + b + c > 0$ can be partitioned into $p^2 + p + 1$ sets $S_1, S_2, .. . S_{p^2+p+1}$ such that two tuples $(a_1, b_1, c_1)$ and $(a_2, b_2, c_2)$ belong to the same set if and only if $a_1 \equiv ka_2, b_1 \equiv kb_2, c_1 \equiv kc_2$ (mod $p$) for some $k \in \{1,2, 3, ... , p - 1\}$. 3. For $1 \le i, j \le p^2+p+1$, if there exist $(a_1, b_1, c_1) \in S_i$ and $(a_2, b_2, c_2) \in S_j$ such that $a_1a_2 + b_1b_2 + c_1c_2 \equiv 0$ (mod $p$), we color the cell $(i, j)$ of the given table. Prove that this coloring way is nice with $k_{max}$ colored cells

Let ${ABC}$ be a triangle and ${\Gamma}$ the circle with diameter ${AB}$. The bisectors of ${\angle BAC}$ and ${\angle ABC}$ intersect ${\Gamma}$ (also) at ${D}$ and ${E}$, respectively. The incircle of ${ABC}$ meets ${BC}$ and ${AC}$ at ${F}$ and ${G}$, respectively. Prove that ${D, E, F}$ and ${G}$ are collinear.

Assume that $a$, $b$, $c$, and $d$ are positive integers such that $a^5 = b^4$, $c^3 = d^2$, and $c - a = 19$. Determine $d - b$.

[asy]size(8cm); real w = 2.718; // width of block real W = 13.37; // width of the floor real h = 1.414; // height of block real H = 7; // height of block + string real t = 60; // measure of theta pair apex = (w/2, H); // point where the strings meet path block = (0,0)--(w,0)--(w,h)--(0,h)--cycle; // construct the block draw(shift(-W/2,0)*block); // draws white block path arrow = (w,h/2)--(w+W/8,h/2); // path of the arrow draw(shift(-W/2,0)*arrow, EndArrow); // draw the arrow picture pendulum; // making a pendulum... draw(pendulum, block); // block fill(pendulum, block, grey); // shades block draw(pendulum, (w/2,h)--apex); // adds in string add(pendulum); // adds in block + string add(rotate(t, apex) * pendulum); // adds in rotated block + string dot("$\theta$", apex, dir(-90+t/2)*3.14); // marks the apex and labels it with theta draw((apex-(w,0))--(apex+(w,0))); // ceiling draw((-W/2-w/2,0)--(w+W/2,0)); // floor[/asy] A block of mass $m=\text{4.2 kg}$ slides through a frictionless table with speed $v$ and collides with a block of identical mass $m$, initially at rest, that hangs on a pendulum as shown above. The collision is perfectly elastic and the pendulum block swings up to an angle $\theta=12^\circ$, as labeled in the diagram. It takes a time $ t = \text {1.0 s} $ for the block to swing up to this peak. Find $10v$, in $\text{m/s}$ and round to the nearest integer. Do not approximate $ \theta \approx 0 $; however, assume $\theta$ is small enough as to use the small-angle approximation for the period of the pendulum. [i](Ahaan Rungta, 6 points)[/i]

Let $L$ be the answer to problem $9$. Find the solution to the equation $4x+\sqrt{L}=0$. Let $M$ be the answer to problem $7$. Let $f(x)=x^4+4x^3+6x^2+1$. Find $f(M)$. Let $T$ be the answer to problem $8$. Find the area of a square with side length $T$.

Let $n$ be a natural number $n \geq 2$ and matrices $A,B \in M_{n}(\mathbb{C}),$ with property $A^2 B = A.$ a) Prove that $(AB - BA)^2 = O_{n}.$ b) Show that for all natural number $k$, $k \leq \frac{n}{2}$ there exist matrices $A,B \in M_{n}(\mathbb{C})$ with property stated in the problem such that $rank(AB - BA) = k.$

What is the tens digit of $2015^{2016}-2017?$ $\textbf{(A)}\ 0 \qquad \textbf{(B)}\ 1 \qquad \textbf{(C)}\ 3 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 8$

Evaluate the following integrals. (1) $\int_{0}^{\frac{\pi}{4}}\frac{dx}{1+\sin x}.$ (2) $\int_{\frac{4}{3}}^{2}\frac{dx}{x^{2}\sqrt{x-1}}.$

Given $4$ lines in the plane such that there are not $2$ parallel to each other or no $3$ concurrent, we consider the following $ 8$ segments: in each line we have $2$ consecutive segments determined by the intersections with the other three lines. Prove that: a) The lengths of the $ 8$ segments cannot be the numbers $1, 2, 3,4, 5, 6, 7, 8$ in some order. b) The lengths of the $ 8$ segments can be $ 8$ different integers.

A circle that passes through the vertex $A$ of a rectangle $ABCD$ intersects the side $AB$ at a second point $E$ different from $B.$ A line passing through $B$ is tangent to this circle at a point $T,$ and the circle with center $B$ and passing through $T$ intersects the side $BC$ at the point $F.$ Show that if $\angle CDF= \angle BFE,$ then $\angle EDF=\angle CDF.$

The digits $2,3,4,5,6,7,8,9$ are written down in some order. When read in that order, the digits form an $8$-digit, base $10$ positive integer. if this integer is divisible by $44$, how many ways could the digits have been initially ordered? [i]Proposed by Evan Chang (squareman), USA[/i]

For non-negative integer $n$, the function $f$ is given by \[f(x)=\begin{cases} \frac{x}{2} & \text{if $n$ is even} \\ x-1 & \text{if $n$ is odd.} \end{cases} \] Furthermore, let $h(n)$ be the smallest $k$ for which $f^k(n)=0$. Compute \[\sum_{n=1}^{1024} h(n).\]

Suppose that \[\prod_{n=1}^{1996}(1+nx^{3^{n}}) = 1+a_{1}x^{k_{1}}+a_{2}x^{k_{2}}+\cdots+a_{m}x^{k_{m}}\] where $a_{1}$, $a_{2}$,..., $a_{m}$ are nonzero and $k_{1}< k_{2}< \cdots < k_{m}$. Find $a_{1996}$.

Show that $ \frac{1}{2^2} +\frac{1}{3^2} +...+\frac{1}{n^2} <\frac{2}{3}$ for all $n \ge 2 $.

The side $AC$ of an acute triangle $ABC$ is the diameter of the circle $c_1$ and side $BC$ is the diameter of the circle $c_2$. Let $E$ be the foot of the altitude drawn from the vertex $B$ of the triangle and $F$ the foot of the altitude drawn from the vertex $A$. In addition, let $L$ and $N$ be the points of intersection of the line $BE$ with the circle $c_1$ (the point $L$ lies on the segment $BE$) and the points of intersection of $K$ and $M$ of line $AF$ with circle $c_2$ (point $K$ is in section $AF$). Prove that $K LM N$ is a cyclic quadrilateral.