Let $n$ be an integer, $n \ge 2$. Find the remainder of the division of the number $n(n + 1)(n + 2)$ by $n - 1$.

Streets of Moscow are some circles (rings) with common center $O$ and some straight lines from center $O$ to external ring. Point $A,B$ - two crossroads on external ring. Three friends want to move from $A$ to $B$. Dima goes by external ring, Kostya goes from $A$ to $O$ then to $B$. Sergey says, that there is another way, that is shortest. Prove, that he is wrong.

Find all functions $f: \mathbb{R}\to\mathbb{R}$ that satidfy : $$2f(x+y+xy)= a f(x)+ bf(y)+f(xy)$$ for any $x,y \in\mathbb{R}$ όπου $a,b\in\mathbb{R}$ with $a^2-a\ne b^2-b$

PUMaCDonalds, a newly-opened fast food restaurant, has 5 menu items. If the first 4 customers each choose one menu item at random, the probability that the 4th customer orders a previously unordered item is $m/n$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Find a $10$-digit number, in which no digit is zero, that is divisible by the sum of their digits.

A circle is drawn on the board, and $2n$ points are marked on it, dividing it into $2n$ equal arcs. Petya and Vasya are playing the following game. Petya chooses a positive integer $d \leqslant n$ and announces this number to Vasya. To win the game, Vasya needs to color all marked points using $n$ colors, such that each color is assigned to exactly two points, and for each pair of same-colored points, one of the arcs between them contains exactly $(d - 1)$ marked points. Find all $n$ for which Petya will be able to prevent Vasya from winning.

Find all integers $n$ such that $2^n + n^2$ is a square of an integer. [i](Tomas Jurik )[/i]

Let $f:[0,\infty)\to\mathbb R$ be a differentiable function with $|f(x)|\le M$ and $f(x)f'(x)\ge\cos x$ for $x\in[0,\infty)$, where $M>0$. Prove that $f(x)$ does not have a limit as $x\to\infty$.

In triangle $\vartriangle ABC$, we have marked points $A_1$ on side $BC, B_1$ on side $AC$, and $C_1$ on side $AB$ so that $AA_1$ is an altitude, $BB_1$ is a median, and $CC_1$ is an angle bisector. It is known that $\vartriangle A_1B_1C_1$ is equilateral. Prove that $\vartriangle ABC$ is equilateral too. (Note: A median connects a vertex of a triangle with the midpoint of the opposite side. Thus, for median $BB_1$ we know that $B_1$ is the midpoint of side $AC$ in $\vartriangle ABC$.)

Does there exist an integer $A$ such that each of the ten digits $0, 1, . . . , 9$ appears exactly once as a digit in exactly one of the numbers $A, A^2, A^ 3$ ?

A positive integer $N$ is called [i]balanced[/i], if $N=1$ or if $N$ can be written as a product of an even number of not necessarily distinct primes. Given positive integers $a$ and $b$, consider the polynomial $P$ defined by $P(x)=(x+a)(x+b)$. (a) Prove that there exist distinct positive integers $a$ and $b$ such that all the number $P(1)$, $P(2)$,$\ldots$, $P(50)$ are balanced. (b) Prove that if $P(n)$ is balanced for all positive integers $n$, then $a=b$. [i]Proposed by Jorge Tipe, Peru[/i]

A large square region is paved with $n^2$ gray square tiles, each measuring $s$ inches on a side. A border $d$ inches wide surrounds each tile. The figure below shows the case for $n = 3$. When $n = 24$, the $576$ gray tiles cover $64\%$ of the area of the large square region. What is the ratio $\frac{d}{s}$ for this larger value of $n$? [asy] draw((0,0)--(13,0)--(13,13)--(0,13)--cycle); filldraw((1,1)--(4,1)--(4,4)--(1,4)--cycle, mediumgray); filldraw((1,5)--(4,5)--(4,8)--(1,8)--cycle, mediumgray); filldraw((1,9)--(4,9)--(4,12)--(1,12)--cycle, mediumgray); filldraw((5,1)--(8,1)--(8,4)--(5,4)--cycle, mediumgray); filldraw((5,5)--(8,5)--(8,8)--(5,8)--cycle, mediumgray); filldraw((5,9)--(8,9)--(8,12)--(5,12)--cycle, mediumgray); filldraw((9,1)--(12,1)--(12,4)--(9,4)--cycle, mediumgray); filldraw((9,5)--(12,5)--(12,8)--(9,8)--cycle, mediumgray); filldraw((9,9)--(12,9)--(12,12)--(9,12)--cycle, mediumgray); [/asy] $\textbf{(A) }\frac6{25} \qquad \textbf{(B) }\frac14 \qquad \textbf{(C) }\frac9{25} \qquad \textbf{(D) }\frac7{16} \qquad \textbf{(E) }\frac9{16}$

