Find all possible values of $C\in \mathbb R$ such that there exists a real sequence $\{a_n\}_{n=1}^\infty$ such that $$a_na_{n+1}^2\ge a_{n+2}^4 +C$$ for all $n\ge 1$.

Let $p$ and $q$ be odd prime numbers. Assume that there exists a positive integer $n$ such that $pq-1= n^3$. Express $p+q$ in terms of $n$

Find the smallest integer $n$ such that each subset of $\{1,2,\ldots, 2004\}$ with $n$ elements has two distinct elements $a$ and $b$ for which $a^2-b^2$ is a multiple of $2004$.

One-round hockey tournament is finished (each plays with each one time, the winner gets $2$ points, looser -- $0$, and $1$ point for draw). For arbitrary subgroup of teams there exists a team (may be from that subgroup) that has got an odd number of points in the games with the teams of the subgroup. Prove that there was even number of the participants.

Let \[\mathcal{S} = \sum_{i=1}^{\infty}\left(\prod_{j=1}^i \dfrac{3j - 2}{12j}\right).\] Then $(\mathcal{S} + 1)^3 = \tfrac mn$ with $m$ and $n$ coprime positive integers. Find $10m + n$. [i]Proposed by Justin Lee and Evan Chang[/i]

Point $O$ is the intersection of the perpendicular bisectors of the sides of the triangle $\vartriangle ABC$ . Let $D$ be the intersection of the line $AO$ with the segment $[BC]$. Knowing that $OD = BD = \frac 13 BC$, find the measures of the angles of the triangle $\vartriangle ABC$.

Let $n$ be a natural number. Suppose that $x_0=0$ and that $x_i>0$ for all $i\in\{1,2,\ldots ,n\}$. If $\sum_{i=1}^nx_i=1$ , prove that \[1\leq\sum_{i=1}^{n} \frac{x_i}{\sqrt{1+x_0+x_1+\ldots +x_{i-1}}\sqrt{x_i+\ldots+x_n}} < \frac{\pi}{2} \]

$G$ is a graph with $n$ vertices $A_1,A_2,\ldots,A_n,$ such that for each pair of non adjacent vertices $A_i$ and $A_j$ , there exist another vertex $A_k$ that is adjacent to both $A_i$ and $A_j .$ [b](a) [/b]Find the minimum number of edges in such a graph. [b](b) [/b]If $n = 6$ and $A_1,A_2,A_3,A_4,A_5,$ and $A_6$ form a cycle of length $6,$ find the number of edges that must be added to this cycle such that the above condition holds.

The Bank of Zürich issues coins with an $H$ on one side and a $T$ on the other side. Alice has $n$ of these coins arranged in a line from left to right. She repeatedly performs the following operation: if some coin is showing its $H$ side, Alice chooses a group of consecutive coins (this group must contain at least one coin) and flips all of them; otherwise, all coins show $T$ and Alice stops. For instance, if $n = 3$, Alice may perform the following operations: $THT \to HTH \to HHH \to TTH \to TTT$. She might also choose to perform the operation $THT \to TTT$. For each initial configuration $C$, let $m(C)$ be the minimal number of operations that Alice must perform. For example, $m(THT) = 1$ and $m(TTT) = 0$. For every integer $n \geq 1$, determine the largest value of $m(C)$ over all $2^n$ possible initial configurations $C$. [i]Massimiliano Foschi, Italy[/i]

Let the triangle $ ADB_1$ s.t. $ m(\angle DAB_1)\ne 90^\circ$.On the sides of this triangle externally are constructed the squares $ ABCD$ and $ AB_1C_1D_1$ with centers $ O_1$ and $ O_2$, respectively.Prove that the circumcircles of the triangles $ BAB_1$, $ DAD_1$ and $ O_1AO_2$ share a common point, that differs from $ A$.

Let $U_1 , U_2 , U_3$ be iid random variables on [0,1], which in order of magnitude, $U_1^{\ast} \le U_2^{\ast} \leq U_3 ^ {\ast}$. Let $\alpha, p_1 , p_2 , p_3 \in [0,1]$ such that $P(U_j ^ {\ast} \ge p_j)= \alpha$ ( j = 1,2,3). Prove that $$P \left( p_1 + (p_2-p_1) U_3^{\ast} + (p_3- p_2) U_2^{\ast} + (1-p_3) U_1^{\ast} \geq \frac{1}{2} \right) \geq 1-\alpha$$

Call a polynomial $p(x)$ with positive integer roots [i]corrupt[/i] if there exists an integer that cannot be expressed as a sum of (not necessarily positive) multiples of its roots. The polynomial $A(x)$ is monic, corrupt, and has distinct roots. As well, $A(0)$ has $7$ positive divisors. Find the least possible value of $|A(1)|$.

