Let [n] be the set {1, 2,. . . , n}. For any $a, b \in N$, denote $G (a, b)$ by a graph (not directed) defined by the following rule: the vertices have the form (i, f), where $i \in [a]$, and $f: [a] \to [b]$. A vertex (i, f) and a vertex (j, g) are connected if $i \neq j$, and $f (k) \neq g (k)$ holds exactly for k strictly between i and j. Prove that for any $c \in N$ there is $a, b \in N$ such that the vertices of G (a, b) cannot be well-colored with $c$ colors.

Given an acute, non isoceles triangle $ABC$ and $(O)$ be its circumcircle, $H$ its orthocenter and $E, F$ are the feet of the altitudes from $B$ and $C$, respectively. $AH$ intersects $(O)$ at $D$ ($D\ne A$). a) Let $I$ be the midpoint of $AH$, $EI$ meets $BD$ at $M$ and $FI$ meets $CD$ at $N$. Prove that $MN\perp OH$. b) The lines $DE$, $DF$ intersect $(O)$ at $P,Q$ respectively ($P\ne D,Q\ne D$). $(AEF)$ meets $(O)$ and $AO$ at $R,S$ respectively ($R\ne A, S\ne A$). Prove that $BP,CQ,RS$ are concurrent.

In a tennis tournament, each competitor plays against every other competitor, and there are no draws. Call a group of four tennis players ``ordered'' if there is a clear winner and a clear loser (i.e., one person who beat the other three, and one person who lost to the other three.) Find the smallest integer $n$ for which any tennis tournament with $n$ people has a group of four tennis players that is ordered. [i]Ray Li[/i]

If $a,b$ are real numbers such that $a^3 +12a^2 + 49a + 69 = 0$ and $ b^3 - 9b^2 + 28b - 31 = 0,$ find $a + b .$

A $1$ or $0$ is placed on each square of a $4 \times 4$ board. One is allowed to change each symbol in a row, or change each symbol in a column, or change each symbol in a diagonal (there are $14$ diagonals of lengths $1$ to $4$). For which arrangements can one make changes which end up with all $0$s?

Let $ABCD$ be a square and $a$ be the length of his edges. The segments $AE$ and $CF$ are perpendicular on the square's plane in the same half-space and they have the length $AE=a$, $CF=b$ where $a<b<a\sqrt 3$. If $K$ denoted the set of the interior points of the square $ABCD$ determine $\min_{M\in K} \left( \max ( EM, FM ) \right) $ and $\max_{M\in K} \left( \min (EM,FM) \right)$. [i]Octavian Stanasila[/i]

For all pairs $(m, n)$ of positive integers that have the same number $k$ of divisors we define the operation $\circ$. Write all their divisors in an ascending order: $1=m_1<\ldots<m_k=m$, $1=n_1<\ldots<n_k=n$ and set $$ m\circ n= m_1\cdot n_1+\ldots+m_k\cdot n_k. $$ Find all pairs of numbers $(m, n)$, $m\geqslant n$, such that $m\circ n=497$.

Find the functions $f:\mathbb{Z}\times \mathbb{Z}\to\mathbb{R}$ such that a) $f(x,y)\cdot f(y,z) \cdot f(z,x) = 1$ for all integers $x,y,z$; b) $f(x+1,x)=2$ for all integers $x$.

Given the $7$-element set $A = \{ a ,b,c,d,e,f,g \}$, find a collection $T$ of $3$-element subsets of $A$ such that each pair of elements from $A$ occurs exactly once on one of the subsets of $T$.

Triangle $ ABC$ has $ AB \equal{} 2 \cdot AC$. Let $ D$ and $ E$ be on $ \overline{AB}$ and $ \overline{BC}$, respectively, such that $ \angle{BAE} \equal{} \angle{ACD}.$ Let $ F$ be the intersection of segments $ AE$ and $ CD$, and suppose that $ \triangle{CFE}$ is equilateral. What is $ \angle{ACB}$? $ \textbf{(A)}\ 60^{\circ}\qquad \textbf{(B)}\ 75^{\circ}\qquad \textbf{(C)}\ 90^{\circ}\qquad \textbf{(D)}\ 105^{\circ}\qquad \textbf{(E)}\ 120^{\circ}$

