Let $n, m$ be positive integers, and let $\alpha$ be an irrational number satisfying $1 < \alpha < n$. Define the set \[ X = \{a + b\alpha : 0 \le a \le n \text{ and } 0 \le b \le m \}. \] Let $x_0\le x_1\le \cdots \le x_{(n+1)(m+1)-1}$ be the elements of $X$. Show that for all $i+j\le (n+1)(m+1)-1$, we have that $x_{i+j} \le x_i + x_j$ .

In a regular nonagon, each vertex is colored either red or green. Three corners of the nonagon determine a triangle. Such a triangle is called [i]red [/i] or [i]green [/i] if all its vertices are red or green if all are green. Prove that for each such coloring of the nonagon there are at least two different ones , that are congruent triangles of the same color.

Let $\, k_1 < k_2 < k_3 < \cdots \,$ be positive integers, no two consecutive, and let $\, s_m = k_1 + k_2 + \cdots + k_m \,$ for $\, m = 1,2,3, \ldots \; \;$. Prove that, for each positive integer $\, n, \,$ the interval $\, [s_n, s_{n+1}) \,$ contains at least one perfect square.

For each $x$ with $|x|<1$, compute the sum of the series $$1+4x+9x^2+\ldots+n^2x^{n-1}+\ldots.$$

[list=a] [*]Let $f\colon\mathbb{R}\rightarrow\mathbb{R}$ be a function such that $g\colon\mathbb{R}\rightarrow\mathbb{R}$, $g(x)=f(x)+f(2x)$, and $h\colon\mathbb{R}\rightarrow\mathbb{R}$, $h(x)=f(x)+f(4x)$, are continuous functions. Prove that $f$ is also continuous. [*]Give an example of a discontinuous function $f\colon\mathbb{R} \rightarrow\mathbb{R}$, with the following property: there exists an interval $I\subset\mathbb{R}$, such that, for any $a$ in $I$, the function $g_{a} \colon\mathbb{R}\rightarrow\mathbb{R}$, $g_{a}(x)=f(x)+f(ax)$, is continuous.[/list]

In a plane a set of $n\geq 3$ points is given. Each pair of points is connected by a segment. Let $d$ be the length of the longest of these segments. We define a diameter of the set to be any connecting segment of length $d$. Prove that the number of diameters of the given set is at most $n$.

Find all polynomials $P(x)$ with real coefficents such that \[P(P(x))=(x^2+x+1)\cdot P(x)\] where $x \in \mathbb{R}$

Given a sphere, a great circle of the sphere is a circle on the sphere whose diameter is also a diameter of the sphere. For a given positive integer $n,$ the surface of a sphere is divided into several regions by $n$ great circles, and each region is colored black or white. We say that a coloring is good if any two adjacent regions (that share an arc as boundary, not just a finite number of points) have different colors. Find, with proof, all positive integers $n$ such that in every good coloring with $n$ great circles, the sum of the areas of the black regions is equal to the sum of the areas of the white regions.

Let $f:[0,1]\to[0,1]$ be a differentiable function such that $|f'(x)|\ne1$ for all $x\in[0,1]$. Prove that there exist unique $\alpha,\beta\in[0,1]$ such that $f(\alpha)=\alpha$ and $f(\beta)=1-\beta$.

For which $n{}$ is it possible that a product of $n{}$ consecutive positive integers is equal to a sum of $n{}$ consecutive (not necessarily the same) positive integers? [i]Boris Frenkin[/i]

Real numbers $a,b,c$ satisfy $\tfrac{1}{ab} = b+2c, \tfrac{1}{bc} = 2c+3a, \tfrac{1}{ca}=3a+b.$ Then, $(a+b+c)^3$ can be written as $\tfrac{m}{n}$ for relatively prime positive integers $m$ and $n.$ Find $m+n.$

The diagram shows two equilateral triangles with side length $4$ mounted on two adjacent sides of a square also with side length $4$. The distance between the two vertices marked $A$ and $B$ can be written as $\sqrt{m}+\sqrt{n}$ for two positive integers $m$ and $n$. Find $m + n$. [asy] size(120); defaultpen(linewidth(0.7)+fontsize(11pt)); draw(unitsquare); draw((0,1)--(1/2,1+sqrt(3)/2)--(1,1)--(1+sqrt(3)/2,1/2)--(1,0)); label("$A$",(1/2,1+sqrt(3)/2),N); label("$B$",(1+sqrt(3)/2,1/2),E); [/asy]

How many one-to-one functions $f : \{1, 2, \cdots, 9\} \rightarrow \{1, 2, \cdots, 9\}$ satisfy (i) and (ii)? (i) $f(1)>f(2)$, $f(9)<9$. (ii) For each $i=3, 4, \cdots, 8$, if $f(1), \cdots, f(i-1)$ are smaller than $f(i)$, then $f(i+1)$ is also smaller than $f(i)$.

