Let $a_1 , a_2 , a_3 ,\ldots$ be a sequence of positive real numbers, define $s_n = \frac{a_1 +a_2 +\ldots+a_n }{n}$ and $r_n = \frac{a_{1}^{-1} +a_{2}^{-1} +\ldots+a_{n}^{-1} }{n}.$ Given that $\lim_{n\to \infty} s_n $ and $\lim_{n\to \infty} r_n $ exist, prove that the product of these limits is not less than $1.$

Compute $$\sum^{\infty}_{i=0} \sum^{\infty}_{j=0}{i + j \choose i} 3^{-(i+j)}.$$

Points $D,E$ lie on segments $AB,AC$ of $\triangle ABC$ such that $DE\parallel BC$. Let $O_1,O_2$ be the circumcenters of $\triangle ABE, \triangle ACD$ respectively. Line $O_1O _2$ meets $AC$ at $P$, and $AB$ at $Q$. Let $O$ be the circumcenter of $\triangle APQ$, and $M$ be the intersection of $AO$ extended and $BC$. Prove that $M$ is the midpoint of $BC$.

A small bottle of shampoo can hold 35 milliliters of shampoo, whereas a large bottle can hold 500 milliliters of shampoo. Jasmine wants to buy the minimum number of small bottles necessary to completely fill a large bottle. How many bottles must she buy? $ \textbf{(A)}\ 11 \qquad \textbf{(B)}\ 12 \qquad \textbf{(C)}\ 13 \qquad \textbf{(D)}\ 14 \qquad \textbf{(E)}\ 15$

Which positive integers $n$ make the equation \[\sum_{i=1}^n \sum_{j=1}^n \left\lfloor \frac{ij}{n+1} \right\rfloor=\frac{n^2(n-1)}{4}\] true?

Alice and Bob play the following game on a $100\times 100$ grid, taking turns, with Alice starting first. Initially the grid is empty. At their turn, they choose an integer from $1$ to $100^2$ that is not written yet in any of the cells and choose an empty cell, and place it in the chosen cell. When there is no empty cell left, Alice computes the sum of the numbers in each row, and her score is the maximum of these $100$ numbers. Bob computes the sum of the numbers in each column, and his score is the maximum of these $100$ numbers. Alice wins if her score is greater than Bob's score, Bob wins if his score is greater than Alice's score, otherwise no one wins. Find if one of the players has a winning strategy, and if so which player has a winning strategy. [i]Théo Lenoir, France[/i]

Two ants, one starting at $ (-1, 1) $, the other at $ (1, 1) $, walk to the right along the parabola $ y = x^2 $ such that their midpoint moves along the line $ y = 1 $ with constant speed $1$. When the left ant first hits the line $ y = \frac {1}{2} $, what is its speed?

A rectangle $\mathcal{R}$ with odd integer side lengths is divided into small rectangles with integer side lengths. Prove that there is at least one among the small rectangles whose distances from the four sides of $\mathcal{R}$ are either all odd or all even. [i]Proposed by Jeck Lim, Singapore[/i]

King George has decided to connect the $1680$ islands in his kingdom by bridges. Unfortunately the rebel movement will destroy two bridges after all the bridges have been built, but not two bridges from the same island. What is the minimal number of bridges the King has to build in order to make sure that it is still possible to travel by bridges between any two of the $1680$ islands after the rebel movement has destroyed two bridges?

Find all functions $f : R \to R$ such that $$f(x + y) \ge xf(x) + yf(y)$$, for all $x, y \in R$ .

Let $I$ be the intersection point of the bisectors of triangle $ABC$. Let us denote by $A', B', C'$ the points symmetrical to $I$ wrt the sides triangle $ABC$. Prove that if a circle circumscribes around triangle $A'B'C'$ passes through vertex $B$, then $\angle ABC = 60^o$.

Find all functions $ f: \mathbb{R} \rightarrow \mathbb{R}$ satisfying \[ f(x^3\plus{}y^3)\equal{}xf(x^2)\plus{}yf(y^2)\] for all real numbers $ x$ and $ y$. [i]Hery Susanto, Malang[/i]

