Let $ ABC$ be a triangle with $ AB \equal{} AC$. A ray $ Ax$ is constructed in space such that the three planar angles of the trihedral angle $ ABCx$ at its vertex $ A$ are equal. If a point $ S$ moves on $ Ax$, find the locus of the incenter of triangle $ SBC$.

The function $f$ has the property that, for each real number $x,$ \[ f(x)+f(x-1) = x^2. \] If $f(19)=94,$ what is the remainder when $f(94)$ is divided by 1000?

Let $X= \{A_1, A_2, A_3, A_4\}$ be a set of four distinct points in the plane. Show that there exists a subset $Y$ of $X$ with the property that there is no (closed) disk $K$ such that $K\cap X = Y$.

Kevin runs uphill at a speed that is $4$ meters per second slower than his speed when he runs downhill. Kevin takes a total of $80$ seconds to run up and down a hill on one path. Given that the path is $300$ meters long (he travels $600$ meters total), find how long Kevin takes to run up the hill in seconds.

Let $P (x)$ be a polynomial with integer coefficients and $P (n) =m$ for some integers $n, m$ ($m \ne 10$). Prove that $P (n + km)$ is divisible by $m$ for any integer $k$.

Let $a_1, a_2, a_3, b_1, b_2, b_3, c_1, c_2, c_3$ be nine strictly positive real numbers. We set \[S_1 = a_1b_2c_3, \quad S_2 = a_2b_3c_1, \quad S_3 = a_3b_1c_2;\]\[T_1 = a_1b_3c_2, \quad T_2 = a_2b_1c_3, \quad T_3 = a_3b_2c_1.\] Suppose that the set $\{S1, S2, S3, T1, T2, T3\}$ has at most two elements. Prove that \[S_1 + S_2 + S_3 = T_1 + T_2 + T_3.\]

Six points in general position are given in the space. For each two of them color red the common points (if they exist) of the segment between these points and the surface of the tetrahedron formed by four remaining points. Prove that the number of red points is even.

Wanda the Worm likes to eat Pascal's triangle. One day, she starts at the top of the triangle and eats $\textstyle\binom{0}{0}=1$. Each move, she travels to an adjacent positive integer and eats it, but she can never return to a spot that she has previously eaten. If Wanda can never eat numbers $a,b,c$ such that $a+b=c$, prove that it is possible for her to eat 100,000 numbers in the first 2011 rows given that she is not restricted to traveling only in the first 2011 rows. (Here, the $n+1$st row of Pascal's triangle consists of entries of the form $\textstyle\binom{n}{k}$ for integers $0\le k\le n$. Thus, the entry $\textstyle\binom{n}{k}$ is considered adjacent to the entries $\textstyle\binom{n-1}{k-1}$, $\textstyle\binom{n-1}{k}$, $\textstyle\binom{n}{k-1}$, $\textstyle\binom{n}{k+1}$, $\textstyle\binom{n+1}{k}$, $\textstyle\binom{n+1}{k+1}$.) [i]Linus Hamilton.[/i]

On a blackboard triangle $ABC$ is drawn. Vlad draws a random point $D$ inside it and then reflects $A,C,B$ across the midpoints of $CD, BD, AD$, gets $C_1, A_1, B_1$. When Vlad wasn't looking at the board, Dima deleted from it everything, except for $A_1,B_1,C_1$. Can Vlad now using only chalk, ruler and compass draw the original point $D$?

Let $ABCDE$ be a convex pentagon with $CD= DE$ and $\angle EDC \ne 2 \cdot \angle ADB$. Suppose that a point $P$ is located in the interior of the pentagon such that $AP =AE$ and $BP= BC$. Prove that $P$ lies on the diagonal $CE$ if and only if area $(BCD)$ + area $(ADE)$ = area $(ABD)$ + area $(ABP)$. (Hungary)

Real numbers $x, y > 1$ are chosen such that the three numbers \[\log_4x, \; 2\log_xy, \; \log_y2\] form a geometric progression in that order. If $x + y = 90$, then find the value of $xy$.

In an acute triangle $ABC$ the point $O{}$ is the circumcenter, $H_1$ is the foot of the perpendicular from $A{}$ onto $BC$, and $M_H$ and $N_H$ are the projections of $H_1$ on $AC$ and $AB{}$, respectively. Prove that the polyline $M_HON_H$ divides the triangle $ABC$ in two figures of equal area. [i]Proposed by I. A. Kushner[/i]

Let $P(x)$ be a non-zero polynomial with real coefficient so that $P(0)=0$.Prove that for any positive real number $M$ there exist a positive integer $d$ so that for any monic polynomial $Q(x)$ with degree at least $d$ the number of integers $k$ so that $|P(Q(k))| \le M$ is at most equal to the degree of $Q$.

For a quadrilateral $ABCD$, we call a square $amazing$ if all of its sides(extended if necessary) pass through distinct vertices of $ABCD$(no side passing through 2 vertices). Prove that for an arbitrary $ABCD$ such that its diagonals are not perpendicular, there exist at least 6 $amazing$ squares

Five people are standing in a straight line, and the distance between any two people is a unique positive integer number of units. Find the least possible distance between the leftmost and rightmost people in the line in units.

A five-digit palindrome is a positive integer with respective digits $abcba$, where $a$ is non-zero. Let $S$ be the sum of all five-digit palindromes. What is the sum of the digits of $S$? $\textbf{(A) }9\qquad \textbf{(B) }18\qquad \textbf{(C) }27\qquad \textbf{(D) }36\qquad \textbf{(E) }45\qquad$