Show that the sequence \[\binom{2002}{2002},\binom{2003}{2002},\binom{2004}{2002},\ldots \] considred modulo $2002$, is periodic.

Ted flips seven fair coins. there are relatively prime positive integers $m$ and $n$ so that $\frac{m}{n}$ is the probability that Ted flips at least two heads given that he flips at least three tails. Find $m+n$.

Does there exist a continuously differentiable function $f : \mathbb{R} \rightarrow \mathbb{R}$ such that for every $x \in \mathbb{R}$ we have $f(x) > 0$ and $f'(x) = f(f(x))$?

Prove that the equation $ \frac {1}{a} \plus{} \frac {1}{b} \plus{} \frac {1}{c}\plus{}\frac{1}{abc} \equal{} \frac {12}{a \plus{} b \plus{} c}$ has infinitely many solutions $ (a,b,c)$ in natural numbers.

Let $\tau(n)$ denote the number of positive divisors of the positive integer $n$. Prove that there exist infinitely many positive integers $a$ such that the equation $ \tau(an)=n $ does not have a positive integer solution $n$.

Let \(\mathbb{R}^2\) denote the set of points in the Euclidean plane. For points \(A,P\in\mathbb{R}^2\) and a real number \(k\), define the [i]dilation[/i] of \(A\) about \(P\) by a factor of \(k\) as the point \(P+k(A-P)\). Call a sequence of point \(A_0, A_1, A_2,\ldots\in\mathbb{R}^2\) [i]unbounded[/i] if the sequence of lengths \(\left|A_0-A_0\right|,\left|A_1-A_0\right|,\left|A_2-A_0\right|,\ldots\) has no upper bound. Now consider \(n\) distinct points \(P_0,P_1,\ldots,P_{n-1}\in\mathbb{R}^2\), and fix a real number \(r\). Given a starting point \(A_0\in\mathbb{R}^2\), iteratively define \(A_{i+1}\) by dilating \(A_i\) about \(P_j\) by a factor of \(r\), where \(j\) is the remainder of \(i\) when divided by \(n\). Prove that if \(\left|r\right|\geq 1\), then for any starting point \(A_0\in\mathbb{R}^2\), the sequence \(A_0,A_1,A_2,\ldots\) is either periodic or unbounded. [i]Proposed by the ICMC Problem Committee[/i]

Find $ \lim_{n\to\infty} \int_0^1 x^2|\sin n\pi x|\ dx\ (n\equal{}1,\ 2,\cdots)$.

For which integers $n \geq 2$ is it possible to draw $n$ straight lines in the plane in such a way that there are at least $n - 2$ points where exactly three of the lines meet?

Neel and Roshan are going to the Newark Liberty International Airport to catch separate flights. Neel plans to arrive at some random time between 5:30 am and 6:30 am, while Roshan plans to arrive at some random time between 5:40 am and 6:40 am. The two want to meet, however briefly, before going through airport security. As such, they agree that each will wait for $n$ minutes once he arrives at the airport before going through security. What is the smallest $n$ they can select such that they meet with at least 50% probability? The answer will be of the form $a + b\sqrt{c}$ for integers $a$, $b$, and $c$, where $c$ has no perfect square factor other than $1$. Report $a + b + c.$

Calculate $ \int \frac {dx}{x^{2008}(1 \minus{} x)}$

Let $a = (\sqrt2 +\sqrt3 +\sqrt6)(\sqrt2 +\sqrt3 -\sqrt6)(\sqrt3 +\sqrt6 -\sqrt2)(\sqrt6 +\sqrt2 -\sqrt3)$ $b = (\sqrt2 +\sqrt3 +\sqrt5)(\sqrt2 +\sqrt3 -\sqrt5)(\sqrt3 +\sqrt5 -\sqrt2)(\sqrt5 +\sqrt2 -\sqrt3)$ The difference $a - b$ belongs to the set: A. $(-\infty,-4)$ B. $[-4,0)$ C.$\{0\}$ D. $(0,4]$ E. $(4,\infty)$

$ABCDEF$ is a regular hexagon. A frog sarts jumping at $A$, each time it can jump to one of the two adjacent points. If the frog jump to $D$ in no more than five times, it stops. After five jumpings, if the frog hasn't jumped to $D$ yet, it will stop as well. Then the number of different ways to jump is________.

