Reduce the number $\sqrt[3]{2 +\sqrt5} + \sqrt[3]{2 -\sqrt5}$.

Let $C: y=x^2+ax+b$ be a parabola passing through the point $(1,\ -1)$. Find the minimum volume of the figure enclosed by $C$ and the $x$ axis by a rotation about the $x$ axis. Proposed by kunny

Let $n$ and $k$ be two integers with $n>k\geqslant 1$. There are $2n+1$ students standing in a circle. Each student $S$ has $2k$ [i]neighbors[/i] - namely, the $k$ students closest to $S$ on the left, and the $k$ students closest to $S$ on the right. Suppose that $n+1$ of the students are girls, and the other $n$ are boys. Prove that there is a girl with at least $k$ girls among her neighbors. [i]Proposed by Gurgen Asatryan, Armenia[/i]

Consider the expression $M(n, m)=|n\sqrt{n^2+a}-bm|$, where $n$ and $m$ are arbitrary positive integers and the numbers $a$ and $b$ are fixed, moreover $a$ is an odd positive integer and $b$ is a rational number with an odd denominator of its representation as an irreducible fraction. Prove that there is [b]a)[/b] no more than a finite number of pairs $(n, m)$ for which $M(n, m)=0$; [b]b)[/b] a positive constant $C$ such that the inequality $M(n, m)\geqslant0$ holds for all pairs $(n, m)$ with $M(n, m)\ne 0$.

[asy]draw((0,0)--(1,0)--(1,1)--(2,1)--(2,2)--(3,2)--(3,3)--(2,3)--(2,4)--(1,4)--(1,5)--(0,5)--(0,4)--(-1,4)--(-1,1)--(0,1)--cycle); draw((0,1)--(1,1)); draw((-1,2)--(2,2)); draw((-1,3)--(2,3)); draw((0,4)--(1,4)); draw((0,1)--(0,4)); draw((1,1)--(1,4)); draw((2,2)--(2,3)); draw((0,1)--(1,1)--(1,2)--(2,2)--(2,3)--(1,3)--(1,4)--(0,4)--cycle); draw((0,1)--(1,1)--(1,2)--(2,2)--(2,3)--(1,3)--(1,4)--(0,4)--cycle); draw((0,1)--(1,1)--(1,2)--(2,2)--(2,3)--(1,3)--(1,4)--(0,4)--cycle); draw((0,1)--(1,1)--(1,2)--(2,2)--(2,3)--(1,3)--(1,4)--(0,4)--cycle); draw((0,1)--(1,1)--(1,2)--(2,2)--(2,3)--(1,3)--(1,4)--(0,4)--cycle); draw((0,1)--(1,1)--(1,2)--(2,2)--(2,3)--(1,3)--(1,4)--(0,4)--cycle); label("H",(0.5,0.2),N); label("G",(1.5,1.2),N); label("F",(-0.5,1.2),N); label("E",(2.5,2.2),N); label("D",(-0.5,2.2),N); label("C",(1.5,3.2),N); label("B",(-0.5,3.2),N); label("A",(0.5,4.2),N);[/asy] Suppose one of the eight lettered identical squares is included with the four squares in the T-shaped figure outlined. How many of the resulting figures can be folded into a topless cubical box? \[ \textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6 \]

The sides $BC, CA$, and $AB$ of a triangle $ABC$ are tangent to a circle at points $X, Y, Z$ respectively. Show that the center of such a circle is on the line that passes through the midpoints of $BC$ and $AX$.

Let f be a function that satisfies the following conditions: $(i)$ If $x > y$ and $f(y) - y \geq v \geq f(x) - x$, then $f(z) = v + z$, for some number $z$ between $x$ and $y$. $(ii)$ The equation $f(x) = 0$ has at least one solution, and among the solutions of this equation, there is one that is not smaller than all the other solutions; $(iii)$ $f(0) = 1$. $(iv)$ $f(1987) \leq 1988$. $(v)$ $f(x)f(y) = f(xf(y) + yf(x) - xy)$. Find $f(1987)$. [i]Proposed by Australia.[/i]

Let $\Gamma_1$ and $\Gamma_2$ be the circles with diameters $AP$ and $AQ$. Let $T$ be another point of intersection of the circles $\Gamma_1$ and $\Gamma_2$. Let $Q_1$ be another point of intersection of the circle $\Gamma_1$ and the line $AQ$, and $P_1$ the other point of intersection of the circle $\Gamma_2$ and the line $AP$. The circle $\Gamma_3$ passes through the points $T$, $P$ and $P_1$ and the circle $\Gamma_4$ passes through the points $T$, $Q$ and $Q_1$. Prove that the line containing the common chord of the circles $\Gamma_3$ and $\Gamma_4$ passes through$A$.

