Let $f\colon\mathbb{N}\rightarrow\mathbb{N}^{\ast}$ be a strictly increasing function. Prove that: [list=a] [*]There exists a decreasing sequence of positive real numbers, $(y_{n})_{n\in\mathbb{N}}$, converging to $0$, such that $y_{n}\leq2y_{f(n)}$, for all $n\in\mathbb{N}$. [*]If $(x_{n})_{n\in\mathbb{N}}$ is a decreasing sequence of real numbers, converging to $0$, then there exists a decreasing sequence of real numbers $(y_{n})_{n\in\mathbb{N}}$, converging to $0$, such that $x_{n}\leq y_{n} \leq2y_{f(n)}$, for all $n\in\mathbb{N}$.[/list]

For two real numbers $ a$, $ b$, with $ ab\neq 1$, define the $ \ast$ operation by \[ a\ast b=\frac{a+b-2ab}{1-ab}.\] Start with a list of $ n\geq 2$ real numbers whose entries $ x$ all satisfy $ 0<x<1$. Select any two numbers $ a$ and $ b$ in the list; remove them and put the number $ a\ast b$ at the end of the list, thereby reducing its length by one. Repeat this procedure until a single number remains. $ a.$ Prove that this single number is the same regardless of the choice of pair at each stage. $ b.$ Suppose that the condition on the numbers $ x$ is weakened to $ 0<x\leq 1$. What happens if the list contains exactly one $ 1$?

For the NEMO, Kevin needs to compute the product \[ 9 \times 99 \times 999 \times \cdots \times 999999999. \] Kevin takes exactly $ab$ seconds to multiply an $a$-digit integer by a $b$-digit integer. Compute the minimum number of seconds necessary for Kevin to evaluate the expression together by performing eight such multiplications. [i]Proposed by Evan Chen[/i]

Let $ S$ be the smallest subset of the integers with the property that $ 0\in S$ and for any $ x\in S$, we have $ 3x\in S$ and $ 3x \plus{} 1\in S$. Determine the number of non-negative integers in $ S$ less than $ 2008$.

Each rational number is painted either white or red. Call such a coloring of the rationals [i]sanferminera[/i] if for any distinct rationals numbers $x$ and $y$ satisfying one of the following three conditions: [list=1][*]$xy=1$, [*]$x+y=0$, [*]$x+y=1$,[/list]we have $x$ and $y$ painted different colors. How many sanferminera colorings are there?

Evaluate \[\int_0^1 (1-x^2)^n dx\ (n=0,1,2,\cdots)\]

A closed recticular polygon with 100 sides (may be concave) is given such that it's vertices have integer coordinates, it's sides are parallel to the axis and all it's sides have odd length. Prove that it's area is odd.

An $m\times n$ checkerboard is colored randomly: each square is independently assigned red or black with probability $\frac12.$ we say that two squares, $p$ and $q$, are in the same connected monochromatic region if there is a sequence of squares, all of the same color, starting at $p$ and ending at $q,$ in which successive squares in the sequence share a common side. Show that the expected number of connected monochromatic regions is greater than $\frac{mn}8.$

I'm thinking of a five-letter word that rhymes with ``angry'' and ``hungry''. What is it?

In a mathematical competition, some competitors are friends; friendship is mutual, that is, when $A$ is a friend of $B$, then $B$ is also a friend of $A$. We say that $n \geq 3$ different competitors $A_1, A_2, \ldots, A_n$ form a [i]weakly-friendly cycle [/i]if $A_i$ is not a friend of $A_{i+1}$ for $1 \leq i \leq n$ (where $A_{n+1} = A_1$), and there are no other pairs of non-friends among the components of the cycle. The following property is satisfied: "for every competitor $C$ and every weakly-friendly cycle $\mathcal{S}$ of competitors not including $C$, the set of competitors $D$ in $\mathcal{S}$ which are not friends of $C$ has at most one element" Prove that all competitors of this mathematical competition can be arranged into three rooms, such that every two competitors in the same room are friends. ([i]Serbia[/i])

There are $n$ students standing in a circle, one behind the other. The students have heights $h_1<h_2<\dots <h_n$. If a student with height $h_k$ is standing directly behind a student with height $h_{k-2}$ or less, the two students are permitted to switch places. Prove that it is not possible to make more than $\binom{n}{3}$ such switches before reaching a position in which no further switches are possible.

Prove that a finite simple planar graph has an orientation so that every vertex has out-degree at most 3.

An integer is digitally divisible if both of the following conditions are fulfilled: $(a)$ None of its digits is zero; $(b)$ It is divisible by the sum of its digits e.g. $322$ is digitally divisible. Show that there are infinitely many digitally divisible integers.

We are given $n$ intervals $[l_1,r_1],[l_2,r_2],[l_3,r_3],\dots, [l_n,r_n]$ in the number line. We can divide the intervals into two sets such that no two intervals in the same set have overlaps. Prove that there are at most $n-1$ pairs of overlapping intervals.

(a) Prove that if $n$ is a integer such that $n \geq 4011^2$ then there exists an integer $l$ such that \[ n < l^2 < (1 + \frac{1}{{2005}})n . \] (b) Find the smallest positive integer $M$ for which whenever an integer $n$ is such that $n \geq M$ then there exists an integer $l$ such that \[ n < l^2 < (1 + \frac{1}{{2005}})n . \]

