Let $ABCA'B'C'$ a right triangular prism with the bases equilateral triangles. A plane $\alpha$ containing point $A$ intersects the rays $BB'$ and $CC'$ at points E and $F$, so that $S_ {ABE} + S_{ACF} = S_{AEF}$. Determine the measure of the angle formed by the plane $(AEF)$ with the plane $(BCC')$.

Alice and Bob are playing in the forest. They have six sticks of length 1, 2, 3, 4, 5, 6 inches. Somehow, they have managed to arrange these sticks, such that they form the sides of an equiangular hexagon. Compute the sum of all possible values of the area of the hexagon.

Find the smallest natural number which is a multiple of $2009$ and whose sum of (decimal) digits equals $2009$ [i]Proposed by Milos Milosavljevic[/i]

Let $\Gamma_1$ be a circle and $P$ a point outside of $\Gamma_1$. The tangents from $P$ to $\Gamma_1$ touch the circle at $A$ and $B$. Let $M$ be the midpoint of $PA$ and $\Gamma_2$ the circle through $P$, $A$ and $B$. Line $BM$ cuts $\Gamma_2$ at $C$, line $CA$ cuts $\Gamma_1$ at $D$, segment $DB$ cuts $\Gamma_2$ at $E$ and line $PE$ cuts $\Gamma_1$ at $F$, with $E$ in segment $PF$. Prove lines $AF$, $BP$, and $CE$ are concurrent.

Cards numbered from 1 to $2^n$ are distributed among $k$ children, $1\leq k\leq 2^n$, so that each child gets at least one card. Prove that the number of ways to do that is divisible by $2^{k-1}$ but not by $2^k$. [i] M. Ivanov [/i]

Let $f:\mathbb R\to\mathbb R$ be a continuous function. Do there exist continuous functions $g:\mathbb R\to\mathbb R$ and $h:\mathbb R\to\mathbb R$ such that $f(x)=g(x)\sin x+h(x)\cos x$ holds for every $x\in\mathbb R$?

$ABCD$ is a convex quadrangle, $G$ is its center of gravity as a homogeneous plate (i.e., the intersection point of two lines, each of which connects the centroids of triangles having a common diagonal). a) Suppose that around $ABCD$ we can circumscribe a circle centered on $O$. We define $H$ similarly to $G$, taking orthocenters instead of centroids. Then the points of $H, G, O$ lie on the same line and $HG: GO = 2: 1$. b) Suppose that in $ABCD$ we can inscribe a circle centered on $I$. The Nagel point N of the circumscribed quadrangle is the intersection point of two lines, each of which passes through points on opposite sides of the quadrangle that are symmetric to the tangent points of the inscribed circle relative to the midpoints of the sides. (These lines divide the perimeter of the quadrangle in half). Then $N, G, I$ lie on one straight line, with $NG: GI = 2: 1$.

The incenter and $A$-excenter of $\triangle{ABC}$ is $I$ and $O$. The foot from $A,I$ to $BC$ is $D$ and $E$. The intersection of $AD$ and $EO$ is $X$. The circumcenter of $\triangle{BXC}$ is $P$. Show that the circumcircle of $\triangle{BPC}$ is tangent to the $A$-excircle if $X$ is on the incircle of $\triangle{ABC}$.

There are $2001$ marked points in the plane. It is known that the area of any triangle with vertices at the given points is less than or equal than $1 \ cm^2$. Prove that there exists a triangle with area no more than $4 \ cm^2$, which contains all $2001$ points.

How many complex numbers satisfy the equation $z^{5}=\overline{z}$, where $\overline{z}$ is the conjugate of the complex number $z$? $\textbf{(A)}~2\qquad\textbf{(B)}~3\qquad\textbf{(C)}~5\qquad\textbf{(D)}~6\qquad\textbf{(E)}~7$

Let $\mathfrak K_1$ and $\mathfrak K_2$ be circles centered at $O_1$ and $O_2,$ respectively, meeting at the points $A$ and $B.$ Let $p$ be the line through the point $A$ meeting the circles $\mathfrak K_1$ and $\mathfrak K_2$ again at $C_1$ and $C_2.$ Assume that $A$ lies between $C_1$ and $C_2.$ Denote the intersection of the lines $C_1O_1$ and $C_2O_2$ by $D.$ Prove that the points $C_1, C_2, B$ and $D$ lie on the same circle.

Let $x,y,z$ be complex numbers such that\\ $\hspace{ 2cm} \frac{x}{y+z}+\frac{y}{z+x}+\frac{z}{x+y}=9$\\ $\hspace{ 2cm} \frac{x^2}{y+z}+\frac{y^2}{z+x}+\frac{z^2}{x+y}=64$\\ $\hspace{ 2cm} \frac{x^3}{y+z}+\frac{y^3}{z+x}+\frac{z^3}{x+y}=488$\\ \\ If $\frac{x}{yz}+\frac{y}{zx}+\frac{z}{xy}=\frac{m}{n}$ where $m,n$ are positive integers with $GCD(m,n)=1$, find $m+n$.

