Find all functions $f$ from the reals to the reals such that \[f\left(f(x)+y\right)=2x+f\left(f(y)-x\right)\] for all real $x,y$.

Let $p$ be an odd prime integer and $k$ a positive integer not divisible by $p$, $1\le k<2(p+1)$, and let $N=2kp+1$. Prove that the following statements are equivalent: (i) $N$ is a prime number (ii) there exists a positive integer $a$, $2\le a<n$, such that $a^{kp}+1$ is divisible by $N$ and $\gcd\left(a^k+1,N\right)=1$.

We divide a convex $2009$-gon in triangles using non-intersecting diagonals. One of these diagonals is colored green. It is allowed the following operation: for two triangles $ABC$ and $BCD$ from the dividing/separating with a common side $BC$ if the replaced diagonal was green it loses its color and the replacing diagonal becomes green colored. Prove that if we choose any diagonal in advance it can be colored in green after applying the operation described finite number of times.

Michael walks at the rate of $ 5$ feet per second on a long straight path. Trash pails are located every $ 200$ feet along the path. A garbage truck travels at $ 10$ feet per second in the same direction as Michael and stops for $ 30$ seconds at each pail. As Michael passes a pail, he notices the truck ahead of him just leaving the next pail. How many times will Michael and the truck meet? $ \textbf{(A)}\ 4\qquad \textbf{(B)}\ 5\qquad \textbf{(C)}\ 6\qquad \textbf{(D)}\ 7\qquad \textbf{(E)}\ 8$

Convex pentagon $ABCDE$ has side lengths $AB=5$, $BC=CD=DE=6$, and $EA=7$. Moreover, the pentagon has an inscribed circle (a circle tangent to each side of the pentagon). Find the area of $ABCDE$.

Let $a = \sqrt[401]{4} - 1$ and for each $n \ge 2$, let $b_n = \binom{n}{1} + \binom{n}{2} a + \ldots + \binom{n}{n} a^{n-1}$. Find $b_{2006} - b_{2005}$.

Given a positive integer $ n$, for all positive integers $ a_1, a_2, \cdots, a_n$ that satisfy $ a_1 \equal{} 1$, $ a_{i \plus{} 1} \leq a_i \plus{} 1$, find $ \displaystyle \sum_{i \equal{} 1}^{n} a_1a_2 \cdots a_i$.

Phoenix is counting positive integers starting from $1$. When he counts a perfect square greater than $1$, he restarts at $1$, skipping that square the next time. For example, the first $10$ numbers Phoenix counts are $1$, $2$, $3$, $4$, $1$, $2$, $3$, $5$, $6$, $7$, $...$ How many numbers will Phoenix have counted after counting 1$00$ for the first time?

Let there be an acute triangle $ABC$ with orthocenter $H$. Let $BH, CH$ hit the circumcircle of $\triangle ABC$ at $D, E$. Let $P$ be a point on $AB$, between $B$ and the foot of the perpendicular from $C$ to $AB$. Let $PH \cap AC = Q$. Now $\triangle AEP$'s circumcircle hits $CH$ at $S$, $\triangle ADQ$'s circumcircle hits $BH$ at $R$, and $\triangle AEP$'s circumcircle hits $\triangle ADQ$'s circumcircle at $J (\not=A)$. Prove that $RS$ is the perpendicular bisector of $HJ$.

In the plane, there is an acute angle $\angle AOB$ . Inside the angle points $C$ and $D$ are chosen so that $\angle AOC = \angle DOB$. From point $D$ the perpendicular on $OA$ intersects the ray $OC$ at point $G$ and from point C the perpendicular on $OB$ intersects the ray $OD$ at point $H$. Prove that the points $C, D, G$ and $H$ are conlyclic.

Vitya and Masha are playing a game. At first, Vitya thinks of three different integers. In one move Masha can ask one of the following three numbers: the sum of the numbers, the product of the numbers or the sum of pairwise products of the numbers. Masha asks questions and Vitya immediately answers before Masha asks the next question. a) Prove that Masha can always guess Vitya's numbers. b) What is the least amount of questions Masha needs to ask to guaranteely guess them?