For each positive integer $n$, let $f(n)$ be the sum of the digits in the base-four representation of $n$ and let $g(n)$ be the sum of the digits in the base-eight representation of $f(n)$. For example, $f(2020) = f(133210_\text{four}) = 10 = 12_\text{eight}$, and $g(2020) = \text{the digit sum of } 12_\text{eight} = 3$. Let $N$ be the least value of $n$ such that the base-sixteen representation of $g(n)$ cannot be expressed using only the digits $0$ through $9.$ Find the remainder when $N$ is divided by $1000.$

Given a function $ f:\mathbb{N}\longrightarrow\mathbb{N} , $ find the necessary and sufficient condition that makes the sequence $$ \left(\left( 1+\frac{(-1)^{f(n)}}{n+1} \right)^{(-1)^{-f(n+1)}\cdot(n+2)}\right)_{n\ge 1} $$ to be monotone.

Determine the smallest rational number $\frac{r}{s}$ such that $\frac{1}{k}+\frac{1}{m}+\frac{1}{n}\leq \frac{r}{s}$ whenever $k, m,$ and $n$ are positive integers that satisfy the inequality $\frac{1}{k}+\frac{1}{m}+\frac{1}{n} < 1$.

For any $0\leq x_1,x_2,\ldots,x_{2011} \leq 1$, Find the maximum value of \begin{align*} \sum_{k=1}^{2011}(x_k-m)^2 \end{align*} where $m$ is the arithmetic mean of $x_1,x_2,\ldots,x_{2011}$.

Let $ P$ be a point in the plane of a triangle $ ABC$. Lines $ AP,BP,CP$ respectively meet lines $ BC,CA,AB$ at points $ A',B',C'$. Points $ A'',B'',C''$ are symmetric to $ A,B,C$ with respect to $ A',B',C',$ respectively. Show that: $ S_{A''B''C''}\equal{}3S_{ABC}\plus{}4S_{A'B'C'}$.

Let $ a_1$, $ \ldots$, $ a_k$, $ a_{k\plus{}1}$, $ \ldots$, $ a_n$ be $ n$ positive numbers ($ k<n$). Suppose that the values of $ a_{k\plus{}1}$, $ a_{k\plus{}2}$, $ \ldots$, $ a_n$ are fixed. Choose the values of $ a_1$, $ a_2$, $ \ldots$, $ a_k$ that minimize the sum $ \sum_{i, j, i\neq j}\frac{a_i}{a_j}$

How many triples $(p,q,n)$ are there such that $1/p+2013/q = n/5$ where $p$, $q$ are prime numbers and $n$ is a positive integer? $ \textbf{(A)}\ 7 \qquad\textbf{(B)}\ 6 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 4 \qquad\textbf{(E)}\ 4 $

Let $ABC$ be a triangle such that $AB<AC$. Let $D$ be a point on the segment $BC$ such that $BD<CD$. The angle bisectors of $\angle ADB$ and $\angle ADC$ meet the segments $AB$ and $AC$ at $E$ and $F$ respectively. Let $\omega$ be the circumcircle of $AEF$ and $M$ be the midpoint of $EF$. The ray $AD$ meets $\omega$ at $X$ and the line through $X$ parallel to $EF$ meets $\omega$ again at $Y$. If $YM$ meets $\omega$ at $T$, show that $AT$, $EF$ and $BC$ are concurrent. [i]Authored by Nikola Velov[/i]

$f$ is a function twice differentiable on $[0,1]$ and such that $f''$ is continuous. We suppose that : $f(1)-1=f(0)=f'(1)=f'(0)=0$. Prove that there exists $x_0$ on $[0,1]$ such that $|f''(x_0)| \geq 4$

1. Let $f(x)=x^2+bx+c$, M = {x | |f(x)|<1}. Prove $|M|\leq 2\sqrt{2}$ (|...| = length of interval(s))

A positive integer is called [i]monotone[/i] if has at least two digits and all its digits are nonzero and appear in a strictly increasing or strictly decreasing order. (a) Compute the sum of all monotone five-digit numbers. (b) Find the number of final zeros in the least common multiple of all monotone numbers (with any number of digits).

Can the equation $x^3 + ax^2 + bx + c = 0$ have only negative roots , if we know that $a+2b+4c=- \frac12 $?

Given a simple, connected graph with $n$ vertices and $m$ edges. Prove that one can find at least $m$ ways separating the set of vertices into two parts, such that the induced subgraphs on both parts are connected.