Suppose that $10$ mathematics teachers gather at a circular table with $25$ seats to discuss the upcoming mathematics competition. Each teacher is assigned a unique integer ID number between $1$ and $10$, and the teachers arrange themselves in such a way that teachers with consecutive ID numbers are not separated by any other teacher (IDs $1$ and $10$ are considered consecutive). In addition, each pair of teachers is separated by at least one empty seat. Given that seating arrangements obtained by rotation are considered identical, how many ways are there for the teachers to sit at the table?

Let $ x$ and $ y$ be positive real numbers with $ x^3 \plus{} y^3 \equal{} x \minus{} y.$ Prove that \[ x^2 \plus{} 4y^2 < 1.\]

Compute $\Sigma_{n=1}^{\infty}\frac{n + 1}{n^2(n + 2)^2}$ . Your answer in simplest form can be written as $a/b$, where $a, b$ are relatively-prime positive integers. Find $a + b$.

Five different awards are to be given to three students. Each student will receive at least one award. In how many ways can the awards be distributed? $\textbf{(A)}\ 120 \qquad \textbf{(B)}\ 150 \qquad \textbf{(C)}\ 180 \qquad \textbf{(D)}\ 210 \qquad \textbf{(E)}\ 240$

Find all values of the parameter $a$ for which the sum of all solutions (meaning real solutions) of the equation $x^4 - 5x + a = 0$ is equal to $a$

Let $ O$ be the circumcircle of a $ \Delta ABC$ and let $ I$ be its incenter, for a point $ P$ of the plane let $ f(P)$ be the point obtained by reflecting $ P'$ by the midpoint of $ OI$, with $ P'$ the homothety of $ P$ with center $ O$ and ratio $ \frac{R}{r}$ with $ r$ the inradii and $ R$ the circumradii,(understand it by $ \frac{OP}{OP'}\equal{}\frac{R}{r}$). Let $ A_1$, $ B_1$ and $ C_1$ the midpoints of $ BC$, $ AC$ and $ AB$, respectively. Show that the rays $ A_1f(A)$, $ B_1f(B)$ and $ C_1f(C)$ concur on the incircle.

Find the value of $$\sum_{1\le a<b<c} \frac{1}{2^a3^b5^c}$$ (i.e. the sum of $\frac{1}{2^a3^b5^c}$ over all triples of positive integers $(a, b, c)$ satisfying $a<b<c$)

In a school there are $ 2008$ students. Students are members of certain committees. A committee has at most $ 1004$ members and every two students join a common committee. (i) Determine the smallest possible number of committees in the school. (ii) If it is further required that the union of any two committees consists of at most $ 1800$ students, will your answer in (i) still hold?

A game is played on a $n \times n$ chessboard. In the beginning Bars the cat occupies any cell according to his choice. The $d$ sparrows land on certain cells according to their choice (several sparrows may land in the same cell). Bars and the sparrows play in turns. In each turn of Bars, he moves to a cell adjacent by a side or a vertex (like a king in chess). In each turn of the sparrows, precisely one of the sparrows flies from its current cell to any other cell of his choice. The goal of Bars is to get to a cell containing a sparrow. Can Bars achieve his goal a) if $d=\lfloor \frac{3\cdot n^2}{25}\rfloor$, assuming $n$ is large enough? b) if $d=\lfloor \frac{3\cdot n^2}{19}\rfloor$, assuming $n$ is large enough? c) if $d=\lfloor \frac{3\cdot n^2}{14}\rfloor$, assuming $n$ is large enough?

Let $P$ be a polynomial with integer coefficients such that $P(0)=0$ and \[\gcd(P(0), P(1), P(2), \ldots ) = 1.\] Show there are infinitely many $n$ such that \[\gcd(P(n)- P(0), P(n+1)-P(1), P(n+2)-P(2), \ldots) = n.\]

Let $k$ be a positive integer. Prove that there exist integers $x$ and $y$, neither of which divisible by $7$, such that \begin{align*} x^2 + 6y^2 = 7^k. \end{align*}

In the acute triangle $ABC$, the midpoint of side $BC$ is called $M$. Point $X$ lies on the angle bisector of $\angle AMB$ such that $\angle BXM = 90^o$. Point $Y$ lies on the angle bisector of $\angle AMC$ such that $\angle CYM = 90^o$. Line segments $AM$ and $XY$ intersect in point $Z$. Prove that $Z$ is the midpoint of $XY$ . [asy] import geometry; unitsize (1.2 cm); pair A, B, C, M, X, Y, Z; A = (0,0); B = (4,1.5); C = (0.5,3); M = (B + C)/2; X = extension(M, incenter(A,B,M), B, B + rotate(90)*(incenter(A,B,M) - M)); Y = extension(M, incenter(A,C,M), C, C + rotate(90)*(incenter(A,C,M) - M)); Z = extension(A,M,X,Y); draw(A--B--C--cycle); draw(A--M); draw(M--interp(M,X,2)); draw(M--interp(M,Y,2)); draw(B--X, dotted); draw(C--Y, dotted); draw(X--Y); dot("$A$", A, SW); dot("$B$", B, E); dot("$C$", C, N); dot("$M$", M, NE); dot("$X$", X, NW); dot("$Y$", Y, NE); dot("$Z$", Z, S); [/asy]

