Let $ a$, $ a'$, $ b$, and $ b'$ be real numbers with $ a$ and $ a'$ nonzero. The solution to $ ax \plus{} b \equal{} 0$ is less than the solution to $ a'x \plus{} b' \equal{} 0$ if and only if $ \textbf{(A)}\ a'b < ab' \qquad \textbf{(B)}\ ab' < a'b \qquad \textbf{(C)}\ ab < a'b' \qquad \textbf{(D)}\ \frac {b}{a} < \frac {b'}{a'}$ $ \textbf{(E)}\ \frac {b'}{a'} < \frac {b}{a}$

Determine all $ f:R\rightarrow R $ such that $$ f(xf(y)+y^3)=yf(x)+f(y)^3 $$

Let $a_0,a_1,\ldots$ be an infinite sequence of positive numbers. Prove that the inequality $1+a_n>\sqrt[n]2a_{n-1}$ holds for infinitely many positive integers $n$.

Let side $BC$ of $\bigtriangleup ABC$ be the diameter of a semicircle which cuts $AB$ and $AC$ at $D$ and $E$ respectively. $F$ and $G$ are the feet of the perpendiculars from $D$ and $E$ to $BC$ respectively. $DG$ and $EF$ intersect at $M$. Prove that $AM \perp BC$.

$\frac{2}{25}=$ $\text{(A)}\ .008 \qquad \text{(B)}\ .08 \qquad \text{(C)}\ .8 \qquad \text{(D)} 1.25 \qquad \text{(E)}\ 12.5$

A triangle is given whose altitudes' lengths are $\frac{1}{5},\frac{1}{5},\frac{1}{8}$. Evaluate the triangle's area.

A straight line is drawn through an arbitrary internal point $K$ of the trapezoid $ABCD$, intersecting the bases of $BC$ and $AD$ at points $P$ and $Q$, respectively. The circles circumscribed around the triangles $BPK$ and $DQK$ intersect, besides the point $K$, also at the point $L$. Prove that the point $L$ lies on the diagonal $BD$.

For a positive integer $n$, consider all nonincreasing functions $f : \{1,\hdots,n\}\to\{1,\hdots,n\}$. Some of them have a fixed point (i.e. a $c$ such that $f(c) = c$), some do not. Determine the difference between the sizes of the two sets of functions. [i]Remark.[/i] A function $f$ is [i]nonincreasing[/i] if $f(x) \geq f(y)$ holds for all $x \leq y$

Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ with the property that $$f(x)f(y) = (xy - 1)^2f\left(\frac{x + y - 1}{xy - 1}\right)$$ for all real numbers $x, y$ with $xy \neq 1$.

Three wise men live in an old region. As they do not always agree on their advice to the king, he decided to stay with the wisest of the three, killing the others. To decide which of them was saved, performed the following test: He put each sage a hat, without him seeing its color, then locked them in a common room and told them: $\bullet$ Only the first to guess the color of his own hat will save his life. $\bullet$ In total there are five hats, three are white and two are black. $\bullet$ You cannot communicate with each other, but you can look at each other. After a long time, one of the wise men says: "I know the color of my hat." What color did they have? How did you figure it out? What color were the other hats used?

Solve the following system for real $x,y,z$ \[ \{ \begin{array}{ccc} x+ y -z & =& 4 \\ x^2 - y^2 + z^2 & = & -4 \\ xyz & =& 6. \end{array} \]

There exists some integers $n,a_1,a_2,\ldots,a_{2012}$ such that \[ n^2=\sum_{1 \leq i \leq 2012}{{a_i}^{p_i}} \] where $p_i$ is the i-th prime ($p_1=2,p_2=3,p_3=5,p_4=7,\ldots$) and $a_i>1$ for all $i$?

Done working on his sand castle design, Joshua sits down and starts rolling a $12$-sided die he found when cleaning the storage shed. He rolls and rolls and rolls, and after $17$ rolls he finally rolls a $1$. Just $3$ rolls later he rolls the first $2\textit{ after}$ that first roll of $1$. $11$ rolls later, Joshua rolls the first $3\textit{ after}$ the first $2$ that he rolled $\textit{after}$ the first $1$ that he rolled. His first $31$ rolls make the sequence \[4,3,11,3,11,8,5,2,12,9,5,7,11,3,6,10,\textbf{1},8,3,\textbf{2},10,4,2,8,1,9,7,12,11,4,\textbf{3}.\] Joshua wonders how many times he should expect to roll the $12$-sided die so that he can remove all but $12$ of the numbers from the entire sequence of rolls and (without changing the order of the sequence), be left with the sequence \[1,2,3,4,5,6,7,8,9,10,11,12.\] What is the expected value of the number of times Joshua must roll the die before he has such a sequence? (Assume Joshua starts from the beginning - do $\textit{not}$ assume he starts by rolling the specific sequence of $31$ rolls above.)

Triangle $ABC$ has $\overline{AB} = 5, \overline{BC} = 4, \overline{CA} = 6$. Points $D$ and $E$ are on sides $AB$ and $AC$, respectively, such that $\overline{AD} = \overline{AE} = \overline{BC}$. Let $CD$ and $BE$ intersect at $F$ and let $AF$ and $DE$ intersect at $G$. The length of $FG$ can be expressed in the form $\tfrac{a\sqrt{b}}{c}$ in simplified form. What is $a + b + c$?

Let $\lambda$ be a real number such that the inequality $0 <\sqrt {2002} - \frac {a} {b} <\frac {\lambda} {ab}$ holds for an infinite number of pairs $ (a, b)$ of positive integers. Prove that $\lambda \geq 5 $.

Let $a,b,c$ be positive real numbers. Prove that \[ \frac{2a}{a^{2}+bc}+\frac{2b}{b^{2}+ca}+\frac{2c}{c^{2}+ab}\leq\frac{a}{bc}+\frac{b}{ca}+\frac{c}{ab} \]

Find all pairs of natural numbers $ (a, b)$ such that $ 7^a \minus{} 3^b$ divides $ a^4 \plus{} b^2$. [i]Author: Stephan Wagner, Austria[/i]

If all the logarithms are real numbers, the equality \[ \log(x+3)+\log (x-1) = \log (x^2-2x-3)\] is satisfied for: $\textbf{(A)}\ \text{all real values of}\ x \\ \qquad\textbf{(B)}\ \text{no real values of}\ x \\ \qquad\textbf{(C)}\ \text{all real values of}\ x\ \text{except}\ x=0 \\ \qquad\textbf{(D)}\ \text{no real values of}\ x\ \text{except}\ x=0 \\ \qquad\textbf{(E)}\ \text{all real values of}\ x\ \text{except}\ x=1$

Find the greatest integer less than $$\sqrt{10}+ \sqrt{80}.$$

Alice has a map of Wonderland, a country consisting of $n \geq 2$ towns. For every pair of towns, there is a narrow road going from one town to the other. One day, all the roads are declared to be “one way” only. Alice has no information on the direction of the roads, but the King of Hearts has offered to help her. She is allowed to ask him a number of questions. For each question in turn, Alice chooses a pair of towns and the King of Hearts tells her the direction of the road connecting those two towns. Alice wants to know whether there is at least one town in Wonderland with at most one outgoing road. Prove that she can always find out by asking at most $4n$ questions.

Two circles with radius one are drawn in the coordinate plane, one with center $(0,1)$ and the other with center $(2, y)$, for some real number y between $0$ and $1$. A third circle is drawn so as to be tangent to both of the other two circles as well as the $x$ axis. What is the smallest possible radius for this third circle?

The bisectors $AA_1$ and $CC_1$ of the right triangle $ABC$ ($\angle B = 90^o$) intersect at point $I$. The line passing through the point $C_1$ and perpendicular on the line $AA_1$ intersects the line that passes through $A_1$ and is perpendicular on $CC_1$, at the point $K$. Prove that the midpoint of the segment $KI$ lies on segment $AC$.

Suppose that two circles $\alpha, \beta$ with centers $P,Q$, respectively , intersect orthogonally at $A$,$B$. Let $CD$ be a diameter of $\beta$ that is exterior to $\alpha$. Let $E,F$ be points on $\alpha$ such that $CE,DF$ are tangent to $\alpha$ , with $C,E$ on one side of $PQ$ and $D,F$ on the other side of $PQ$. Let $S$ be the intersection of $CF,AQ$ and $T$ be the intersection of $DE,QB$. Prove that $ST$ is parallel to $CD$ and is tangent to $\alpha$

Let $AD$ be the common chord of two equal-sized circles $O_1$ and $O_2$. Let $B$ and $C$ be points on $O_1$ and $O_2$, respectively, so that $D$ lies on the segment $BC$. Assume that $AB = 15, AD = 13$ and $BC = 18$, what is the ratio between the inradii of $\vartriangle ABD$ and $\vartriangle ACD$?

Find the last five digits of $1^{100}+2^{100}+3^{100}+...+999999^{100}$