On each of the 2006 cards a natural number is written. Cards are placed arbitrarily in a row. 2 players take in turns a card from any end of the row until all the cards are taken. After that each player calculates sum of the numbers written of his cards. If the sum of the first player is not less then the sum of the second one then the first player wins. Show that there's a winning strategy for the first player.

A square is cut into a finitely number of triangles in an arbitrary way. Show the sum of the diameters of the inscribed circles in these triangles is greater than the side length of the square.

Let $P(x) = x^3 + ax^2 + bx + 1$ be a polynomial with real coefficients and three real roots $\rho_1$, $\rho_2$, $\rho_3$ such that $|\rho_1| < |\rho_2| < |\rho_3|$. Let $A$ be the point where the graph of $P(x)$ intersects $yy'$ and the point $B(\rho_1, 0)$, $C(\rho_2, 0)$, $D(\rho_3, 0)$. If the circumcircle of $\vartriangle ABD$ intersects $yy'$ for a second time at $E$, find the minimum value of the length of the segment $EC$ and the polynomials for which this is attained. [i]Brazitikos Silouanos, Greece[/i]

Evaluate the following definite integral. \[\int_{e^{e}}^{e^{e+1}}\left\{\frac{1}{\ln x \cdot\ln (\ln x)}+\ln (\ln (\ln x))\right\}dx\]

For a composite number $n$, let $d_n$ denote its largest proper divisor. Show that there are infinitely many $n$ for which $d_n +d_{n+1}$ is a perfect square.

Let $k,m,n$ be positive integers such that $1\le m\le n$ and denote $S=\{1,2,\ldots,n\}$. Suppose that $A_1,A_2,\ldots,A_k$ are $m$-element subsets of $S$ with the following property: for every $i=1,2,\ldots,k$ there exists a partition $S=S_{1,i}\cup S_{2,i}\cup\ldots\cup S_{m,i}$ (into pairwise disjoint subsets) such that (i) $A_i$ has precisely one element in common with each member of the above partition. (ii) Every $A_j,j\ne i$ is disjoint from at least one member of the above partition. Show that $k\le\binom{n-1}{m-1}$.

The general term of a sequence of numbers is defined as $a_n =\frac{1}{n^2 - n}$, for every integer $n \ge 3$. That is, $a_3 =\frac16$, $a_4 =\frac{1}{12}$, $a_5 =\frac{1}{20}$, and so on. Find a general expression for the sum $S_n$, which is the sum of all terms from $a_3$ until $a_n$.

The remainder on dividing the polynomial $p(x)$ by $x^2 - (a+b)x + ab$ (where $a \not = b$) is $mx + n$. Find the coefficients $m, n$ in terms of $a, b$. Find $m, n$ for the case $p(x) = x^{200}$ divided by $x^2 - x - 2$ and show that they are integral.

Construct a triangle, given the feet of its altitudes. Express the sides of a triangle $Y$ in terms of the sides of the triangle $X$ formed by the feet of the altitudes of $Y$.

Find all positive integers $a, b, c$ such that $ab + 1$, $bc + 1$, and $ca + 1$ are all equal to factorials of some positive integers. Proposed by [i]Nikola Velov, Macedonia[/i]

A cuboctahedron is a solid with 6 square faces and 8 equilateral triangle faces, with each edge adjacent to both a square and a triangle (see picture). Suppose the ratio of the volume of an octahedron to a cuboctahedron with the same side length is $r$. Find $100r^2$. [asy] // dragon96, replacing // [img]http://i.imgur.com/08FbQs.png[/img] size(140); defaultpen(linewidth(.7)); real alpha=10, x=-0.12, y=0.025, r=1/sqrt(3); path hex=rotate(alpha)*polygon(6); pair A = shift(x,y)*(r*dir(330+alpha)), B = shift(x,y)*(r*dir(90+alpha)), C = shift(x,y)*(r*dir(210+alpha)); pair X = (-A.x, -A.y), Y = (-B.x, -B.y), Z = (-C.x, -C.y); int i; pair[] H; for(i=0; i<6; i=i+1) { H[i] = dir(alpha+60*i);} fill(X--Y--Z--cycle, rgb(204,255,255)); fill(H[5]--Y--Z--H[0]--cycle^^H[2]--H[3]--X--cycle, rgb(203,153,255)); fill(H[1]--Z--X--H[2]--cycle^^H[4]--H[5]--Y--cycle, rgb(255,203,153)); fill(H[3]--X--Y--H[4]--cycle^^H[0]--H[1]--Z--cycle, rgb(153,203,255)); draw(hex^^X--Y--Z--cycle); draw(H[1]--B--H[2]^^H[3]--C--H[4]^^H[5]--A--H[0]^^A--B--C--cycle, linewidth(0.6)+linetype("5 5")); draw(H[0]--Z--H[1]^^H[2]--X--H[3]^^H[4]--Y--H[5]);[/asy]

All cells of an $n\times n$ table are painted in several colors so that there is no monochromatic $2\times2$ square. A sequence of different cells $a_1,a_2,\ldots,a_k$ is called a [i]colorful[/i] if any two consecutive cells are adjacent and are painted in different colors. What is the largest $k{}$ for which there is a colorful sequence of length $k{}$ regardless of the coloring of the cells of the table? [i]Proposed by N. Belukhov[/i]