Let $m$ and $n$ be positive integers greater than $1$. In each unit square of an $m\times n$ grid lies a coin with its tail side up. A [i]move[/i] consists of the following steps. [list=1] [*]select a $2\times 2$ square in the grid; [*]flip the coins in the top-left and bottom-right unit squares; [*]flip the coin in either the top-right or bottom-left unit square. [/list] Determine all pairs $(m,n)$ for which it is possible that every coin shows head-side up after a finite number of moves. [i]Thanasin Nampaisarn, Thailand[/i]

Given that the expression $\frac{20^{21}}{20^{20}} +\frac{20^{20}}{20^{21}}$ can be written in the form $m/n$ , where $m$ and $n$ are relatively prime positive integers, find $m +n$. [i]Proposed by Ada Tsui[/i]

Find the limit, when $n$ tends to the infinity, of $$\frac{\sum_{k=0}^{n} {{2n} \choose {2k}} 3^k} {\sum_{k=0}^{n-1} {{2n} \choose {2k+1}} 3^k}$$

$2014$ points are placed on a circumference. On each of the segments with end points on two of the $2014$ points is written a non-negative real number. For any convex polygon with vertices on some of the $2014$ points, the sum of the numbers written on their sides is less or equal than $1$. Find the maximum possible value for the sum of all the written numbers.

In the right triangle $ABC$ ( $\angle A = 90^o$), $D$ is the intersection of the bisector of the angle $A$ with the side $(BC)$, and $P$ and $Q$ are the projections of the point $D$ on the sides $(AB),(AC)$ respectively . If $BQ \cap DP=\{M\}$, $CP \cap DQ=\{N\}$, $BQ\cap CP=\{H\}$, show that: a) $PM = DN$ b) $MN \parallel BC$ c) $AH \perp BC$.

The areas of the faces $ABD,ACD,BCD,BCA$ of a tetrahedron $ABCD$ are $S_1,S_2,Q_1,Q_2$, respectively. The angle between the faces $ABD$ and $ACD$ equals $\alpha$, and the angle between $BCD$ and $BCA$ is $\beta$. Prove that $$S_1^2+S_2^2-2S_1S_2\cos\alpha=Q_1^2+Q_2^2-2Q_1Q_2\cos\beta.$$

Let $m$ be a positive integer. The positive integer $a$ is called a [i]golden residue[/i] modulo $m$ if $\gcd(a,m)=1$ and $x^x \equiv a \pmod m$ has a solution for $x$. Given a positive integer $n$, suppose that $a$ is a golden residue modulo $n^n$. Show that $a$ is also a golden residue modulo $n^{n^n}$. [i]Proposed by Mahyar Sefidgaran[/i]

Let $\Gamma$ be a circle and let $d$ be a line such that $\Gamma$ and $d$ have no common points. Further, let $AB$ be a diameter of the circle $\Gamma$; assume that this diameter $AB$ is perpendicular to the line $d$, and the point $B$ is nearer to the line $d$ than the point $A$. Let $C$ be an arbitrary point on the circle $\Gamma$, different from the points $A$ and $B$. Let $D$ be the point of intersection of the lines $AC$ and $d$. One of the two tangents from the point $D$ to the circle $\Gamma$ touches this circle $\Gamma$ at a point $E$; hereby, we assume that the points $B$ and $E$ lie in the same halfplane with respect to the line $AC$. Denote by $F$ the point of intersection of the lines $BE$ and $d$. Let the line $AF$ intersect the circle $\Gamma$ at a point $G$, different from $A$. Prove that the reflection of the point $G$ in the line $AB$ lies on the line $CF$.

Determine the greatest natural number $n$, such that for each set $S$ of 2015 different integers there exist 2 subsets of $S$ (possible to be with 1 element and not necessarily non-intersecting) each of which has a sum of its elements divisible by $n$.

Let $n>2$ be a given positive integer. There are $n$ guests at Georg's bachelor party and each guest is friends with at least one other guest. Georg organizes a party game among the guests. Each guest receives a jug of water such that there are no two guests with the same amount of water in their jugs. All guests now proceed simultaneously as follows. Every guest takes one cup for each of his friends at the party and distributes all the water from his jug evenly in the cups. He then passes a cup to each of his friends. Each guest having received a cup of water from each of his friends pours the water he has received into his jug. What is the smallest possible number of guests that do not have the same amount of water as they started with?

$(x_1, y_1,z_1)$ and $(x_2, y_2, z_2)$ are triples of real numbers such that for every pair of integers $(m,n)$ at least one of $x_{1m} + y_{1n} + z_1$, $x_{2m} + y_{2n} + z_2$ is an even integer. Prove that one of the triples consists of three integers.

If $a=\sqrt[3]{9}-\sqrt[3]{3}+1$, what is $(\frac {4-a}a)^6$? $ \textbf{(A)}\ 3 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 8 \qquad\textbf{(D)}\ 9 \qquad\textbf{(E)}\ 12 $

A given finite number of lines in the plane, no two of which are parallel and no three of which are concurrent, divide the plane into finite and infinite regions. In each finite region we write $1$ or $-1$. In one operation, we can choose any triangle made of three of the lines (which may be cut by other lines in the collection) and multiply by $-1$ each of the numbers in the triangle. Determine if it is always possible to obtain $1$ in all the finite regions by successively applying this operation, regardless of the initial distribution of $1$s and $-1$s.