Let $w, x, y, z$ be integers from $0$ to $3$ inclusive. Find the number of ordered quadruples of $(w, x, y, z)$ such that $5x^2 + 5y^2 + 5z^2 - 6wx-6wy -6wz$ is divisible by $4$. [i]Proposed by Timothy Qian[/i]

Starting with an empty string, we create a string by repeatedly appending one of the letters $H$, $M$, $T$ with probabilities $\frac 14$, $\frac 12$, $\frac 14$, respectively, until the letter $M$ appears twice consecutively. What is the expected value of the length of the resulting string?

Through what net angle does the disk turn during the $3$ seconds? (A) $\text{9 rad}$. (B) $\text{8 rad}$. (C) $\text{6 rad}$. (D) $\text{4 rad}$. (E) $\text{3 rad}$.

Find the largest positive real $ k$, such that for any positive reals $ a,b,c,d$, there is always: \[ (a\plus{}b\plus{}c) \left[ 3^4(a\plus{}b\plus{}c\plus{}d)^5 \plus{} 2^4(a\plus{}b\plus{}c\plus{}2d)^5 \right] \geq kabcd^3\]

For every positive integer $n$ determine the least possible value of the expression \[|x_{1}|+|x_{1}-x_{2}|+|x_{1}+x_{2}-x_{3}|+\dots +|x_{1}+x_{2}+\dots +x_{n-1}-x_{n}|\] given that $x_{1}, x_{2}, \dots , x_{n}$ are real numbers satisfying $|x_{1}|+|x_{2}|+\dots+|x_{n}| = 1$.

Point $K$ is marked on the diagonal $AC$ in rectangle $ABCD$ so that $CK = BC$. On the side $BC$, point $M$ is marked so that $KM = CM$. Prove that $AK + BM = CM$.

Two pirates divide the loot, consisting of two bags of coins and a diamond, according to the following rules. First the first pirate takes take a few coins from any bag and transfer them from this bag in the other the same number of coins. Then the second pirate does the same (choosing the bag from which he takes the coins at his discretion) and etc. until you can take coins according to these rules. The pirate who takes the coins last gets the diamond. Who will get the diamond if is each of the pirates trying to get it? Give your answer depending on the initial number of coins in the bags.

Let $x,y,z,w$ be integers such that $2^x+2^y+2^z+2^w=24.375$. Find the value of $xyzw$.

Find the sum of all possible sums $a + b$ where $a$ and $b$ are nonnegative integers such that $4^a + 2^b + 5$ is a perfect square.

Suppose $\overline{a_1a_2...a_{2009}}$ is a $2009$-digit integer such that for each $i = 1,2,...,2007$, the $2$-digit integer $\overline{a_ia_{i+1}}$ contains $3$ distinct prime factors. Find $a_{2008}$ (Note: $\overline{xyz...}$ denotes an integer whose digits are $x, y,z,...$.)

Let $ABC$ be an acute-angled triangle with the property that the bisector of $\angle BAC$, the altitude through $B$ and the perpendicular bisector of $AB$ intersect in one point. Determine the angle $\alpha = \angle BAC$.

A teacher and her 30 students play a game on an infinite cell grid. The teacher starts first, then each of the 30 students makes a move, then the teacher and so on. On one move the person can color one unit segment on the grid. A segment cannot be colored twice. The teacher wins if, after the move of one of the 31 players, there is a $1\times 2$ or $2\times 1$ rectangle , such that each segment from it's border is colored, but the segment between the two adjacent squares isn't colored. Prove that the teacher can win.

On the coordinate plane, draw a set of points whose coordinates $(x, y)$ satisfy the inequality $$2 arc \cos x \ge arc \cos y$$

Given are 100 different positive integers. We call a pair of numbers [i]good[/i] if the ratio of these numbers is either 2 or 3. What is the maximum number of good pairs that these 100 numbers can form? (A number can be used in several pairs.) [i]Proposed by Alexander S. Golovanov, Russia[/i]

Determine the maximum number $ h$ satisfying the following condition: for every $ a\in [0,h]$ and every polynomial $ P(x)$ of degree 99 such that $ P(0)\equal{}P(1)\equal{}0$, there exist $ x_1,x_2\in [0,1]$ such that $ P(x_1)\equal{}P(x_2)$ and $ x_2\minus{}x_1\equal{}a$. [i]Proposed by F. Petrov, D. Rostovsky, A. Khrabrov[/i]

I have a very good solution of this but I want to see others. Let the midpoint$ M$ of the side$ AB$ of an inscribed quardiletar, $ABCD$.Let$ P $the point of intersection of $MC$ with $BD$. Let the parallel from the point $C$ to the$ AP$ which intersects the $BD$ at$ S$. If $CAD$ angle=$PAB$ angle= $\frac{BMC}{2}$ angle, prove that $BP=SD$.

We are given $30$ boots standing in a row, $15$ of which are for right feet and $15$ for the left. Prove that there are ten successive boots somewhere in this row with $5$ right and $5$ left boots among them. (D. Fomin, Leningrad)