Find all functions $u : R \to R$ for which there is a strictly increasing function $f : R \to R$ such that $f(x+y) = f(x)u(y)+ f(y)$ for all $x,y \in R$.

Let $A$ be the set of positive integers of the form $a^2 +2b^2$, where $a$ and $b$ are integers and $b \neq 0$. Show that if $p$ is a prime number and $p^2 \in A$, then $p \in A$.

Compute the smallest positive integer such that, no matter how you rearrange its digits (in base ten), the resulting number is a multiple of $63.$

There are There are $64$ towns in a country, and some pairs of towns are connected by roads but we do not know these pairs. We may choose any pair of towns and find out whether they are connected by a road. Our aim is to determine whether it is possible to travel between any two towns using roads. Prove that there is no algorithm which would enable us to do this in less than $2016$ questions. but we do not know these pairs. We may choose any pair of towns and find out whether they are connected by a road. Our aim is to determine whether it is possible to travel between any two towns using roads. Prove that there is no algorithm which would enable us to do this in less than $2016$ questions.

Let $z = \cos \frac{2\pi}{2011} + i\sin \frac{2\pi}{2011}$, and let \[ P(x) = x^{2008} + 3x^{2007} + 6x^{2006} + \cdots + \frac{2008 \cdot 2009}{2} x + \frac{2009 \cdot 2010}{2} \] for all complex numbers $x$. Evaluate $P(z)P(z^2)P(z^3) \cdots P(z^{2010})$.

Let $m, k$, and $c$ be positive integers with $k > c$, and let $\lambda$ be a positive, non-integer real root of the equation $\lambda^{m+1} - k \lambda^m - c = 0$. Let $f : Z^+ \to Z$ be defined by $f(n) = \lfloor \lambda n \rfloor$ for all $n \in Z^+$. Show that $f^{m+1}(n) \equiv cn - 1$ (mod $k$) for all $n \in Z^+$. (Here, $Z^+$ denotes the set of positive integers, $ \lfloor x \rfloor$ denotes the greatest integer less than or equal to $x$, and $f^{m+1}(n) = f(f(... f(n)...))$ where $f$ appears $m + 1$ times.)

A lattice point is defined as a point on the plane with integer coordinates. Show that for all positive integers $n$, there is a circle on the plane with exactly n lattice points in its interior (not including its boundary).

Let $a,b,c,d \in [0,1] .$ Prove that$$\frac{1}{1+a+b}+\frac{1}{1+b+c}+\frac{1}{1+c+d}+\frac{1}{1+d+a}\leq \frac{4}{1+2\sqrt[4]{abcd}}$$

Let $ABC$ be a triangle with incenter $I$. Let $U$, $V$ and $W$ be the intersections of the angle bisectors of angles $A$, $B$, and $C$ with the incircle, so that $V$ lies between $B$ and $I$, and similarly with $U$ and $W$. Let $X$, $Y$, and $Z$ be the points of tangency of the incircle of triangle $ABC$ with $BC$, $AC$, and $AB$, respectively. Let triangle $UVW$ be the [i]David Yang triangle[/i] of $ABC$ and let $XYZ$ be the [i]Scott Wu triangle[/i] of $ABC$. Prove that the David Yang and Scott Wu triangles of a triangle are congruent if and only if $ABC$ is equilateral. [i]Proposed by Owen Goff[/i]

Let $a_1, . . . , a_{2020}$ be a sequence of real numbers such that $a_1 = 2^{-2019}$, and $a^2_{n-1}a_n = a_n-a_{n-1}$. Prove that $a_{2020} <\frac{1}{2^{2019} -1}$

In a classroom there are $m$ students. During the month of July each of them visited the library at least once but none of them visited the library twice in the same day. It turned out that during the month of July each student visited the library a different number of times, furthermore for any two students $A$ and $B$ there was a day in which $A$ visited the library and $B$ did not and there was also a day when $B$ visited the library and $A$ did not do so. Determine the largest possible value of $m$.

Calculate $\sin^3 a + \cos^3 a$ if you know that $\sin a+ \cos a = m$.

Prove that for all positive integers $n,m$ and all real numbers $x, y > 0$ the following inequality holds: \[(n - 1)(m- 1)(x^{n+m} + y^{n+m}) + (n + m - 1)(x^ny^m + x^my^n)\\ \\ \ge nm(x^{n+m-1}y + xy^{n+m-1}).\]

Find the number of ways to put a number in every unit square of a $3 \times 3$ square such that any number is divisible by the number directly to the top and the number directly to the left of it, and the top-left number is $1$ and the bottom right number is $2013$.

