Let $ABC$ be an isosceles triangle with base $AB$. We choose a point $P$ inside the triangle on altitude through $C$. The circle with diameter $CP$ intersects the straight line through $B$ and $P$ again at the point $D_P$ and the Straight through $A$ and $C$ one more time at point $E_P$. Prove that there is a point $F$ such that for any choice of $P$ the points $D_P , E_P$ and $F$ lie on a straight line. [i](Walther Janous)[/i]

The infinite sequence $a_1,a_2,a_3,\ldots$ of positive integers is defined as follows: $a_1=1$, and for each $n \ge 2$, $a_n$ is the smallest positive integer, distinct from $a_1,a_2, \ldots , a_{n-1}$ such that: $$\sqrt{a_n+\sqrt{a_{n-1}+\ldots+\sqrt{a_2+\sqrt{a_1}}}}$$ is an integer. Prove that all positive integers appear on the sequence $a_1,a_2,a_3,\ldots$

Show that there exists $n>2$ such that $1991 | 1999 \ldots 91$ (with $n$ 9's).

The quadrilateral $ABCD$ is known to be inscribed in a circle, and that there is a circle with center on side $AD$ tangent to the other three sides. Prove that $AD = AB + CD$.

In a regular square room of side length $2\sqrt{2}$ ft, two cats that can see $2$ feet ahead of them are randomly placed into the four corners such that they do not share the same corner. If the probability that they don't see the mouse, also placed randomly into the room can be expressed as $\frac{a-b\pi}{c},$ where $a,b,c$ are positive integers with a greatest common factor of $1,$ then find $a+b+c.$ [i]Proposed by Ada Tsui[/i]

Prove that $$\sum \limits_{0\leq i<j\leq n}(i+j) {{n}\choose{i}}{{n}\choose{j}}=n\left (2^{2n-1}-{{2n-1}\choose{n}} \right )$$

The numbers $1,2,\ldots,100$ are written in the cells of a $10\times 10$ table, each number is written once. In one move, Nazar may interchange numbers in any two cells. Prove that he may get a table where the sum of the numbers in every two adjacent (by side) cells is composite after at most $35$ such moves. [i]N. Agakhanov[/i]

Consider the sequence $ a_1\equal{}\frac{3}{2}, a_{n\plus{}1}\equal{}\frac{3a_n^2\plus{}4a_n\minus{}3}{4a_n^2}.$ $ (a)$ Prove that $ 1<a_n$ and $ a_{n\plus{}1}<a_n$ for all $ n$. $ (b)$ From $ (a)$ it follows that $ \displaystyle\lim_{n\to\infty}a_n$ exists. Find this limit. $ (c)$ Determine $ \displaystyle\lim_{n\to\infty}a_1a_2a_3...a_n$.

Define a sequence $(a_n)$ by $a_0 =-4 , a_1 =-7$ and $a_{n+2}= 5a_{n+1} -6a_n$ for $n\geq 0.$ Prove that there are infinitely many positive integers $n$ such that $a_n$ is composite.

The classrooms at MIT are each identified with a positive integer (with no leading zeroes). One day, as President Reif walks down the Infinite Corridor, he notices that a digit zero on a room sign has fallen off. Let $N$ be the original number of the room, and let $M$ be the room number as shown on the sign. The smallest interval containing all possible values of $\frac{M}{N}$ can be expressed as $[\frac{a}{b}, \frac{c}{d} )$ where $a,b,c,d$ are positive integers with $\gcd(a,b) = \gcd(c,d) = 1$. Compute $1000a+100b+10c+d$.

Factor the polynomial $P (x) = 1 + x +x^2+...+x^{2^k-1}$

A set of $12$ tokens ---- $3$ red, $2$ white, $1$ blue, and $6$ black ---- is to be distributed at random to $3$ game players, $4$ tokens per player. The probability that some player gets all the red tokens, another gets all the white tokens, and the remaining player gets the blue token can be written as $\frac{m}{n}$, where $m$ and $n$ are relatively prime positive integers. What is $m+n$? $ \textbf{(A) }387 \qquad \textbf{(B) }388 \qquad \textbf{(C) }389 \qquad \textbf{(D) }390 \qquad \textbf{(E) }391 \qquad $

An equilateral triangle is drawn with a side of length $ a$. A new equilateral triangle is formed by joining the midpoints of the sides of the first one. Then a third equilateral triangle is formed by joining the midpoints of the sides of the second; and so on forever. The limit of the sum of the perimeters of all the triangles thus drawn is: $ \textbf{(A)}\ \text{Infinite} \qquad\textbf{(B)}\ 5\frac {1}{4}a \qquad\textbf{(C)}\ 2a \qquad\textbf{(D)}\ 6a \qquad\textbf{(E)}\ 4\frac {1}{2}a$

Two persons, A and B, set up an incantation contest in which they spell incantations (i.e. a finite sequence of letters) alternately. They must obey the following rules: i) Any incantation can appear no more than once; ii) Except for the first incantation, any incantation must be obtained by permuting the letters of the last one before it, or deleting one letter from the last incantation before it; iii)The first person who cannot spell an incantation loses the contest. Answer the following questions: a) If A says '$STAGEPREIMO$' first, then who will win? b) Let $M$ be the set of all possible incantations whose lengths (i.e. the numbers of letters in them) are $2009$ and containing only four letters $A,B,C,D$, each of them appearing at least once. Find the first incantation (arranged in dictionary order) in $M$ such that A has a winning strategy by starting with it.

The sequence $a_1, a_2, a_3, ...$ satisfies that $a_1 = 3$, $a_2 = -1$, $a_na_{n-2} +a_{n-1} = 2$ for all $n \ge 3$. Calculate $a_1 + a_2+ ... + a_{99}$.

Triangle $\Delta ABC$ is inscribed in circle $\Omega$. The tangency point of $\Omega$ and the $A$-mixtilinear circle of $\Delta ABC$ is $T$. Points $E$, $F$ were chosen on $AC$, $AB$ respectively so that $EF\parallel BC$ and $(TEF)$ is tangent to $\Omega$. Let $\omega$ denote the $A$-excircle of $\Delta AEF$, which is tangent to sides $EF$, $AE$, $AF$ at $K$, $Y$, $Z$ respectively. Line $AT$ intersects $\omega$ at two points $P$, $Q$ with $P$ between $A$ and $Q$. Let $QK$ and $YZ$ intersect at $V$, and let the tangent to $\omega$ at $P$ and the tangent to $\Omega$ at $T$ intersect at $U$. Prove that $UV\parallel BC$.