You have $14$ coins, dated $1901$ through $1914$. Seven of these coins are real and weigh $1.000$ ounce each. The other seven are counterfeit and weigh $0.999$ ounces each. You do not know which coins are real or counterfeit. You also cannot tell which coins are real by look or feel. Fortunately for you, Zoltar the Fortune-Weighing Robot is capable of making very precise measurements. You may place any number of coins in each of Zoltar's two hands and Zoltar will do the following: [list][*] If the weights in each hand are equal, Zoltar tells you so and returns all of the coins. [*] If the weight in one hand is heavier than the weight in the other, then Zoltar takes one coin, at random, from the heavier hand as tribute. Then Zoltar tells you which hand was heavier, and returns the remaining coins to you.[/list] Your objective is to identify a single real coin that Zoltar has not taken as tribute. Is there a strategy that guarantees this? If so, then describe the strategy and why it works. If not, then prove that no such strategy exists.

Given positive integers $a,b$, let the integers $q,r$, with $0 \leq r < ab$, be such that $a^2 + b^2 = abq + r$. Prove that $q + r \leq ab + 1$ and find all equality cases.

For how many three-element sets of positive integers $\{a,b,c\}$ is it true that $a \times b \times c = 2310$? $\textbf{(A)}\ 32 \qquad \textbf{(B)}\ 36 \qquad \textbf{(C)}\ 40 \qquad \textbf{(D)}\ 43 \qquad \textbf{(E)}\ 45$

Orvin went to the store with just enough money to buy $30$ balloons. When he arrived, he discovered that the store had a special sale on balloons: buy $1$ balloon at the regular price and get a second at $\frac{1}{3}$ off the regular price. What is the greatest number of balloons Orvin could buy? $ \textbf {(A) } 33 \qquad \textbf {(B) } 34 \qquad \textbf {(C) } 36 \qquad \textbf {(D) } 38 \qquad \textbf {(E) } 39$

A block of cheese in the shape of a rectangular solid measures $ 10$ cm by $ 13$ cm by $ 14$ cm. Ten slices are cut from the cheese. Each slice has a width of $ 1$ cm and is cut parallel to one face of the cheese. The individual slices are not necessarily parallel to each other. What is the maximum possible volume in cubic cm of the remaining block of cheese after ten slices have been cut off?

A positive interger number $k$ is called “$t-m$”-property if forall positive interger number $a$, there exists a positive integer number $n$ such that ${{1}^{k}}+{{2}^{k}}+{{3}^{k}}+...+{{n}^{k}} \equiv a (\bmod m).$ a) Find all positive integer numbers $k$ which has $t-20$-property. b) Find smallest positive integer number $k$ which has $t-{{20}^{15}}$-property.

Let $s_1,s_2,s_3,s_4,...$ be a sequence (infinite list) of $1$s and $0$s. For example $1,0,1,0,1,0,...$, that is, $s_n=1$ if $n$ is odd and $s_n=0$ if $n$ is even, is such a sequence. Prove that it is possible to delete infinitely many terms in $s_1,s_2,s_3,s_4,...$ so that the resulting sequence is the original sequence. For the given example, one can delete $s_3,s_4,s_7,s_8,s_{11},s_{12},...$

For each arrangement $X$ of $n$ white and $n$ black balls in a row, let $f(X)$ be the number of times the color changes as one moves from one end of the row to the other. For each $k$ such that $0 < k < n$, show that the number of arrangements $X$ with $f(X) = n -k$ is the same as the number with $f(X) = n + k$.

There is a positive real number $x$ not equal to either $\tfrac{1}{20}$ or $\tfrac{1}{2}$ such that $$\log_{20x} (22x)=\log_{2x} (202x).$$ The value $\log_{20x} (22x)$ can be written as $\log_{10} (\tfrac{m}{n})$, where $m$ and $n$ are relatively prime positive integers. Find $m+n$.

Given a regular pentagon, find the ratio of its diagonal, $d$, to its side, $a$

Prove inequallity : $$1+\frac{1}{2^3}+...+\frac{1}{2015^3}<\frac{5}{4}$$

A $10$ digit number is called interesting if its digits are distinct and is divisible by $11111$. Then find the number of interesting numbers.

Let $ a_1,\ldots,a_n$ be positive reals so that $ a_1\plus{}a_2\plus{}\ldots\plus{}a_n\le\frac n2$. Find the minimal value of $ \sqrt{a_1^2\plus{}\frac1{a_2^2}}\plus{}\sqrt{a_2^2\plus{}\frac1{a_3^2}}\plus{}\ldots\plus{}\sqrt{a_n^2\plus{}\frac1{a_1^2}}$.