We are given $2001$ balloons and a positive integer $k$. Each balloon has been blown up to a certain size (not necessarily the same for each balloon). In each step it is allowed to choose at most $k$ balloons and equalize their sizes to their arithmetic mean. Determine the smallest value of $k$ such that, whatever the initial sizes are, it is possible to make all the balloons have equal size after a finite number of steps.

For $ x \ge 0$ the smallest value of $ \frac {4x^2 \plus{} 8x \plus{} 13}{6(1 \plus{} x)}$ is: $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 2 \qquad \textbf{(C)}\ \frac {25}{12} \qquad \textbf{(D)}\ \frac {13}{6} \qquad \textbf{(E)}\ \frac {34}{5}$

Let $p_1, p_2, p_3, \ldots$ be the prime numbers listed in increasing order, and let $x_0$ be a real number between 0 and 1. For positive integer $k$, define \[ x_k = \begin{cases} 0 & \mbox{if} \; x_{k-1} = 0, \\[.1in] {\displaystyle \left\{ \frac{p_k}{x_{k-1}} \right\}} & \mbox{if} \; x_{k-1} \neq 0, \end{cases} \] where $\{x\}$ denotes the fractional part of $x$. (The fractional part of $x$ is given by $x - \lfloor x \rfloor$ where $\lfloor x \rfloor$ is the greatest integer less than or equal to $x$.) Find, with proof, all $x_0$ satisfying $0 < x_0 < 1$ for which the sequence $x_0, x_1, x_2, \ldots$ eventually becomes 0.

Given integer $n > 1$ and real number $t \geq 1$. $P$ is a parallelogram with four vertices $(0, 0), (0, t), (tF_{2n+1}, tF_{2n}), (tF_{2n+1}, tF_{2n} + t)$. Here, ${F_n}$ is the $n$-th term of Fibonacci sequence defined by $F_0 = 0, F_1 = 1$ and $F_{m+1} = F_m + F_{m-1}$. Let $L$ be the number of integral points (whose coordinates are integers) interior to $P$, and $M$ be the area of $P$, which is $t^2F_{2n+1}.$ [b][i]i)[/i][/b] Prove that for any integral point $(a, b)$, there exists a unique pair of integers $(j, k)$ such that$ j(F_{n+1}, F_n) + k(F_n, F_{n-1}) = (a, b)$, that is,$ jF_{n+1} + kF_n = a$ and $jF_n + kF_{n-1} = b.$ [i][b]ii)[/b][/i] Using [i][b]i)[/b][/i] or not, prove that $|\sqrt L-\sqrt M| \leq \sqrt 2.$

Alice has two urns. Each urn contains four balls and on each ball a natural number is written. She draws one ball from each urn at random, notes the sum of the numbers written on them, and replaces the balls in the urns from which she took them. This she repeats a large number of times. Bill, on examining the numbers recorded, notices that the frequency with which each sum occurs is the same as if it were the sum of two natural numbers drawn at random from the range 1 to 4. What can he deduce about the numbers on the balls?

A function $f_n(x)\ (n=0,\ 1,\ 2,\ 3,\ \cdots)$ satisfies the following conditions: (i) $f_0(x)=e^{2x}+1$. (ii) $f_n(x)=\int_0^x (n+2t)f_{n-1}(t)dt-\frac{2x^{n+1}}{n+1}\ (n=1,\ 2,\ 3,\ \cdots).$ Find $\sum_{n=1}^{\infty} f_n'\left(\frac 12\right).$

Find, with proof, all possible values of $t$ such that \[\lim_{n \to \infty} \left( \frac{1 + 2^{1/3} + 3^{1/3} + \dots + n^{1/3}}{n^t} \right ) = c\] for some real $c>0$. Also find the corresponding values of $c$.

Tetrahedron $ABCD$ has $AB=5$, $AC=3$, $BC=4$, $BD=4$, $AD=3$, and $CD=\tfrac{12}5\sqrt2$. What is the volume of the tetrahedron? $\textbf{(A) }3\sqrt2\qquad\textbf{(B) }2\sqrt5\qquad\textbf{(C) }\dfrac{24}5\qquad\textbf{(D) }3\sqrt3\qquad\textbf{(E) }\dfrac{24}5\sqrt2$

