Let be three complex numbers $ z,t,u, $ whose affixes in the complex plane form a triangle $ \triangle . $ [b]a)[/b] Let be three non-complex numbers $ a,b,c $ that sum up to $ 0. $ Prove that $$ |az+bt+cu|=|at+bu+cz|=|au+bz+ct| $$ if $ \triangle $ is equilateral. [b]b)[/b] Show that $ \triangle $ is equilateral if $$ |z+2t-3u|=|t+2u-3z|=|u+2z-3t| . $$

The triangle $ABC$ is given. On the arc $BC$ of its circumscribed circle, which does not contain point $A$, the variable point $X$ is selected, and on the rays $XB$ and $XC$, the variable points $Y$ and $Z$, respectively, so that $XA = XY = XZ$. Prove that the line $YZ$ passes through a fixed point. [i]Proposed by A. Kuznetsov[/i]

Given a triangle $ABC$. Construct a point $D$ on the side $AB$ and point $E$ on the side $AC$ so that $BD = CE$ and $\angle ADC = \angle BEC$

Let $a,b$ be positive real numbers satisfying $2ab=a-b$. Denote for any positive integer $k$ $x_k$ and $y_k$ to be the closest integer to $ak$ and $bk$, respectively (if there are two closest integers, choose the larger one). Prove that any positive integer $n$ appears in the sequence $(x_k)_{k\ge 1}$ if and only if it appears at least three times in the sequence $(y_k)_{k\ge 1}$.

On the planet Brick, which has the shape of a rectangular parallelepiped with edges of $1$ km,$ 2$ km and $4$ km, the Little Prince built a house in the center of the largest face. What is the distance from the house to the most remote point on the planet? (The distance between two points on the surface of a planet is defined as the length of the shortest path along the surface connecting these points.)

Calculate the following indefinite integrals. [1] $\int \frac{dx}{e^x-e^{-x}}$ [2] $\int e^{-ax}\cos 2x dx\ (a\neq 0)$ [3] $\int (3^x-2)^2 dx$ [4] $\int \frac{x^4+2x^3+3x^2+1}{(x+2)^5}dx$ [5] $\int \frac{dx}{1-\cos x}dx$

An infinite increasing arithmetical progression consists of positive integers and contains a perfect cube. Prove that this progression also contains a term which is a perfect cube but not a perfect square.

On a table there are 2004 boxes, and in each box a ball lies. I know that some the balls are white and that the number of white balls is even. In each case I may point to two arbitrary boxes and ask whether in the box contains at least a white ball lies. After which minimum number of questions I can indicate two boxes for sure, in which white balls lie?

Let $ABCD$ be a cyclic quadrilateral. The diagonals $AC$ and $BD$ meet at $P$, and $DA $ and $CB$ meet at $Q$. Suppose $PQ$ is perpendicular to $AC$. Let $E$ be the midpoint of $AB$. Prove that $PE$ is perpendicular to $BC$.

The water city of Platense consists of many platforms and bridges between them. Each bridge connects two platforms and there is not two bridges connecting the same two platforms. The mayor wants to switch some bridges by a series of moves in the following way: if there are three platforms $A,B,C$ and bridges $AB$ and $AC$ ([b]no[/b] bridge $BC$), he can switch bridge $AB$ to a bridge $BC$. A configuration of bridges is [i]good[/i] if it is possible to go to any platfom from any platform using only bridges. Starting in a good configuration, prove that the mayor can reach any other good configuration, whose the quantity of bridges is the same, using the allowed moves.

In the expansion of $(2x +3y)^{20}$, find the number of coefficients divisible by $144$. [i]Proposed by Hannah Shen[/i]

The graph of $x^2-4y^2=0$ is: ${{ \textbf{(A)}\ \text{a parabola} \qquad\textbf{(B)}\ \text{an ellipse} \qquad\textbf{(C)}\ \text{a pair of straight lines} \qquad\textbf{(D)}\ \text{a point} }\qquad\textbf{(E)}\ \text{none of these} } $

Scientist have succeeded to find new numbers between real numbers with strong microscopes. Now real numbers are extended in a new larger system we have an order on it (which if induces normal order on $ \mathbb R$), and also 4 operations addition, multiplication,... and these operation have all properties the same as $ \mathbb R$. [img]http://i14.tinypic.com/4tk6mnr.png[/img] a) Prove that in this larger system there is a number which is smaller than each positive integer and is larger than zero. b) Prove that none of these numbers are root of a polynomial in $ \mathbb R[x]$.

Done with her new problems, Wendy takes a break from math. Still without any fresh reading material, she feels a bit antsy. She starts to feel annoyed that Michael's loose papers clutter the family van. Several of them are ripped, and bits of paper litter the floor. Tired of trying to get Michael to clean up after himself, Wendy spends a couple of minutes putting Michael's loose papers in the trash. "That seems fair to me," confirms Hannah encouragingly. While collecting Michael's scraps, Wendy comes across a corner of a piece of paper with part of a math problem written on it. There is a monic polynomial of degree $n$, with real coefficients. The first two terms after $x^n$ are $a_{n-1}x^{n-1}$ and $a_{n-2}x^{n-2}$, but the rest of the polynomial is cut off where Michael's page is ripped. Wendy barely makes out a little of Michael's scribbling, showing that $a_{n-1}=-a_{n-2}$. Wendy deciphers the goal of the problem, which is to find the sum of the squares of the roots of the polynomial. Wendy knows neither the value of $n$, nor the value of $a_{n-1}$, but still she finds a [greatest] lower bound for the answer to the problem. Find the absolute value of that lower bound.