Triangle $ABC$ is said to be perpendicular to triangle $DEF$ if the perpendiculars from $A$ to $EF$,from $B$ to $FD$ and from $C$ to $DE$ are concurrent.Prove that if $ABC$ is perpendicular to $DEF$,then $DEF$ is perpendicular to $ABC$

Let $n(\ge 2)$ be an integer. $2n^2$ contestants participate in a Chinese chess competition, where any two contestant play exactly once. There may be draws. It is known that (1)If A wins B and B wins C, then A wins C. (2)there are at most $\frac{n^3}{16}$ draws. Proof that it is possible to choose $n^2$ contestants and label them $P_{ij}(1\le i,j\le n)$, so that for any $i,j,i',j'\in \{1,2,...,n\}$, if $i<i'$, then $P_{ij}$ wins $P_{i'j'}$.

Given a concyclic quadrilateral $ABCD$ with circumcenter $O$. Let $E$ be the intersection of $AD$ and $BC$, while $F$ be the intersection of $AC$ and $BD$. A circle $w$ are tangent to $BD$ and $AC$ such that $F$ is the orthocenter of $\triangle QEP$ where $PQ$ is a diameter of $w$. Prove that $EO$ passes through the center of $w$.

Given a positive integer $n,$ let $s(n)$ denote the sum of the digits of $n.$ Compute the largest positive integer $n$ such that $n = s(n)^2 + 2s(n) - 2.$

For any number $x$, let $\lfloor x\rfloor$ denotes the greatest integer less than or equal to $x$. A sequence $a_1,a_2,\cdots$ is given, where \[a_n=\left\lfloor{\sqrt{2n}+\dfrac{1}{2}}\right\rfloor.\] How many values of $k$ are there such that $a_k=2010$?

We define the $\emph{weight}$ of a path to be the sum of the numbers written on each edge of the path. Find the minimum weight among all paths in the graph below that visit each vertex precisely once: [center][img]http://i.imgur.com/V99Eg9j.png[/img][/center]

There are two bowls on a table, one white and one black. In the white bowl there $2019$ balls. Players $A$ and $B$ play a game where they make every other move ($A$ begins). One move consists is $\bullet$ to move one or your balls from one bowl to the other, or $\bullet$ to remove a ball from the white bowl, with the condition that the resulting position (that is, the number of bullets in the two bowls) have not occurred before. The player who has no valid move to make loses. Can any of the players be sure to win? If so, which one?

The largest one of numbers $ p_1^{\alpha_1}, p_2^{\alpha_2}, \cdots, p_t^{\alpha_t}$ is called a $ \textbf{Good Number}$ of positive integer $ n$, if $ \displaystyle n\equal{} p_1^{\alpha_1} \cdot p_2^{\alpha_2} \cdots p_t^{\alpha_t}$, where $ p_1$, $ p_2$, $ \cdots$, $ p_t$ are pairwisely different primes and $ \alpha_1, \alpha_2, \cdots, \alpha_t$ are positive integers. Let $ n_1, n_2, \cdots, n_{10000}$ be $ 10000$ distinct positive integers such that the $ \textbf{Good Numbers}$ of $ n_1, n_2, \cdots, n_{10000}$ are all equal. Prove that there exist integers $ a_1, a_2, \cdots, a_{10000}$ such that any two of the following $ 10000$ arithmetical progressions $ \{ a_i, a_i \plus{} n_i, a_i \plus{} 2n_i, a_i \plus{} 3n_i, \cdots \}$($ i\equal{}1,2, \cdots 10000$) have no common terms.

is there a function $f:\mathbb{N}\rightarrow \mathbb{N}$ such that $i) \exists n\in \mathbb{N}:f(n)\neq n$ $ii)$ the number of divisors of $m$ is $f(n)$ if and only if the number of divisors of $f(m)$ is $n$

Given the triangle $ABC$, let $L$, $M$ and $N $be the midpoints of $BC$, $CA$ and $AB$ respectively. The lines $LM$ and $LN$ cut the tangent to the circumcircle at $A$ at $P$ and $Q$ respectively . Prove that $CP \parallel BQ$.

Triangle $ABC$ has circumcircle $\omega$ where $B'$ is the point diametrically opposite $B$ and $C'$ is the point diametrically opposite $C$. Given $B'C'$ passes through the midpoint of $AB$, if $AC' = 3$ and $BC = 7$, find $AB'^2$..

Points $ A’,B,C’ $ are arbitrarily taken on edges $ SA,SB, $ respectively, $ SC $ of a tetrahedron $ SABC. $ Plane forrmed by $ ABC $ intersects the plane $ \rho , $ formed by $ A’B’C’, $ in a line $ d. $ Prove that, meanwhile the plane $ \rho $ rotates around $ d, $ the lines $ AA’,BB’ $ and $ CC’ $ are, and remain concurrent. Find de locus of the respective intersections.

$9.3$ A natural number is called square-free, if it is not divisible by the square of any prime number. For a natural number $a$, we consider the number $f(a) = a^{a+1} + 1$. Prove that: a) if $a$ is even, then $f(a)$ is not square-free b) there exist infinitely many odd $a$ for which $f(a)$ is not square-free $9.4$ We will call a generalized $2n$-parallelogram a convex polygon with $2n$ sides, so that, traversed consecutively, the $k$th side is parallel and equal to the $(n+k)$th side for $k=1, 2, ... , n$. In a rectangular coordinate system, a generalized parallelogram is given with $50$ vertices, each with integer coordinates. Prove that its area is at least $300$.