An octomino is made by joining $8$ congruent squares edge to edge. Three examples are shown below. How many octominoes have at least $2$ lines of symmetry? [asy] size(8cm,0); filldraw((0,1)--(0,2)--(1,2)--(1,1)--cycle,grey); filldraw((0,2)--(0,3)--(1,3)--(1,2)--cycle,grey); filldraw((0,3)--(0,4)--(1,4)--(1,3)--cycle,grey); filldraw((1,0)--(1,1)--(2,1)--(2,0)--cycle,grey); filldraw((1,1)--(1,2)--(2,2)--(2,1)--cycle,grey); filldraw((1,2)--(1,3)--(2,3)--(2,2)--cycle,grey); filldraw((1,3)--(1,4)--(2,4)--(2,3)--cycle,grey); filldraw((2,2)--(2,3)--(3,3)--(3,2)--cycle,grey); filldraw((4,0)--(4,1)--(5,1)--(5,0)--cycle,grey); filldraw((4,1)--(4,2)--(5,2)--(5,1)--cycle,grey); filldraw((4,2)--(4,3)--(5,3)--(5,2)--cycle,grey); filldraw((4,3)--(4,4)--(5,4)--(5,3)--cycle,grey); filldraw((5,1)--(5,2)--(6,2)--(6,1)--cycle,grey); filldraw((5,3)--(5,4)--(6,4)--(6,3)--cycle,grey); filldraw((6,2)--(6,3)--(7,3)--(7,2)--cycle,grey); filldraw((6,3)--(6,4)--(7,4)--(7,3)--cycle,grey); filldraw((8,3)--(8,4)--(9,4)--(9,3)--cycle,grey); filldraw((9,3)--(9,4)--(10,4)--(10,3)--cycle,grey); filldraw((10,3)--(10,4)--(11,4)--(11,3)--cycle,grey); filldraw((11,2)--(11,3)--(12,3)--(12,2)--cycle,grey); filldraw((11,3)--(11,4)--(12,4)--(12,3)--cycle,grey); filldraw((12,2)--(12,3)--(13,3)--(13,2)--cycle,grey); filldraw((12,3)--(12,4)--(13,4)--(13,3)--cycle,grey); filldraw((13,3)--(13,4)--(14,4)--(14,3)--cycle,grey); [/asy]

Let $p = (a_{1}, a_{2}, \ldots , a_{12})$ be a permutation of $1, 2, \ldots, 12$. We will denote \[S_{p} = |a_{1}-a_{2}|+|a_{2}-a_{3}|+\ldots+|a_{11}-a_{12}|\]We'll call $p$ $\textit{optimistic}$ if $a_{i} > \min(a_{i-1}, a_{i+1})$ $\forall i = 2, \ldots, 11$. $a)$ What is the maximum possible value of $S_{p}$. How many permutations $p$ achieve this maximum?$\newline$ $b)$ What is the number of $\textit{optimistic}$ permtations $p$? $c)$ What is the maximum possible value of $S_{p}$ for an $\textit{optimistic}$ $p$? How many $\textit{optimistic}$ permutations $p$ achieve this maximum?

Let $p>2$ be a prime number, $m>1$ and $n$ be positive integers such that $\frac {m^{pn}-1}{m^n-1}$ is a prime number. Show that: $$pn\mid (p-1)^n+1$$

$2010$ ships deliver bananas, lemons and pineapples from South America to Russia. The total number of bananas on each ship equals the number of lemons on all other ships combined, while the total number of lemons on each ship equals the total number of pineapples on all other ships combined. Prove that the total number of fruits is a multiple of $31$.

Find all functions $f$ from reals to reals which satisfy $f (f(x) + f(y)) = f(x^2) + 2x^2 f(y) + (f(y))^2$ for all real numbers $x$ and $y$.

Given isosceles $\triangle ABC$ with $AB = AC$ and $\angle BAC = 22^{\circ}$. On the side $BC$ point $D$ is chosen such that $BD = 2CD$. The foots of perpendiculars from $B$ to lines $AD$ and $AC$ are points $E$, $F$ respectively. Find with the proof value of the angle $\angle CEF$.

Four perpendiculars are drawn from four vertices of a convex pentagon to the opposite sides. If these four lines pass through the same point, prove that the perpendicular from the fifth vertex to the opposite side also passes through this point.

Given a triangle $PQR$, the inscribed circle $\omega$ which touches the sides $QR, RP$ and $PQ$ at points $A, B$ and $C$, respectively, and $AB^2 + AC^2 = 2BC^2$. Prove that the point of intersection of the segments $PA, QB$ and $RC$, the center of the circle $\omega$, the point of intersection of the medians of the triangle $ABC$, the point $A$ and the midpoints of the segments $AC$ and $AB$ lie on one circle.

a) Denote by $S(n)$ the sum of digits of a positive integer $n$. After the decimal point, we write one after the other the numbers $S(1),S(2),...$. Show that the number obtained is irrational. b) Denote by $P(n)$ the product of digits of a positive integer $n$. After the decimal point, we write one after the other the numbers $P(1),P(2),...$. Show that the number obtained is irrational.

Suppose $P(x,y)$ is a homogenous non-constant polynomial with real coefficients such that $P(\sin t, \cos t) = 1$ for all real $t$. Prove that $P(x,y) = (x^2+y^2)^k$ for some positive integer $k$. (A polynomial $A(x,y)$ with real coefficients and having a degree of $n$ is homogenous if it is the sum of $a_ix^iy^{n-i}$ for some real number $a_i$, for all integer $0 \le i \le n$.)

In the acute triangle $ABC$ point $I$ is the incenter, $O$ is the circumcenter, while $I_a$ is the excenter opposite the vertex $A$. Point $A'$ is the reflection of $A$ across the line $BC$. Prove that angles $\angle IOI_a$ and $\angle IA'I_a$ are equal.