What is the last two digits of base-$3$ representation of $2005^{2003^{2004}+3}$? $ \textbf{(A)}\ 21 \qquad\textbf{(B)}\ 01 \qquad\textbf{(C)}\ 11 \qquad\textbf{(D)}\ 02 \qquad\textbf{(E)}\ 22 $

Let $Z_1,Z_2,\cdots ,Z_n$ be complex numbers satisfying $|Z_1|+|Z_2|+\cdots +|Z_n|=1$. Show that there exist some among the $n$ complex numbers such that the modulus of the sum of these complex numbers is not less than $1/6$.

Let $a, b, c$ be positive real numbers such that $abc = 1$. Prove that $$\sqrt{\frac{a+b}{b+1}}+\sqrt{\frac{b+c}{c+1}}+\sqrt{\frac{c+a}{a+1}} \ge 3$$

What is the remainder when $7^{8^9}$ is divided by $1000?$

In triangle $ABC$, $\angle C = 30^{\circ}$, $O$ and $I$ are the circumcenter and incenter respectively, Points $D \in AC$ and $E \in BC$, such that $AD = BE = AB$. Prove that $OI = DE$ and $OI \bot DE$.

A semicircle with diameter $AB = 2r$ is divided into two sectors by an arbitrary radius. To each of the sectors a circle is inscribed. These two circles touch A$B$ at $S$ and $T$. Show that $ST \ge 2r(\sqrt{2}-1)$.

The integers from $1$ to $n$ are written, one on each of $n$ cards. The first player removes one card. Then the second player removes two cards with consecutive integers. After that the first player removes three cards with consecutive integers. Finally, the second player removes four cards with consecutive integers. What is th smallest value of $n$ for which the second player can ensure that he competes both his moves?

Let $F=\{1,2,...,100\}$ and let $G$ be any $10$-element subset of $F$. Prove that there exist two disjoint nonempty subsets $S$ and $T$ of $G$ with the same sum of elements.

Consider an acute triangle $ABC$. Let $D$, $E$ and $F$ be the feet of the altitudes through vertices $A$, $B$ and $C$. Denote by $A'$, $B'$, $C'$ the projections of $A$, $B$, $C$ onto lines $EF$, $FD$, $DE$, respectively. Further, let $H_D$, $H_E$, $H_F$ be the orthocenters of triangles $DB'C'$, $EC'A'$, $FA'B'$. Show that $$H_DB^2 + H_EC^2 + H_FA^2 = H_DC^2 + H_EA^2 + H_FB^2.$$

Let $F(x_1,..., x_n)$ be a polynomial with real coefficients in $ n > 1$ “indeterminate” variables $x_1,..., x_n$. We say that $F$ is $n$-[i]alternating [/i]if for all integers $1 \le i < j \le n$, $$F(x_1,..., x_i,..., x_j,..., x_n) = - F(x_1,..., x_j,..., x_i,..., x_n),$$ i.e. swapping the order of indeterminates $x_i, x_j$ flips the sign of the polynomial. For example, $x^2_1x_2 - x^2_2x_1$ is $2$-alternating, whereas $x_1x_2x_3 +2x_2x_3$ is not $3$-alternating. [i]Note: two polynomials $P(x_1,..., x_n)$ and $Q(x_1,..., x_n)$ are considered equal if and only if each monomial constituent $ax^{k_1}_1... x^{k_n}_n$ of $P$ appears in $Q$ with the same coefficient $a$, and vice versa. This is equivalent to saying that $P(x_1,..., x_n) = 0$ if and only if every possible monomial constituent of $P$ has coefficient $0$. [/i] (1) Compute a $3$-alternating polynomial of degree $3$. (2) Prove that the degree of any nonzero $n$-alternating polynomial is at least ${n \choose 2}$.

Prove that there do not exist polynomials $ P$ and $ Q$ such that \[ \pi(x)\equal{}\frac{P(x)}{Q(x)}\] for all $ x\in\mathbb{N}$.

Let $S = \{(x,y) | x = 1, 2, \ldots, 1993, y = 1, 2, 3, 4\}$. If $T \subset S$ and there aren't any squares in $T.$ Find the maximum possible value of $|T|.$ The squares in T use points in S as vertices.

For each natural number $x$, let $S(x)$ be the sum of its digits. Find the smallest natural number $n$ such that $9S(n) = 16S(2n)$.

Given a right circular cone and a point $A$. Find the set of vertices of cones equal to the given one, with axes parallel to that of the given one, and with $A$ inside them. We shall assume that the cone is infinite in one side.

