Let nonnegative real numbers $ a_{1},a_{2},a_{3},a_{4}$ satisfy $ a_{1} \plus{} a_{2} \plus{} a_{3} \plus{} a_{4} \equal{} 1.$ Prove that $ max\{\sum_{1}^4{\sqrt {a_{i}^2 \plus{} a_{i}a_{i \minus{} 1} \plus{} a_{i \minus{} 1}^2 \plus{} a_{i \minus{} 1}a_{i \minus{} 2}}},\sum_{1}^4{\sqrt {a_{i}^2 \plus{} a_{i}a_{i \plus{} 1} \plus{} a_{i \plus{} 1}^2 \plus{} a_{i \plus{} 1}a_{i \plus{} 2}}}\}\ge 2.$ Where for all integers $ i, a_{i \plus{} 4} \equal{} a_{i}$ holds.

The parallel sides of a trapezoid are $ 3$ and $ 9$. The non-parallel sides are $ 4$ and $ 6$. A line parallel to the bases divides the trapezoid into two trapezoids of equal perimeters. The ratio in which each of the non-parallel sides is divided is: [asy]defaultpen(linewidth(.8pt)); unitsize(2cm); pair A = origin; pair B = (2.25,0); pair C = (2,1); pair D = (1,1); pair E = waypoint(A--D,0.25); pair F = waypoint(B--C,0.25); draw(A--B--C--D--cycle); draw(E--F); label("6",midpoint(A--D),NW); label("3",midpoint(C--D),N); label("4",midpoint(C--B),NE); label("9",midpoint(A--B),S);[/asy]$ \textbf{(A)}\ 4: 3\qquad \textbf{(B)}\ 3: 2\qquad \textbf{(C)}\ 4: 1\qquad \textbf{(D)}\ 3: 1\qquad \textbf{(E)}\ 6: 1$

$T$ is a point on the plane of triangle $ABC$ such that $\angle ATB = \angle BTC = \angle CTA = 120^\circ$. Prove that the lines symmetric to $AT, BT$ and $CT$ with respect to $BC, CA$ and $AB$, respectively, are concurrent.

There are $2015$ distinct circles in a plane, with radius $1$. Prove that you can select $27$ circles, which form a set $C$, which satisfy the following. For two arbitrary circles in $C$, they intersect with each other or For two arbitrary circles in $C$, they don't intersect with each other.

Solve for $z\in \mathbb{C}$ the equation : \[ |z-|z+1||=|z+|z-1|| \]

Triangle $ABC$ has side lengths $13$, $14$ and $15$. Let $k, k_A,k_B,k_C$ be four circles of radius $ r$ inside the triangle such that $k_A$ is tangent to sides $AB$ and $AC$, $k_B$ is tangent to sides $BA$ and $BC$, $k_C$ is tangent to sides $CA$ and $CB$, and $k$ is externally tangent to circles $k_A$, $k_B$ and $k_C$. Let $r = m/n$ where $m$ and $n$ are coprime. Find $m + n$.

Let $\vartriangle ABC$ be a triangle in which $\angle ACB = 40^o$ and $\angle BAC = 60^o$ . Let $D$ be a point inside the segment $BC$ such that $CD =\frac{AB}{2}$ and let $M$ be the midpoint of the segment $AC$. How much is the angle $\angle CMD$ in degrees?

In a sequence $P_n$ of quadratic trinomials each trinomial, starting with the third, is the sum of the two preceding trinomials. The first two trinomials do not have common roots. Is it possible that $P_n$ has an integral root for each $n$?

Determine all pairs of integers $(x,y)$ satisfying the equation $$x^3 +x^2y+xy^2 +y^3 = 8(x^2 +xy+y^2 +1).$$

Let $ d$ be the sum of the lengths of all the diagonals of a plane convex polygon with $ n$ vertices (where $ n>3$). Let $ p$ be its perimeter. Prove that: \[ n\minus{}3<{2d\over p}<\Bigl[{n\over2}\Bigr]\cdot\Bigl[{n\plus{}1\over 2}\Bigr]\minus{}2,\] where $ [x]$ denotes the greatest integer not exceeding $ x$.

How many numbers between $ 1$ and $ 2005$ are integer multiples of $ 3$ or $ 4$ but not $ 12$? $ \textbf{(A)}\ 501\qquad \textbf{(B)}\ 668\qquad \textbf{(C)}\ 835\qquad \textbf{(D)}\ 1002\qquad \textbf{(E)}\ 1169$

If $N$ is the number of triangles of different shapes (i.e., not similar) whose angles are all integers (in degrees), what is $\frac{N}{100}$?