Find all positive real numbers $r<1$ such that there exists a set $\mathcal{S}$ with the given properties: i) For any real number $t$, exactly one of $t, t+r$ and $t+1$ belongs to $\mathcal{S}$; ii) For any real number $t$, exactly one of $t, t-r$ and $t-1$ belongs to $\mathcal{S}$.

A pile of cards, numbered with $1$, $2$, ..., $n$, is being shuffled. Afterwards, the following operation is repeatedly performed: If the uppermost card of the pile has the number $k$, then we reverse the order of the $k$ uppermost cards. Prove that, after finitely many executions of this operation, the card with the number $1$ will become the uppermost card of the pile.

Let $a_1,a_2,\ldots,a_n$ be a finite sequence of non negative integers, its subsequences are the sequences of the form $a_i,a_{i+1},\ldots,a_j$ with $1\le i\le j \le n$. Two subsequences are said to be equal if they have the same length and have the same terms, that is, two subsequences $a_i,a_{i+1},\ldots,a_j$ and $a_u,a_{u+1},\ldots a_v$ are equal iff $j-i=u-v$ and $a_{i+k}=a_{u+k}$ forall integers $k$ such that $0\le k\le j-1$. Finally, we say that a subsequence $a_i,a_{i+1},\ldots,a_j$ is palindromic if $a_{i+k}=a_{j-k}$ forall integers $k$ such that $0\le k \le j-i$ What is the greatest number of different palindromic subsequences that can a palindromic sequence of length $n$ contain?

Let be a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ satisfying the conditions: $$ \left\{\begin{matrix} f(x+y) &\le & f(x)+f(y) \\ f(tx+(1-t)y) &\le & t(f(x)) +(1-t)f(y) \end{matrix}\right. , $$ for all real numbers $ x,y,t $ with $ t\in [0,1] . $ Prove that: [b]a)[/b] $ f(b)+f(c)\le f(a)+f(d) , $ for any real numbers $ a,b,c,d $ such that $ a\le b\le c\le d $ and $ d-c=b-a. $ [b]b)[/b] for any natural number $ n\ge 3 $ and any $ n $ real numbers $ x_1,x_2,\ldots ,x_n, $ the following inequality holds. $$ f\left( \sum_{1\le i\le n} x_i \right) +(n-2)\sum_{1\le i\le n} f\left( x_i \right)\ge \sum_{1\le i<j\le n} f\left( x_i+x_j \right) $$

The audience arranges $n$ coins in a row. The sequence of heads and tails is chosen arbitrarily. The audience also chooses a number between $1$ and $n$ inclusive. Then the assistant turns one of the coins over, and the magician is brought in to examine the resulting sequence. By an agreement with the assistant beforehand, the magician tries to determine the number chosen by the audience. [list][b](a)[/b] Prove that if this is possible for some $n$, then it is also possible for $2n$. [b](b)[/b] Determine all $n$ for which this is possible.[/list]

Let $ \{a_k\}$ be a sequence of integers such that $ a_1 \equal{} 1$ and $ a_{m \plus{} n} \equal{} a_m \plus{} a_n \plus{} mn$, for all positive integers $ m$ and $ n$. Then $ a_{12}$ is $ \textbf{(A)}\ 45 \qquad \textbf{(B)}\ 56 \qquad \textbf{(C)}\ 67 \qquad \textbf{(D)}\ 78 \qquad \textbf{(E)}\ 89$

We are given a combination lock consisting of $6$ rotating discs. Each disc consists of digits $0, 1, 2,\ldots , 9$ in that order (after digit $9$ comes $0$). Lock is opened by exactly one combination. A move consists of turning one of the discs one digit in any direction and the lock opens instantly if the current combination is correct. Discs are initially put in the position $000000$, and we know that this combination is not correct. [list] a) What is the least number of moves necessary to ensure that we have found the correct combination? b) What is the least number of moves necessary to ensure that we have found the correct combination, if we know that none of the combinations $000000, 111111, 222222, \ldots , 999999$ is correct?[/list] [i]Proposed by Ognjen Stipetić and Grgur Valentić[/i]

Three coins lie on integer points on the number line. A move consists of choosing and moving two coins, the first one $ 1$ unit to the right and the second one $ 1$ unit to the left. Under which initial conditions is it possible to move all coins to one single point?

For any two rational numbers $ p$ and $ q$ in the interval $ (0,1)$ and function $ f$, there is always $ \displaystyle f \left( \frac{p\plus{}q}{2} \right) \leq \frac{f(p) \plus{} f(q)}{2}$. Then prove that for any rational numbers $ \lambda, x_1, x_2 \in (0,1)$, there is always: \[ f( \lambda x_1 \plus{} (1\minus{}\lambda) x_2 ) \leq \lambda f(x_i) \plus{} (1\minus{}\lambda) f(x_2)\]

Find $2^{2006}$ positive integers satisfying the following conditions. (i) Each positive integer has $2^{2005}$ digits. (ii) Each positive integer only has 7 or 8 in its digits. (iii) Among any two chosen integers, at most half of their corresponding digits are the same.