Find all continuous functions $f: R \to R$ such that for all reals $x$ and $y$, $f(x+f(y)) = y+f(x+1)$.

What is the units digit of $2013^{2013}$?

Given a set of $1997$ numbers such that if each number in the set, replace with the sum of the rest, you get the same set. Prove that the product of numbers in the set is equal to $0$.

Find all real polynomials $ f$ with $ x,y \in \mathbb{R}$ such that \[ 2 y f(x \plus{} y) \plus{} (x \minus{} y)(f(x) \plus{} f(y)) \geq 0. \]

Let $H$ be the orthocenter of an acute triangle $ABC,$ and let $A_1, \: B_1, \: C_1$ be the feet of the altitudes belonging to the vertices $A, \: B, \: C,$ respectively. Let $K$ be a point on the smaller $AB_1$ arc of the circle with diameter $AB$ satisfying the condition $\angle HKB = \angle C_1KB.$ Let $M$ be the point of intersection of the line segment $AA_1$ and the circle with center $C$ and radius $CL$ where $KB \cap CC_1=\{L\}.$ Let $P$ and $Q$ be the points of intersection of the line $CC_1$ and the circle with center $B$ and radius $BM.$ Show that $A, \: K, \: P, \: Q$ are concyclic.

Equilateral triangles $ABF$ and $BCG$ are constructed outside regular pentagon $ABCDE.$ Compute $\angle{FEG}.$

The sequence of polynomials $\left( P_{n}(X)\right)_{n\in Z_{>0}}$ is defined as follows: $P_{1}(X)=2X$ $P_{2}(X)=2(X^2+1)$ $P_{n+2}(X)=2X\cdot P_{n+1}(X)-(X^2-1)P_{n}(X)$, for all positive integers $n$. Find all $n$ for which $X^2+1\mid P_{n}(X)$

Call an $n$-digit integer with distinct digits [i]mountainous [/i]if, for some integer $1 \le k \le n$, the first $k$ digits are in strictly ascending order and the following $n - k$ digits are in strictly descending order. How many $5$-digit mountainous integers with distinct digits are there?

A semicircle of radius $5$ and a quarter of a circle of radius $8$ touch each other and are located inside the square as shown in the figure. Find the length of the part of the common tangent, enclosed in the same square. [img]https://cdn.artofproblemsolving.com/attachments/f/2/010f501a7bc1d34561f2fe585773816f168e93.png[/img]

There are $n$ boyfriend-girlfriend pairs at a party. Initially all the girls sit at a round table. For the first dance, each boy invites one of the girls to dance with.After each dance, a boy takes the girl he danced with to her seat, and for the next dance he invites the girl next to her in the counterclockwise direction. For which values of $n$ can the girls be selected in such a way that in every dance at least one boy danced with his girlfriend, assuming that there are no less than $n$ dances?

$F_1,F_2$ are two focal points of ellipse $\frac{x^2}{9}+\frac{y^2}{4}=1$, $P$ is a point on the ellipse, and $|PF_1|:|PF_2|=2:1$, then the area of $\triangle PF_1F_2$ is________.

Let $A$ be a set of $n\ge3$ points in the plane, no three of which are collinear. Show that there is a set $S$ of $2n-5$ points in the plane such that, for each triangle with vertices in $A$, there exists a point in $S$ which is strictly inside that triangle.

The following analog clock has two hands that can move independently of each other. [asy] unitsize(2cm); draw(unitcircle,black+linewidth(2)); for (int i = 0; i < 12; ++i) { draw(0.9*dir(30*i)--dir(30*i)); } for (int i = 0; i < 4; ++i) { draw(0.85*dir(90*i)--dir(90*i),black+linewidth(2)); } for (int i = 0; i < 12; ++i) { label("\small" + (string) i, dir(90 - i * 30) * 0.75); } draw((0,0)--0.6*dir(90),black+linewidth(2),Arrow(TeXHead,2bp)); draw((0,0)--0.4*dir(90),black+linewidth(2),Arrow(TeXHead,2bp)); [/asy] Initially, both hands point to the number 12. The clock performs a sequence of hand movements so that on each movement, one of the two hands moves clockwise to the next number on the clock while the other hand does not move. Let $N$ be the number of sequences of 144 hand movements such that during the sequence, every possible positioning of the hands appears exactly once, and at the end of the 144 movements, the hands have returned to their initial position. Find the remainder when $N$ is divided by 1000.

Let $ABCDE$ be a pentagon with $\hat{A}=\hat{B}=\hat{C}=\hat{D}=120^{\circ}$. Prove that $4\cdot AC \cdot BD\geq 3\cdot AE \cdot ED$.

Let $m$ and $n$ be two natural numbers and let $d = gcd (m, n)$ their greatest common divisor. Let $a_1, a_2,...$ and $b_1, b_2, ...$ be two sequences of integers which are periodic with periods $m$ and $n$ respectively (this means that $a_{i + m} = a_i$ and $b_{i + n} = b_i$ for all natural numbers $i \ge 1$, note that there could be smaller periods). Prove that if the two sequences on the first $m + n - d$ terms match (i.e. $a_i = b_i$ for all $i \in \{1, 2, ..., m + n - d\}$), then they are the same (so $a_i = b_i$ for all natural $i \ge 1$).

Given a polynomial $P(x)$ with real coefficents satisfying:$$P(x).P(x+1)=P(x^2+x+1),\forall x\in \mathbb{R}.$$ Prove that: $\deg(P)$ is an even number and find $P(x).$

A beam of light strikes $\overline{BC}$ at point $C$ with angle of incidence $\alpha=19.94^\circ$ and reflects with an equal angle of reflection as shown. The light beam continues its path, reflecting off line segments $\overline{AB}$ and $\overline{BC}$ according to the rule: angle of incidence equals angle of reflection. Given that $\beta=\alpha/10=1.994^\circ$ and $AB=AC,$ determine the number of times the light beam will bounce off the two line segments. Include the first reflection at $C$ in your count. [asy] size(250);defaultpen(linewidth(0.7)); real alpha=24, beta=32; pair B=origin, C=(1,0), A=dir(beta), D=C+0.5*dir(alpha); pair EE=2*dir(180-alpha), E=intersectionpoint(C--EE, A--B); pair EEE=reflect(B,A)*EE, EEEE=reflect(C,B)*EEE, F=intersectionpoint(E--EEE, B--C), G=intersectionpoint(F--EEEE, A--B); draw((1.4,0)--B--1.4*dir(beta)); draw(D--C, linetype("4 4"),EndArrow(5)); draw(C--E, linetype("4 4"),EndArrow(5)); draw(E--F, linetype("4 4"),EndArrow(5)); draw(F--G, linetype("4 4"),EndArrow(5)); markscalefactor=0.01; draw(anglemark(C,B,A)); draw(anglemark((1.4,0), C,D)); label("$\beta$", 0.07*dir(beta/2), dir(beta/2), fontsize(10)); label("$\alpha$", C+0.07*dir(alpha/2), dir(alpha/2), fontsize(10)); label("$A$", A, dir(90)*dir(A)); label("$B$", B, dir(beta/2+180)); label("$C$", C, S);[/asy]