Let $ABC$ be a triangle with $AB < AC$, incenter $I$, and $A$ excenter $I_{A}$. The incircle meets $BC$ at $D$. Define $E = AD\cap BI_{A}$, $F = AD\cap CI_{A}$. Show that the circumcircle of $\triangle AID$ and $\triangle I_{A}EF$ are tangent to each other

Assume $A=\{a_{1},a_{2},...,a_{12}\}$ is a set of positive integers such that for each positive integer $n \leq 2500$ there is a subset $S$ of $A$ whose sum of elements is $n$. If $a_{1}<a_{2}<...<a_{12}$ , what is the smallest possible value of $a_{1}$?

Let $f(x)=3x^3-5x^2+2x-6$. If the roots of $f$ are given by $\alpha$, $\beta$, and $\gamma$, find \[ \left(\frac{1}{\alpha-2}\right)^2+\left(\frac{1}{\beta-2}\right)^2+\left(\frac{1}{\gamma-2}\right)^2. \]

Let $a_1,a_2,\cdots,a_n$ be a permutation of $1,2,\cdots,n$. Among all possible permutations, find the minimum of $$\sum_{i=1}^n \min \{ a_i,2i-1 \}.$$

As shown in the figure, there are two rectangles $ABCD$ and $PQRD$ with the same area, and with parallel corresponding edges. Let points $N,$ $M$ and $T$ be the midpoints of segments $QR,$ $PC$ and $AB$, respectively. Prove that points $N,M$ and $T$ lie on the same line. [img]http://s4.picofile.com/file/8372959484/E02.png[/img] [i]Proposed by Morteza Saghafian[/i]

The points $X, Y,Z$ are marked on the sides $AB, BC,AC$ of the triangle $ABC$, respectively. Points $A',B', C'$ are on the $XZ, XY, YZ$ sides of the triangle $XYZ$, respectively, so that $\frac{AB}{A'B'} = \frac{AB}{A'B'} =\frac{BC}{B'C'}= 2$ and $ABB'A',BCC'B',ACC'A'$ are trapezoids in which the sides of the triangle $ABC$ are bases. a) Determine the ratio between the area of the trapezium $ABB'A'$ and the area of the triangle $A'B'X$. b) Determine the ratio between the area of the triangle $XYZ$ and the area of the triangle $ABC$.

Find the greatest power of $2$ that divides $a_n = [(3+\sqrt{11} )^{2n+1}]$, where $n$ is a given positive integer.

$$\int_1^\infty \frac{1 + 2x \ln 2}{x\sqrt{x 4^x - 1}}\,dx$$ [i]Proposed by Vlad Oleksenko[/i]

Let $A_n$ denote the answer to the $n$th problem on this contest ($n=1,\dots,30$); in particular, the answer to this problem is $A_1$. Compute $2A_1(A_1+A_2+\dots+A_{30})$. [i]Proposed by Yang Liu[/i]

Dene the set $F$ as the following: $F = \{(a_1,a_2,... , a_{2006}) : \forall i = 1, 2,..., 2006, a_i \in \{-1,1\}\}$ Prove that there exists a subset of $F$, called $S$ which satises the following: $|S| = 2006$ and for all $(a_1,a_2,... , a_{2006})\in F$ there exists $(b_1,b_2,... , b_{2006}) \in S$, such that $\Sigma_{i=1} ^{2006}a_ib_i = 0$.

An acute scalene triangle $ABC$ with circumcircle $\Omega$ is given. The altitude from $B$ intersects side $AC$ at $B_1$ and circle $\Omega$ at $B_2$. The circle with diameter $B_1B_2$ intersects circle $\Omega$ again at $B_3$. Similarly, the altitude from $C$ intersects side $AB$ at $C_1$ and circle $\Omega$ at $C_2$. The circle with diameter $C_1C_2$ intersects circle $\Omega$ again at $C_3$. Let $X$ be the intersection of lines $B_1B_3$ and $C_1C_3$, and let $Y$ be the intersection of lines $B_3C$ and $C_3B$. Prove that line $XY$ bisects side $BC$.

Consider the equilateral triangular lattice in the complex plane defined by the Eisenstein integers; let the ordered pair $(x,y)$ denote the complex number $x+y\omega$ for $\omega=e^{2\pi i/3}$. We define an $\omega$-chessboard polygon to be a (non self-intersecting) polygon whose sides are situated along lines of the form $x=a$ or $y=b$, where $a$ and $b$ are integers. These lines divide the interior into unit triangles, which are shaded alternately black and white so that adjacent triangles have different colors. To tile an $\omega$-chessboard polygon by lozenges is to exactly cover the polygon by non-overlapping rhombuses consisting of two bordering triangles. Finally, a [i]tasteful tiling[/i] is one such that for every unit hexagon tiled by three lozenges, each lozenge has a black triangle on its left (defined by clockwise orientation) and a white triangle on its right (so the lozenges are BW, BW, BW in clockwise order). a) Prove that if an $\omega$-chessboard polygon can be tiled by lozenges, then it can be done so tastefully. b) Prove that such a tasteful tiling is unique. [i]Victor Wang.[/i]

Let $n \ge 3$ cells be arranged into a circle. Each cell can be occupied by $0$ or $1$. The following operation is admissible: Choose any cell $C$ occupied by a $1$, change it into a $0$ and simultaneously reverse the entries in the two cells adjacent to $C$ (so that $x,y$ become $1 - x$, $1 - y$). Initially, there is a $1$ in one cell and zeros elsewhere. For which values of $n$ is it possible to obtain zeros in all cells in a finite number of admissible steps?

John is walking east at a speed of 3 miles per hour, while Bob is also walking east, but at a speed of 5 miles per hour. If Bob is now 1 mile west of John, how many minutes will it take for Bob to catch up to John? $ \textbf{(A) } 30 \qquad \textbf{(B) } 50 \qquad \textbf{(C) } 60 \qquad \textbf{(D) } 90 \qquad \textbf{(E) } 120$

Given an $ABC$ triangle. Let $D$ be an extension of section $AB$ beyond $A$ such that that $AD = BC$ and $E$ is the extension of the section $BC$ beyond $B$ such that $BE = AC$. Prove that the circumcircle of triangle $DEB$ passes through the center of the inscribed circle of triangle $ABC$.

Consider $2n$ points in the plane. Two players $A$ and $B$ alternately choose a point on each move. After $2n$ moves, there are no points left to choose from and the game ends. Add up all the distances between the points chosen by $A$ and add up all the distances between the points chosen by $B$. The one with the highest sum wins. If $A$ starts the game, describe the winner's strategy. Clarification: Consider that all the partial sums of distances between points give different numbers.