Sahand and Gholam play on a $1403\times 1403$ table. Initially all the unit square cells are white. For each row and column there is a key for it (totally 2806 keys). Starting with Sahand players take turn alternatively pushing a button that has not been pushed yet, until all the buttons are pushed. When Sahand pushes a button all the cells of that row or column become black, regardless of the previous colors. When Gholam pushes a button all the cells of that row or column become red, regardless of the previous colors. Finally, Gholam's score equals the number of red squares minus the number of black squares and Sahand's score equals the number of black squares minus the number of red squares. Determine the minimum number of scores Gholam can guarantee without if both players play their best moves.

Let $N$ be the number of ordered triples of 3 positive integers $(a,b,c)$ such that $6a$, $10b$, and $15c$ are all perfect squares and $abc = 210^{210}$. Find the number of divisors of $N$. [i]Proposed by Andy Xu[/i]

By definition, $ r! \equal{} r(r \minus{} 1) \cdots 1$ and $ \binom{j}{k} \equal{} \frac {j!}{k!(j \minus{} k)!}$, where $ r,j,k$ are positive integers and $ k < j$. If $ \binom{n}{1}, \binom{n}{2}, \binom{n}{3}$ form an arithmetic progression with $ n > 3$, then $ n$ equals $ \textbf{(A)}\ 5\qquad \textbf{(B)}\ 7\qquad \textbf{(C)}\ 9\qquad \textbf{(D)}\ 11\qquad \textbf{(E)}\ 12$

a) Given a segment $AB$ with a point $C$ inside it, which is the chord of a circle of radius $R$. Inscribe in the formed segment a circle tangent to point $C$ and to the circle of radius $R$. b) Given a segment $AB$ with a point $C$ inside it, which is the point of tangency of a circle of radius $r$. Draw through $A$ and $B$ a circle tangent to a circle of radius $r$.

Is it possible to simultaneously take away on eight three-ton vehicles $50$ stones, the weight of which is respectively equal to $416, 418, 420, .., 512, 514$ kg?

For $ x \in (0, 1)$ let $ y \in (0, 1)$ be the number whose $ n$-th digit after the decimal point is the $ 2^{n}$-th digit after the decimal point of $ x$. Show that if $ x$ is rational then so is $ y$. [i]Proposed by J.P. Grossman, Canada[/i]

Find the side length of the smallest equilateral triangle in which three discs of radii $2,3,4$ can be placed without overlap.

A polygon $\prod$ is given in the $OXY$ plane and its area exceeds $n.$ Prove that there exist $n+1$ points $P_{1}(x_1, y_1), P_{2}(x_2, y_2), \ldots, P_{n+1}(x_{n+1}, y_{n+1})$ in $\prod$ such that $\forall i,j \in \{1, 2, \ldots, n+1\}$, $x_j - x_i$ and $y_j - y_i$ are all integers.

There are $2002$ employees in a bank. All the employees came to celebrate the bank's jubilee and were seated around one round table. It is known that the difference in salaries of any two adjacent employees is $2$ or $3$ dollars. Find the maximal difference in salaries of two employees, if it is known all salaries are different.

A positive integer $m$ is alpine if $m$ divides $2^{2n+1} + 1$ for some positive integer $n$. Show that the product of two alpine numbers is alpine.

$ \lim_{n\to\infty } \sqrt[n]{\sum_{i=0}^n\binom{n}{i}^2} $

Let $ S$ be the set of nonnegative integers. Find all functions $ f,g,h: S\rightarrow S$ such that $ f(m\plus{}n)\equal{}g(m)\plus{}h(n),$ for all $ m,n\in S$, and $ g(1)\equal{}h(1)\equal{}1$.

Prove that if the orthocenter divides all heights of a triangle in the same proportion, the triangle is equilateral.

Determine all finite sets $M$ of real numbers such that $M$ contains at least $2$ numbers and any two elements of $M$ belong to an arithmetic progression of elements of $M$ with three terms.

Prove that for a $2$-dimensional Riemannian manifold there is a metric linear connection with zero curvature if and only if the Gaussian curvature of the Riemannian manifold can be written as the divergence of a vector field.