The distance light travels in one year is approximately $ 5,870,000,000,000$ miles. The distance light travels in $ 100$ years is: $ \textbf{(A)}\ 587 * 10^8 \text{ miles} \qquad\textbf{(B)}\ 587 * 10^{10} \text{ miles} \qquad\textbf{(C)}\ 587*10^{ \minus{} 10} \text{ miles}$ $ \textbf{(D)}\ 587 * 10^{12} \text{ miles} \qquad\textbf{(E)}\ 587* 10^{ \minus{} 12} \text{ miles}$

Find the smallest positive integer $n$ with the following property: if we write down all positive integers from $1$ to $10^n$ and add together the reciprocals of every non-zero digit written down, we obtain an integer.

Suppose two convex quadrangles are such that the sides of each of them lie on the perpendicular bisectors of the sides of the other one. Determine their angles,

A single player game has the following rules: initially, there are $10$ piles of stones with $1,2,...,10$ stones, respectively. A movement consists on making one of the following operations: [b]i)[/b] to choose $2$ piles, both of them with at least $2$ stones, combine them and then add $2$ stones to the new pile; [b]ii)[/b] to choose a pile with at least $4$ stones, remove $2$ stones from it, and then split it into two piles with amount of piles to be chosen by the player. The game continues until is not possible to make an operation. Show that the number of piles with one stone in the end of the game is always the same, no matter how the movements are made.

For arbitrary positive reals $a\ge b \ge c$ prove the inequality: $$\frac{a^2+b^2}{a+b}+\frac{a^2+c^2}{a+c}+\frac{c^2+b^2}{c+b}\ge (a+b+c)+ \frac{(a-c)^2}{a+b+c}$$ (Anton Trygub)

Two real numbers $x$ and $y$ are such that $8y^4+4x^2y^2+4xy^2+2x^3+2y^2+2x=x^2+1$. Find all possible values of $x+2y^2$

Derek and Jacob have a cake in the shape a rectangle with dimensions $14$ inches by $9$ inches. They make a deal to split it: Derek takes home the portion of the cake that is less than one inch from the border, while Jacob takes home the remainder of the cake. Let $D : J$ be the ratio of the amount of cake Derek took to the amount of cake Jacob took, where $D$ and $J$ are relatively prime positive integers. Find $D + J$.

The function $f$ is given by the table \[\begin{array}{|c||c|c|c|c|c|}\hline x & 1 & 2 & 3 & 4 & 5 \\ \hline f(x) & 4 & 1 & 3 & 5 & 2 \\ \hline \end{array}\] If $u_0=4$ and $u_{n+1}=f(u_n)$ for $n\geq 0$, find $u_{2002}$. $\textbf{(A) }1\qquad\textbf{(B) }2\qquad\textbf{(C) }3\qquad\textbf{(D) }4\qquad\textbf{(E) }5$

Let $ABC$ be a triangle with $\angle A = 60^\circ$. The point $T$ lies inside the triangle in such a way that $\angle ATB = \angle BTC = \angle CTA = 120^\circ$. Let $M$ be the midpoint of $BC$. Prove that $TA + TB + TC = 2AM$.

For each positive integer $k,$ let $A(k)$ be the number of odd divisors of $k$ in the interval $\left[1,\sqrt{2k}\right).$ Evaluate: \[\sum_{k=1}^{\infty}(-1)^{k-1}\frac{A(k)}k.\]

MO Space City plans to construct $n$ space stations, with a unidirectional pipeline connecting every pair of stations. A station directly reachable from station P without passing through any other station is called a directly reachable station of P. The number of stations jointly directly reachable by the station pair $\{P, Q\}$ is to be examined. The plan requires that all station pairs have the same number of jointly directly reachable stations. (1) Calculate the number of unidirectional cyclic triangles in the space city constructed according to this requirement. (If there are unidirectional pipelines among three space stations A, B, C forming $A \rightarrow B \rightarrow C \rightarrow A$, then triangle ABC is called a unidirectional cyclic triangle.) (2) Can a space city with $n$ stations meeting the above planning requirements be constructed for infinitely many integers $n \geq 3$?

Let $A$ be Abelian group of order $p^4$, where $p$ is a prime number, and which has a subgroup $N$ with order $p$ such that $A/N\approx\mathbb{Z}/p^3\mathbb{Z}$. Find all $A$ expect isomorphic.

Evaluate $ \int_0^{\frac{\pi}{4}} \frac{\sin ^ 2 x}{\cos ^ 3 x}\ dx$.