A positive integer $n$ is said to possess Property ($A$) if there exists a positive integer $N$ such that $N^2$ can be written as the sum of the squares of $n$ consecutive positive integers. Is it true that there are infinitely many positive integers which possess Property ($A$)? Justify your answer. (As an example, the number $n = 2$ possesses Property ($A$) since $5^2 = 3^2 + 4^2$).

Find all real solutions to the system of equations $$\begin{cases} x^2 +y^2 = 6z \\ y^2 +z^2 = 6x \\ z^2 +x^2 = 6y \end{cases}$$

Two cirlces $ C_1$ and $ C_2$, with center $ O_1$ and $ O_2$ respectively, intersect at $ A$ and $ B$. Let $ O_1$ lies on $ C_2$. A line $ l$ passes through $ O_1$ but does not pass through $ O_2$. Let $ P$ and $ Q$ be the projection of $ A$ and $ B$ respectively on the line $ l$ and let $ M$ be the midpoint of $ \overline{AB}$. Prove that $ MPQ$ is an isoceles triangle.

The points $A, B, C$ and $D$ lie in this order on the circle $k$. Let $t$ be the tangent at $k$ through $C$ and $s$ the reflection of $AB$ at $AC$. Let $G$ be the intersection of the straight line $AC$ and $BD$ and $H$ the intersection of the straight lines $s$ and $CD$. Show that $GH$ is parallel to $t$.

Let $a, b, c$ be the lengths of the sides of a triangle and $A, B, C$, the opposite angles. Prove that $$Aa + Bb + Cc \ge \frac{Ab + Ac + Ba + Bc + Ca + Cb}{2}$$

$ \frac{10^7}{5 \times 10^4}\equal{}$ \[ \textbf{(A)}\ .002 \qquad \textbf{(B)}\ .2 \qquad \textbf{(C)}\ 20 \qquad \textbf{(D)}\ 200 \qquad \textbf{(E)}\ 2000 \]

For real numbers $a,\ b$ with $0\leq a\leq \pi,\ a<b$, let $I(a,\ b)=\int_{a}^{b} e^{-x} \sin x\ dx.$ Determine the value of $a$ such that $\lim_{b\rightarrow \infty} I(a,\ b)=0.$

There are several pairs of integers $ (a, b) $ satisfying $ a^2 - 4a + b^2 - 8b = 30 $. Find the sum of the sum of the coordinates of all such points.

An isosceles trapezoid has an inscribed circle tangent to each of its four sides. The radius of the circle is $3$, and the area of the trapezoid is $72$. Let the parallel sides of the trapezoid have lengths $r$ and $s$, with $r \neq s$. Find $r^2+s^2$

Say that a complex number $z$ is [i]three-presentable[/i] if there is a complex number $w$ of absolute value $3$ such that $z = w - \frac{1}{w}$. Let $T$ be the set of all three-presentable complex numbers. The set $T$ forms a closed curve in the complex plane. What is the area inside $T$?

Let $x, y$ be two positive integers, with $x> y$, such that $2n = x + y$, where n is a number two-digit integer. If $\sqrt{xy}$ is an integer with the digits of $n$ but in reverse order, determine the value of $x - y$

Let $m_1,m_2,...,m_{2013} > 1$ be 2013 pairwise relatively prime positive integers and $A_1,A_2,...,A_{2013}$ be 2013 (possibly empty) sets with $A_i\subseteq \{1,2,...,m_i-1\}$ for $i=1,2,...,2013$. Prove that there is a positive integer $N$ such that \[ N \le \left( 2\left\lvert A_1 \right\rvert + 1 \right)\left( 2\left\lvert A_2 \right\rvert + 1 \right)\cdots\left( 2\left\lvert A_{2013} \right\rvert + 1 \right) \] and for each $i = 1, 2, ..., 2013$, there does [i]not[/i] exist $a \in A_i$ such that $m_i$ divides $N-a$. [i]Proposed by Victor Wang[/i]

Let $f: \mathbb{N} \rightarrow \mathbb{N}$ be a function, and let $f^m$ be $f$ applied $m$ times. Suppose that for every $n \in \mathbb{N}$ there exists a $k \in \mathbb{N}$ such that $f^{2k}(n)=n+k$, and let $k_n$ be the smallest such $k$. Prove that the sequence $k_1,k_2,\ldots $ is unbounded. [i]Proposed by Palmer Mebane, United States[/i]