Let $w$ and $z$ be complex numbers such that $|w| = 1$ and $|z| = 10$. Let $\theta = \arg\left(\tfrac{w-z}{z}\right)$. The maximum possible value of $\tan^2 \theta$ can be written as $\tfrac{p}{q}$, where $p$ and $q$ are relatively prime positive integers. Find $p+q$. (Note that $\arg(w)$, for $w \neq 0$, denotes the measure of the angle that the ray from $0$ to $w$ makes with the positive real axis in the complex plane.

Let $ a$ be a positive real number. Find $ \lim_{n\to\infty} \frac{(n\plus{}1)^a\plus{}(n\plus{}2)^a\plus{}\cdots \plus{}(n\plus{}n)^a}{1^{a}\plus{}2^{a}\plus{}\cdots \plus{}n^{a}}$

A polynomial $p(x) = a_0x^k + a_1x^{k-1} + \cdots + a_k$ with integer coefficients is said to be divisible by an integer $m$ if $p(x)$ is divisible by m for all integers $x$. Prove that if $p(x)$ is divisible by $m$, then $k!a_0$ is also divisible by $m$. Also prove that if $a_0, k,m$ are non-negative integers for which $k!a_0$ is divisible by $m$, there exists a polynomial $p(x) = a_0x^k+\cdots+ a_k$ divisible by $m.$

$$\lim_{n \to \infty} nr\sqrt[2]{1-\cos \frac{2\pi}{n}}=?$$

Does there exist a function $f:[0,1]\rightarrow (0,\infty)$ such that [list] [*]$f$ is differentiable on $[0,1]$ [*] It's derivative $f'$ is continuous on $[0,1]$. [*] $(f'(x))^3-x^{\frac{1}{3}}>6(1-f(x)^{\frac{1}{5}})$ for all $x\in [0,1]$. [*] $f(1)=1$ [/list] [i]Proposed by Medhansh Tripathi[/i]

Let $a,b,c$ be positive real numbers such that \[ \cfrac{1}{1+a}+\cfrac{1}{1+b}+\cfrac{1}{1+c}\le 1. \] Prove that $(1+a^2)(1+b^2)(1+c^2)\ge 125$. When does equality hold?

Let $f(x)$ be a differentiable function such that $f'(x)+f(x)=4xe^{-x}\sin 2x,\ \ f(0)=0.$ Find $\lim_{n\to\infty}\sum_{k=1}^{n}f(k\pi).$

Let $P_1$ and $P_2$ be regular polygons of 1985 sides and perimeters $x$ and $y$ respectively. Each side of $P_1$ is tangent to a given circle of circumference $c$ and this circle passes through each vertex of $P_2$. Prove $x + y \ge 2c$. (You may assume that $\tan \theta \ge \theta$ for $0 \le \theta < \frac{\pi}{2}$.)

Find the set of all ordered pairs $(s,t)$ of positive integers such that \[t^{2}+1=s(s+1).\]

Evaluate $ \int_0^{\frac{\pi}{3}} \frac{1}{\cos ^ 7 x}\ dx$.

Given the integer $n > 1$ and the real number $a > 0$ determine the maximum of $\sum_{i=1}^{n-1} x_i x_{i+1}$ taken over all nonnegative numbers $x_i$ with sum $a.$

The real numbers $a_0,a_1,a_2,\ldots$ satisfy $1=a_0\le a_1\le a_2\le\ldots. b_1,b_2,b_3,\ldots$ are defined by $b_n=\sum_{k=1}^n{1-{a_{k-1}\over a_k}\over\sqrt a_k}$. [b]a.)[/b] Prove that $0\le b_n<2$. [b]b.)[/b] Given $c$ satisfying $0\le c<2$, prove that we can find $a_n$ so that $b_n>c$ for all sufficiently large $n$.

suppose that $v(x)=\sum_{p\le x,p\in \mathbb P}log(p)$ (here $\mathbb P$ denotes the set of all positive prime numbers). prove that the two statements below are equivalent: [b]a)[/b] $v(x) \sim x$ when $x \longrightarrow \infty$ [b]b)[/b] $\pi (x) \sim \frac{x}{ln(x)}$ when $x \longrightarrow \infty$. (here $\pi (x)$ is number of the prime numbers less than or equal to $x$).

Alice and Bob play the following number-guessing game. Alice writes down a list of positive integers $x_{1}$, $\cdots$, $x_{n}$, but does not reveal them to Bob, who will try to determine the numbers by asking Alice questions. Bob chooses a list of positive integers $a_{1}$, $\cdots$, $a_{n}$ and asks Alice to tell him the value of $a_{1}x_{1}+\cdots+a_{n}x_{n}$. Then Bob chooses another list of positive integers $b_{1}$, $\cdots$, $b_{n}$ and asks Alice for $b_{1}x_{1}+\cdots+b_{n}x_{n}$. Play continues in this way until Bob is able to determine Alice's numbers. How many rounds will Bob need in order to determine Alice's numbers?

\[\int_0^2 |\sin(\pi x)|+|\cos(\pi x)|\mathrm dx\] [i]Proposed by Anagh Sangavarapu[/i]

Prove that for any real number $ x$ the following inequality is true: $ \max\{|\sin x|, |\sin(x\plus{}2010)|\}>\dfrac1{\sqrt{17}}$

Let positive integers $a,\ b,\ c$ be pairwise coprime. Denote by $g(a, b, c)$ the maximum integer not representable in the form $xa+yb+zc$ with positive integral $x,\ y,\ z$. Prove that \[ g(a, b, c)\ge \sqrt{2abc}\] [i](M. Ivanov)[/i] [hide="Remarks (containing spoilers!)"] 1. It can be proven that $g(a,b,c)\ge \sqrt{3abc}$. 2. The constant $3$ is the best possible, as proved by the equation $g(3,3k+1,3k+2)=9k+5$. [/hide]