Given $n$ non-negative real numbers, $n\geq 3$, such that the sum of the $n$ numbers is less than or equal to $3$ and the sum of the squares of the $n$ numbers is greater than or equal to $1$, prove that among the $n$ numbers three can be chosen whose sum is greater than or equal to $1$.

Consider the sequence $a_1 = 3$ and $a_{n + 1} =\frac{3a_n^2+1}{2}-a_n$ for $n = 1 ,2 ,...$. Prove that if $n$ is a power of $3$ then $n$ divides $a_n$ .

Solve the system of equations: $$\begin{cases} \log_{2} x + \log_{4} y + \log_{4} z =2 \\ \log_{3} y + \log_{9} z + \log_{9} x =2 \\ \log_{4} z + \log_{16} x + \log_{16} y =2\end{cases}$$

In $\varDelta{ABC}$,the excircle of $A$ is tangent to segment $BC$,line $AB$ and $AC$ at $E,D,F$ respectively.$EZ$ is the diameter of the circle.$B_1$ and $C_1$ are on $DF$, and $BB_1\perp{BC}$,$CC_1\perp{BC}$.Line $ZB_1,ZC_1$ intersect $BC$ at $X,Y$ respectively.Line $EZ$ and line $DF$ intersect at $H$,$ZK$ is perpendicular to $FD$ at $K$.If $H$ is the orthocenter of $\varDelta{XYZ}$,prove that:$H,K,X,Y$ are concyclic.

Let $\Delta ABC$ be an acute-angled triangle with $AB < AC$, $H$ be a point on $BC$ such that $AH\ \bot BC$ and $G$ be the centroid of $\Delta ABC$. Let $P,Q$ be the point of tangency of the inscribed circle of $\Delta ABC$ with $AB,AC$, correspondingly. Define $M,N$ to be the midpoint of $PB,QC$, correspondingly. Let $D,E$ be points on the inscribed circle of $\Delta ABC$ such that $\angle BDH + \angle ABC = 180^{\circ}$, $\angle CEH + \angle ACB = 180^{\circ}$. Prove that lines $MD,NE,HG$ share a common point.

Let $p_1, p_2, \ldots, p_{25}$ are primes which don’t exceed 2004. Find the largest integer $T$ such that every positive integer $\leq T$ can be expressed as sums of distinct divisors of $(p_1\cdot p_2 \cdot \ldots \cdot p_{25})^{2004}.$

A positive integer is called [i]beautiful[/i] if it can be represented in the form $\dfrac{x^2+y^2}{x+y}$ for two distinct positive integers $x,y$. A positive integer that is not beautiful is [i]ugly[/i]. a) Prove that $2014$ is a product of a beautiful number and an ugly number. b) Prove that the product of two ugly numbers is also ugly.

Let $f: \mathbb{R} \to \mathbb{R}$ be a non-decreasing function such that $f(y) - f(x) < y - x$ for all real numbers $x$ and $y > x$. The sequence $u_1,u_2,\ldots$ of real numbers is such that $u_{n+2} = f(u_{n+1}) - f(u_n)$ for all $n\geq 1$. Prove that for any $\varepsilon > 0$ there exists a positive integer $N$ such that $|u_n| < \varepsilon$ for all $n\geq N$.

Let $a,b,c$ be positive real numbers. Prove that \[\frac{2a^2}{b+c} + \frac{2b^2}{c+a} + \frac{2c^2}{a+b} \geq a+b+c\](this is, of course, a joke!) [b]EDITED with exponent 2 over c[/b]

A linear binomial $l(z) = Az + B$ with complex coefficients $A$ and $B$ is given. It is known that the maximal value of $|l(z)|$ on the segment $-1 \leq x \leq 1$ $(y = 0)$ of the real line in the complex plane $z = x + iy$ is equal to $M.$ Prove that for every $z$ \[|l(z)| \leq M \rho,\] where $\rho$ is the sum of distances from the point $P=z$ to the points $Q_1: z = 1$ and $Q_3: z = -1.$

Consider the set of 30 parabolas defined as follows: all parabolas have as focus the point (0,0) and the directrix lines have the form $y=ax+b$ with a and b integers such that $a\in \{-2,-1,0,1,2\}$ and $b\in \{-3,-2,-1,1,2,3\}$. No three of these parabolas have a common point. How many points in the plane are on two of these parabolas? ${ \textbf{(A)}\ 720\qquad\textbf{(B)}\ 760\qquad\textbf{(C)}\ 810\qquad\textbf{(D}}\ 840\qquad\textbf{(E)}\ 870 $