A natural number $n$ is written on a board. On every step, Neneng and Asep changes the number on the board with the following rule: Suppose the number on the board is $X$. Initially, Neneng chooses the sign up or down. Then, Asep will pick a positive divisor $d$ of $X$, and replace $X$ with $X+d$ if Neneng chose the sign "up" or $X-d$ if Neneng chose "down". This procedure is then repeated. Asep wins if the number on the board is a nonzero perfect square, and loses if at any point he writes zero. Prove that if $n \geq 14$, Asep can win in at most $(n-5)/4$ steps.

Estimate the value of $e^f$ , where $f = e^e$ .

$32$ knights live in a kingdom. Some of them are servants of others. A servant may have only one master and any master is more wealthy than any of his servants. A knight having not less than $4$ servants is called a baron. What is the maximum number of barons? (The kingdom is ruled by the law: “My servant’s servant is not my servant”. (A. Tolpygo, Kiev)

The number $ \left (2+2^{96} \right )!$ has $2^{93}$ trailing zeroes when expressed in base $B$. [b] a)[/b] Find the minimum possible $B$. [b]b)[/b] Find the maximum possible $B$. [b]c)[/b] Find the total number of possible $B$. [i]Proposed by Lewis Chen[/i]

Givan the set $S = \{1,2,3,....,n\}$. We want to partition the set $S$ into three subsets $A,B,C$ disjoint (to each other) with $A\cup B\cup C=S$ , such that the sums of their elements $S_{A} S_{B} S_{C}$ to be equal .Examine if this is possible when: a) $n=2014$ b) $n=2015 $ c) $n=2018$

We have an infinite sequence of integers $\{x_n\}$, such that $x_1 = 1$, and, for all $n \ge 1$, it holds that $x_n < x_{n+1} \le 2n$. Prove that there are two terms of the sequence,$ x_r$ and $x_s$, such that $x_r - x_s = 2018$.

For how many primes $p$, $|p^4-86|$ is also prime? $\textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 2 \qquad\textbf{(D)}\ 3 \qquad\textbf{(E)}\ 4$

Assume $a_1,a_2,...,a_{14}$ are positive integers such that $\sum_{i=1}^{14}3^{a_i} = 6558$. Prove that the numbers $a_1,a_2,...,a_{14}$ consist of the numbers $1,...,7$, each taken twice.

Yannick has a bicycle lock with a $4$-digit passcode whose digits are between $0$ and $9$ inclusive. (Leading zeroes are allowed.) The dials on the lock is currently set at $0000$. To unlock the lock, every second he picks a contiguous set of dials, and increases or decreases all of them by one, until the dials are set to the passcode. For example, after the first second the dials could be set to $1100$, $0010$, or $9999$, but not $0909$ or $0190$. (The digits on each dial are cyclic, so increasing $9$ gives $0$, and decreasing $0$ gives $9$.) Let the complexity of a passcode be the minimum number of seconds he needs to unlock the lock. What is the maximum possible complexity of a passcode, and how many passcodes have this maximum complexity? Express the two answers as an ordered pair.

Given is an acute triangle $ABC$ with $AB<AC$ with altitudes $BD$ and $CE$. Let the tangents to the circumcircle at $B$ and $C$ meet at $Y$. Let $\omega_1$ be the circle through $A$ tangent to $DE$ at $E$; define $\omega_2$ similarly, and let their intersection point be $X$. Prove that $A, X, Y$ are colinear. $\textit{Proposed by Nikola Velov}$

On a circle $\omega_1$, four points $A$, $C$, $B$, $D$ lie in that order. Prove that $CD^2 = AC \cdot BC + AD \cdot BD$ if and only if at least one of $C$ and $D$ is the midpoint of arc $AB$.

Let $C$ be the coefficient of $x^2$ in the expansion of the product \[(1 - x)(1 + 2x)(1 - 3x)\cdots(1 + 14x)(1 - 15x).\] Find $|C|$.

Let $a,b$ be the smaller sides of a right triangle. Let $c$ be the hypothenuse and $h$ be the altitude from the right angle. Fint the maximal value of $\frac{c+h}{a+b}$.

Consider the sequence $p_{1},p_{2},...$ of primes such that for each $i\geq2$, either $p_{i}=2p_{i-1}-1$ or $p_{i}=2p_{i-1}+1$. Show that any such sequence has a finite number of terms.