For a positive integer $k$, let $f_1(k)$ be the square of the sum of the digits of $k$. Define $f_{n+1}$ = $f_1 \circ f_n$ . Evaluate $f_{2007}(2^{2006} )$.

Two circles $C_{1}$ and $C_{2}$ intersect in $A$ and $B$. A line passing through $B$ intersects $C_{1}$ in $C$ and $C_{2}$ in $D$. Another line passing through $B$ intersects $C_{1}$ in $E$ and $C_{2}$ in $F$, $(CF)$ intersects $C_{1}$ and $C_{2}$ in $P$ and $Q$ respectively. Make sure that in your diagram, $B, E, C, A, P \in C_{1}$ and $B, D, F, A, Q \in C_{2}$ in this order. Let $M$ and $N$ be the middles of the arcs $BP$ and $BQ$ respectively. Prove that if $CD=EF$, then the points $C,F,M,N$ are cocylic in this order.

Find all real numbers $a > 1$ such that there exists an integer $k \ge 1$ such that the sequence $\{x_n\}_{n\ge 1}$ formed with the first $k$ digits of the number $\lfloor a^n\rfloor$ is periodical.

For each positive integer $ n$ find all positive integers $ m$ for which there exist positive integers $ x_1<x_2<...<x_n$ with: $ \frac{1}{x_1}\plus{}\frac{2}{x_2}\plus{}...\plus{}\frac{n}{x_n}\equal{}m.$

The zeroes of the function $f(x)=x^2-ax+2a$ are integers. What is the sum of all possible values of $a$? $\textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }16\qquad\textbf{(D) }17\qquad\textbf{(E) }18$

An Indian raga has two kinds of notes: a short note, which lasts for $1$ beat and a long note, which lasts for $2$ beats. For example, there are $3$ ragas which are $3$ beats long; $3$ short notes, a short note followed by a long note, and a long note followed by a short note. How many Indian ragas are 11 beats long?

Prove that in every triangle for each of its altitudes: If you project the foof of one altitude on the other two altitudes and on the other two sides of the triangle, those four projections lie on the same line.

For the function $$ g(a) = \underbrace{\max}_{x\in R} \left\{ \cos x + \cos \left(x + \frac{\pi}{6} \right)+ \cos \left(x + \frac{\pi}{4} \right) + cos(x + a) \right\},$$ let $b \in R$ be the input that maximizes $g$. If $\cos^2 b = \frac{m+\sqrt{n}+\sqrt{p}-\sqrt{q}}{24}$ for positive integers $m, n, p, q$, find $m + n + p + q$.

There are $ 1993$ towns in a country, and at least $ 93$ roads going out of each town. It's known that every town can be reached from any other town. Prove that this can always be done with no more than $ 62$ transfers.

Let $BM$ be a median of nonisosceles right-angled triangle $ABC$ ($\angle B = 90^o$), and $Ha, Hc$ be the orthocenters of triangles $ABM, CBM$ respectively. Prove that lines $AH_c$ and $CH_a$ meet on the medial line of triangle $ABC$. (D. Svhetsov)

What is the smallest positive integer $n$ such that $\sqrt{n}-\sqrt{n-1}<.01$? $\textbf{(A) }2499\qquad\textbf{(B) }2500\qquad\textbf{(C) }2501\qquad\textbf{(D) }10,000\qquad \textbf{(E) }\text{There is no such integer}$

Let be a real $ 4\times 4 $ real matrix with $ \text{det} \left( A^2-I\right) <0. $ Prove that there is a number $ \alpha\in (-1,1) $ so that $ A+\alpha I $ is singular. [i]Mihai Haivas[/i]

A set of integers is called [b]legendary[/b] if you can reach any integer from it by using the following action multiple times: If the numbers $x,y$ are in the set, we may add the number $xy-y^2-y+x$ to the set. Prove that any legendary set contains at least 8 numbers.

A [i]permutation[/i] of the set of positive integers $[n] = \{1, 2, . . . , n\}$ is a sequence $(a_1 , a_2 , \ldots, a_n ) $ such that each element of $[n]$ appears precisely one time as a term of the sequence. For example, $(3, 5, 1, 2, 4)$ is a permutation of $[5]$. Let $P (n)$ be the number of permutations of $[n]$ for which $ka_k$ is a perfect square for all $1 \leq k \leq n$. Find with proof the smallest $n$ such that $P (n)$ is a multiple of $2010$.

We write $\{a,b,c\}$ for the set of three different positive integers $a, b$, and $c$. By choosing some or all of the numbers a, b and c, we can form seven nonempty subsets of $\{a,b,c\}$. We can then calculate the sum of the elements of each subset. For example, for the set $\{4,7,42\}$ we will find sums of $4, 7, 42,11, 46, 49$, and $53$ for its seven subsets. Since $7, 11$, and $53$ are prime, the set $\{4,7,42\}$ has exactly three subsets whose sums are prime. (Recall that prime numbers are numbers with exactly two different factors, $1$ and themselves. In particular, the number $1$ is not prime.) What is the largest possible number of subsets with prime sums that a set of three different positive integers can have? Give an example of a set $\{a,b,c\}$ that has that number of subsets with prime sums, and explain why no other three-element set could have more.

Let $ ABCD$ be a trapezoid with $ AB$ and $ CD$ parallel, $ \angle D \equal{} 2 \angle B, AD \equal{} 5,$ and $ CD \equal{} 2.$ Then $ AB$ equals A. 7 B. 8 C. 13/2 D. 27/4 E. $ 5 \plus{} \frac{3 \sqrt{2}}{2}$