Let $A_1A_2A_3A_4$ and $B_1B_2B_3B_4$ be two squares such that the boundaries of $A_1A_2A_3A_4$ and $B_1B_2B_3B_4$ does not contain any line segment. Construct 16 line segments $A_iB_j$ for each possible $i,j \in \{1,2,3,4\}$. What is the maximum number of line segments that don't intersect the edges of $A_1A_2A_3A_4$ or $B_1B_2B_3B_4$? (intersection with a vertex is not counted). [i]Proposed by Allen Zheng[/i]

Let $a$ be a real number, $a>1.$ Find the real numbers $b \ge 1$ such that $$\lim_{x \to \infty} \int\limits_0^x (1+t^a)^{-b} \mathrm{d}t=1.$$

Consider $13$ weights of integer mass (in grams). It is known that any $6$ of them may be placed onto two pans of a balance achieving equilibrium. Prove that all the weights are of equal mass.

Let $ABCD$ be a quadrilateral inscribed in a circle $\omega$, and let $P$ be a point on the extension of $AC$ such that $PB$ and $PD$ are tangent to $\omega$. The tangent at $C$ intersects $PD$ at $Q$ and the line $AD$ at $R$. Let $E$ be the second point of intersection between $AQ$ and $\omega$. Prove that $B$, $E$, $R$ are collinear.

Let $ \alpha < \frac {3 \minus{} \sqrt {5}}{2}$ be a positive real number. Prove that there exist positive integers $ n$ and $ p > \alpha \cdot 2^n$ for which one can select $ 2 \cdot p$ pairwise distinct subsets $ S_1, \ldots, S_p, T_1, \ldots, T_p$ of the set $ \{1,2, \ldots, n\}$ such that $ S_i \cap T_j \neq \emptyset$ for all $ 1 \leq i,j \leq p$ [i]Author: Gerhard Wöginger, Austria[/i]

Find the number of ordered pairs of integers $(m,n)$ with $0 \le m,n \le 22$ such that $k^2+mk+n$ is not a multiple of $23$ for all integers $k.$

The Duke of Squares left to his three sons a square estate, $100\times 100$ square miles, made up of ten thousand $1\times 1$ square mile square plots. The whole estate was divided among his sons as follows. Each son was assigned a point inside the estate. A $1\times 1$ square plot was bequeathed to the son whose assigned point was closest to the center of this square plot. Is it true that, irrespective of the choice of assigned points, each of the regions bequeathed to the sons is connected (that is, there is a path between every two of its points, never leaving the region)?

Let $f: \mathbb{N} \to \mathbb{N}$ be a function that satisfies: \[ f(1) = 2008, \] \[ f(4n^2) = 4f(n^2), \] \[ f(4n^2 + 2) = 4f(n^2) + 3, \] \[ f(4n(n+1)) = 4f(n(n+1)) + 1, \] \[ f(4n(n+1) + 3) = 4f(n(n+1)) + 4. \] Determine whether there exists a natural number $m$ such that: \[ 1^2 + 2^2 + \dots + m^2 + f(1^2) + \dots + f(m^2) = 2008m + 251. \]

Evaluate \[\int_{\frac{\pi}{4}}^{\frac{\pi}{2}} \frac{(1+\cos x)\{1-\tan ^ 2 \frac{x}{2}\tan (x+\sin x)\tan (x-\sin x)\}}{\tan (x+\sin x)}\ dx\]

[asy] import olympiad; import cse5; size(5cm); pointpen = black; pair A = Drawing((10,17.32)); pair B = Drawing((0,0)); pair C = Drawing((20,0)); draw(A--B--C--cycle); pair X = 0.85*A + 0.15*B; pair Y = 0.82*A + 0.18*C; pair W = (-11,0) + X; pair Z = (19, 9); draw(W--X, EndArrow); draw(X--Y, EndArrow); draw(Y--Z, EndArrow); anglepen=black; anglefontpen=black; MarkAngle("\theta", C,Y,Z, 3); [/asy] The cross-section of a prism with index of refraction $1.5$ is an equilateral triangle, as shown above. A ray of light comes in horizontally from air into the prism, and has the opportunity to leave the prism, at an angle $\theta$ with respect to the surface of the triangle. Find $\theta$ in degrees and round to the nearest whole number. [i](Ahaan Rungta, 5 points)[/i]

If $a, b, c$, and $d$ are pairwise distinct positive integers that satisfy $lcm (a, b, c, d) < 1000$ and $a+b = c+d$, compute the largest possible value of $a + b$.

You are given $25$ pieces of cheese of different weights. Is it always possible to cut one of the pieces into two parts and put the $26$ pieces in two packets so that $\bullet$ each packet contains $13$ pieces; $\bullet$ the total weights of the two packets are equal; $\bullet$ the two parts of the piece which has been cut are in different packets? (VL Dolnikov)

For arbitrary pairwise distinct positive real numbers $a, b, c$, prove the inequality $$\frac{(a^2- b^2)^3 + (b^2-c^2)^3+(c^2-a^2)^3}{(a- b)^3 + (b-c)^3+(c-a)^3}> 8abc$$