In an acute-angled triangle $ABC$, the point $O$ is the center of the circumcircle, and the point $H$ is the orthocenter. It is known that the lines $OH$ and $BC$ are parallel, and $BC = 4OH $. Find the value of the smallest angle of triangle $ ABC $. (Black Maxim)

Let $ABC$ be a triangle with centroid $G$ and $BC = 3$. If $ABC$ is similar to $GAB$, compute the area of $ABC$.

Let $ABCD$ be a convex quadrilateral with $\angle ABC>90$, $CDA>90$ and $\angle DAB=\angle BCD$. Denote by $E$ and $F$ the reflections of $A$ in lines $BC$ and $CD$, respectively. Suppose that the segments $AE$ and $AF$ meet the line $BD$ at $K$ and $L$, respectively. Prove that the circumcircles of triangles $BEK$ and $DFL$ are tangent to each other. $\emph{Slovakia}$

In the convex pentagon $ ABCDE,$ the sides $ BC, CD, DE$ are equal. Moreover each diagonal of the pentagon is parallel to a side ($ AC$ is parallel to $ DE$, $ BD$ is parallel to $ AE$ etc.). Prove that $ ABCDE$ is a regular pentagon.

Let $\leftarrow$ denote the left arrow key on a standard keyboard. If one opens a text editor and types the keys "ab$\leftarrow$ cd $\leftarrow \leftarrow$ e $\leftarrow \leftarrow$ f", the result is "faecdb". We say that a string $B$ is [i]reachable[/i] from a string $A$ if it is possible to insert some amount of $\leftarrow$'s in $A$, such that typing the resulting characters produces $B$. So, our example shows that "faecdb" is reachable from "abcdef". Prove that for any two strings $A$ and $B$, $A$ is reachable from $B$ if and only if $B$ is reachable from $A$.

$k$ is a positive integer, $R_{n}={-k, -(k-1),..., -1, 1,..., k-1, k}$ for $n=2k$ $R_{n}={-k, -(k-1),..., -1, 0, 1,..., k-1, k}$ for $n=2k+1$. A mechanism consists of some marbles and white/red ropes that connects some marble pairs. If each one of the marbles are written on some numbers from $R_{n}$ with the property that any two connected marbles have different numbers on them, we call it [i]nice labeling[/i]. If each one of the marbles are written on some numbers from $R_{n}$ with the properties that any two connected marbles with a white rope have different numbers on them and any two connected marbles with a red rope have two numbers with sum not equal to $0$, we call it [i]precise labeling[/i]. $n\geq{3}$, if every mechanism that is labeled [i]nicely[/i] with $R_{n}$, could be labeled [i]precisely[/i] with $R_{m}$, what is the minimal value of $m$?

Let $n\geqslant 3$ be a positiv integer. Ana chooses the positive integers $a_1,a_2,\ldots,a_n$ and for any non-empty subset $A\subseteq\{1,2,\ldots,n\}$ she computes the sum \[s_A=\sum_{k \in A}a_k.\]She orders these sums $s_1\leqslant s_2\leqslant\cdots\leqslant s_{2^n-1}.$ Prove that there exists a subset $B\subseteq\{1,2,\ldots,2^n-1\}$ with $2^{n-2}+1$ elements such that, regardless of the integers $a_1,a_2,\ldots,a_n$ chosen by Ana, these can be determined by only knowing the sums $s_i$ with $i\in B.$

It is known that there are polyhedrons whose faces are more numbered than the vertices. Find the smallest number of triangular faces that such a polyhedron can have.

Let $f$ be a function from R to R. Suppose we have: (1) $f(0)=0$ (2) For all $x, y \in (-\infty, -1) \cup (1, \infty)$, we have $f(\frac{1}{x})+f(\frac{1}{y})=f(\frac{x+y}{1+xy})$. (3) If $x \in (-1,0)$, then $f(x) > 0$. Prove: $\sum_{n=1}^{+\infty} f(\frac{1}{n^2+7n+11}) > f(\frac12)$ with $n \in N^+$.

Let $n$ be an odd integer greater than 1 and let $c_1, c_2, \ldots, c_n$ be integers. For each permutation $a = (a_1, a_2, \ldots, a_n)$ of $\{1,2,\ldots,n\}$, define $S(a) = \sum_{i=1}^n c_i a_i$. Prove that there exist permutations $a \neq b$ of $\{1,2,\ldots,n\}$ such that $n!$ is a divisor of $S(a)-S(b)$.

Two different positive numbers $ a$ and $ b$ each differ from their reciprocals by 1. What is $ a \plus{} b$? \[ \textbf{(A) } 1 \qquad \textbf{(B) } 2 \qquad \textbf{(C) } \sqrt {5} \qquad \textbf{(D) } \sqrt {6} \qquad \textbf{(E) } 3 \]