In the tetrahedron $ABCD$, $E$ and $F$ are the midpoints of $BC$ and $AD$, $G$ is the midpoint of the segment $EF$. Construct a plane through $G$ intersecting the segments $AB$, $AC$, $AD$ in the points $M,N,P$ respectively in such a way that the sum of the volumes of the tetrahedrons $BMNP$, $CMNP$ and $DMNP$ to be minimal. [i]H. Lesov[/i]

Let $P_1$ and $P_2$ be two non-parallel planes in space, and $A$ a point that does not It is in none of them. For each point $X$, let $X_1$ denote its reflection with respect to $P_1$, and $X_2$ its reflection with respect to $P_2$. Determine the locus of points $X$ for the which $X_1, X_2$ and $A$ are collinear.

Prove that there infinitely many numbers of the form $18^{m}+45^{m}+50^{m}+125^{m}$, divisible by 2006. $m\in N$

A positive integer $n$ is said to be base-able if there exists positive integers $a$ and $b,$ with $b>1,$ such that $n=a^b.$ How many positive integer divisors of $729000000$ are base-able? [i]Proposed by Kyle Lee[/i]

Prove for any positives $a,b,c$ the inequality $$ \sqrt[3]{\dfrac{a}{b}}+\sqrt[5]{\dfrac{b}{c}}+\sqrt[7]{\dfrac{c}{a}}>\dfrac{5}{2}$$

There are five positive integers written in a row. Each one except for the first one is the minimal positive integer that is not a divisor of the previous one. Can all these five numbers be distinct? Boris Frenkin

For every positive integer $k$ let $a_{k,1},a_{k,2},\ldots$ be a sequence of positive integers. For every positive integer $k$ let sequence $\{a_{k+1,i}\}$ be the difference sequence of $\{a_{k,i}\}$, i.e. for all positive integers $k$ and $i$ the following holds: $a_{k,i+1}-a_{k,i}=a_{k+1,i}$. Is it possible that every positive integer appears exactly once among numbers $a_{k,i}$? [i]Proposed by Dávid Matolcsi, Berkeley[/i]

Let $ABC$ be a triangle such that $\angle BAC = 90^\circ$ and $AB < AC$. We divide the interior of the triangle into the following six regions: \begin{align*} S_1=\text{set of all points }\mathit{P}\text{ inside }\triangle ABC\text{ such that }PA<PB<PC \\ S_2=\text{set of all points }\mathit{P}\text{ inside }\triangle ABC\text{ such that }PA<PC<PB \\ S_3=\text{set of all points }\mathit{P}\text{ inside }\triangle ABC\text{ such that }PB<PA<PC \\ S_4=\text{set of all points }\mathit{P}\text{ inside }\triangle ABC\text{ such that }PB<PC<PA \\ S_5=\text{set of all points }\mathit{P}\text{ inside }\triangle ABC\text{ such that }PC<PA<PB \\ S_6=\text{set of all points }\mathit{P}\text{ inside }\triangle ABC\text{ such that }PC<PB<PA\end{align*} Suppose that the ratio of the area of the largest region to the area of the smallest non-empty region is $49 : 1$. Determine the ratio $AC : AB$.

Let $ ABC$ be a right triangle with $ \angle A \equal{} 90^\circ$. Let $ D$ be the midpoint of $ AB$ and let $ E$ be a point on segment $ AC$ such that $ AD \equal{} AE$. Let $ BE$ meet $ CD$ at $ F$. If $ \angle BFC \equal{} 135^\circ$, determine $ BC / AB$.

Let $ABC$ be triangle with circumcircle $(O)$. Let $AO$ cut $(O)$ again at $A'$. Perpendicular bisector of $OA'$ cut $BC$ at $P_A$. $P_B,P_C$ define similarly. Prove that : I) Point $P_A,P_B,P_C$ are collinear. II ) Prove that the distance of $O$ from this line is equal to $\frac {R}{2}$ where $R$ is the radius of the circumcircle.

Function $f(x)=ax^2+8x+3(a<0)$. For any given nerative number $a$, define the largest positive number $l(a)$: $|f(x)|\leq5$ for all $x\in[0,l(a)]$. Find the largest $l(a)$, and $a$ when $l(a)$ takes its maximum value.

Let $ABCD$ be a rectangle and $P$ a point outside of it such that $\angle{BPC} = 90^{\circ}$ and the area of the pentagon $ABPCD$ is equal to $AB^{2}$. Show that $ABPCD$ can be divided in 3 pieces with straight cuts in such a way that a square can be built using those 3 pieces, without leaving any holes or placing pieces on top of each other. Note: the pieces can be rotated and flipped over.