Some of the vertices of unit squares of an $n\times n$ chessboard are colored so that any $k\times k$ ( $1\le k\le n$) square consisting of these unit squares has a colored point on at least one of its sides. Let $l(n)$ denote the minimum number of colored points required to satisfy this condition. Prove that $\underset{n\to \infty }{\mathop \lim }\,\frac{l(n)}{{{n}^{2}}}=\frac{2}{7}$.

Let $n\ge 2$ be a natural number. Let $a_1\le a_2\le a_3\le \cdots \le a_n$ be real numbers such that $a_1+a_2+\cdots +a_n>0$ and $n(a_1^2+a_2^2+\cdots +a_n^2)=2(a_1+a_2+\cdots +a_n)^2.$ If $m=\lfloor n/2\rfloor+1$, the smallest integer larger than $n/2$, then show that $a_m>0.$

What value of $x$ satisfies $$x- \frac{3}{4} = \frac{5}{12} - \frac{1}{3}?$$ $\textbf{(A)}\ -\frac{2}{3}\qquad\textbf{(B)}\ \frac{7}{36}\qquad\textbf{(C)}\ \frac{7}{12}\qquad\textbf{(D)}\ \frac{2}{3}\qquad\textbf{(E)}\ \frac{5}{6}$

Let $\omega_1$ and $\omega_2$ be circles that intersect at points $A$ and $B$ and let $O_1$ and $O_2$ be their respective centers. We take $M$ in $\omega_1$ and $N$ in $\omega_2$ on the same side as $B$ with respect to segment $O_1O_2$, such that $MO_1\parallel BO_2$ and $BO_1 \parallel NO_2$. Draw the tangents to $\omega_1$ and $\omega_2$ through $M$ and $N$ respectively, which intersect at $K$. Show that $A$, $B$ and $K$ are collinear.

Let $T$ be a tree. Prove that there is a constant $c>0$ (independent of $n$) such that every graph with $n$ vertices that does not contain a subgraph isomorphic to $T$ has at most $cn$ edges. [i]David Yang.[/i]

Let $ABCD$ be a convex quadrilateral, and let $M$ and$ N$ be midpoints of sides $AB$ and $CD$ respectively. Point $P$ is chosen on $CD$ so that $MP \perp CD$, and point $Q$ is chosen on $AB$ so that $NQ \perp AB$. Show that $AD \parallel BC$ if and only if $\frac{AB}{CD} =\frac{MP}{NQ}$ .

Find, with proof, all positive integers $n$ with the following property: There are only finitely many positive multiples of $n$ which have exactly $n$ positive divisors

A rectangular $1$ by $10$ strip is divided into $10$ $1$ by $1$ squares. The numbers $1$, $2$, $3$,$...$, $10$ are placed in the squares in the following way. First the number $1$ is placed in an arbitrary square, then $2$ is placed in a neighbouring square, then $3$ is placed into a free square neighbouring one of the squares occupied earlier, and so on (up to $10$). How many different permutations of $1$,$2$, $3$,$...$, $10$ can one get in this way? (A Shen)

On the side $AC$ of the triangle $ABC$ in the external side is constructed the parallelogram $ACDE$ . Let $O$ be the intersection point of its diagonals, $N$ and $K$ be midpoints of BC and BA respectively. Prove that lines $DK, EN$ and $BO$ intersect at one point.

Given $n\geq2$, let $\mathcal{A}$ be a family of subsets of the set $\{1,2,\dots,n\}$ such that, for any $A_1,A_2,A_3,A_4 \in \mathcal{A}$, it holds that $|A_1 \cup A_2 \cup A_3 \cup A_4| \leq n -2$. Prove that $|\mathcal{A}| \leq 2^{n-2}.$

There are pieces in the shape of an equilateral triangle with sides $1, 2, 3, 4, 5$ and $6$ ($50$ pieces of each size). You want to build an equilateral triangle of side $7$ using some of these pieces, without gaps or overlaps. What is the least number of pieces needed?

If the sum of all the angles except one of a convex polygon is $ 2190^{\circ}$, then the number of sides of the polygon must be $ \textbf{(A)}\ 13 \qquad \textbf{(B)}\ 15 \qquad \textbf{(C)}\ 17 \qquad \textbf{(D)}\ 19 \qquad \textbf{(E)}\ 21$

Find all nondecreasing functions $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that verify the relation $$ f\left( f\left( x^2 \right) +y+f(y) \right) =x^2+2f(y) , $$ for any real numbers $ x,y. $