Let $I = (0, 1]$ be the unit interval of the real line. For a given number $a \in (0, 1)$ we define a map $T : I \to I$ by the formula if \[ T (x, y) = \begin{cases} x + (1 - a),&\mbox{ if } 0< x \leq a,\\ \text{ } \\ x - a, & \mbox{ if } a < x \leq 1.\end{cases} \] Show that for every interval $J \subset I$ there exists an integer $n > 0$ such that $T^n(J) \cap J \neq \emptyset.$

What is the hundreds digit of $2011^{2011}$? $ \textbf{(A)}\ 1 \qquad \textbf{(B)}\ 4 \qquad \textbf{(C)}\ 5 \qquad \textbf{(D)}\ 6 \qquad \textbf{(E)}\ 9 $

Suppose that every integer has been given one of the colours red, blue, green or yellow. Let $x$ and $y$ be odd integers so that $|x| \neq |y|$. Show that there are two integers of the same colour whose difference has one of the following values: $x,y,x+y$ or $x-y$.

Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ which satisfy $yf(x)+f(y) \geq f(xy)$

Let $ A\subset \mathbb C$ be a closed and countable set. Prove that if the analytic function $ f: \mathbb C\backslash A\longrightarrow \mathbb C$ is bounded, then $ f$ is constant.

There are $n$ people standing on a circular track. We want to perform a number of [i]moves[/i] so that we end up with a situation where the distance between every two neighbours is the same. The [i]move[/i] that is allowed consists in selecting two people and asking one of them to walk a distance $d$ on the circular track clockwise, and asking the other to walk the same distance on the track anticlockwise. The two people selected and the quantity $d$ can vary from move to move. Prove that it is possible to reach the desired situation (where the distance between every two neighbours is the same) after at most $n-1$ moves.

Let $P$ be the number of ways to partition $2013$ into an ordered tuple of prime numbers. What is $\log_2 (P)$? If your answer is $A$ and the correct answer is $C$, then your score on this problem will be $\left\lfloor\frac{125}2\left(\min\left(\frac CA,\frac AC\right)-\frac35\right)\right\rfloor$ or zero, whichever is larger.

Let $ Z$ and $ R$ denote the sets of integers and real numbers, respectively. Let $ f: Z \rightarrow R$ be a function satisfying: (i) $ f(n) \ge 0$ for all $ n \in Z$ (ii) $ f(mn)\equal{}f(m)f(n)$ for all $ m,n \in Z$ (iii) $ f(m\plus{}n) \le max(f(m),f(n))$ for all $ m,n \in Z$ (a) Prove that $ f(n) \le 1$ for all $ n \in Z$ (b) Find a function $ f: Z \rightarrow R$ satisfying (i), (ii),(iii) and $ 0<f(2)<1$ and $ f(2007) \equal{} 1$

Prove that for any three positive real numbers $ a,b,c, \frac{1}{a\plus{}b}\plus{}\frac{1}{b\plus{}c}\plus{}\frac{1}{c\plus{}a} \ge \frac{9}{2} \cdot \frac{1}{a\plus{}b\plus{}c}$.

Let $P(x)$ be a polynomial such that, when divided by $x - 2$, the remainder is $3$ and, when divided by $x - 3$, the remainder is $2$. If, when divided by $(x - 2)(x - 3)$, the remainder is $ax + b$, find $a^2 + b^2$.

Let $n$ be a given positive integer. Solve the system \[x_1 + x_2^2 + x_3^3 + \cdots + x_n^n = n,\] \[x_1 + 2x_2 + 3x_3 + \cdots + nx_n = \frac{n(n+1)}{2}\] in the set of nonnegative real numbers.

From the set of all permutations $f$ of $\{1, 2, ... , n\}$ that satisfy the condition: $f(i) \geq i-1$ $i=1,...,n$ one is chosen uniformly at random. Let $p_n$ be the probability that the chosen permutation $f$ satisfies $f(i) \leq i+1$ $i=1,...,n$ Find all natural numbers $n$ such that $p_n > \frac{1}{3}$.

Given an integer $n\ge 2$, a function $f:\mathbb{Z}\rightarrow \{1,2,\ldots,n\}$ is called [i]good[/i], if for any integer $k,1\le k\le n-1$ there exists an integer $j(k)$ such that for every integer $m$ we have \[f(m+j(k))\equiv f(m+k)-f(m) \pmod{n+1}. \] Find the number of [i]good[/i] functions.

Let $a,b,c$ be positive reals satisfying $a+b+c = \sqrt[7]{a} + \sqrt[7]{b} + \sqrt[7]{c}$. Prove that $a^a b^b c^c \ge 1$. [i]Proposed by Evan Chen[/i]

For every positive integer $N\geq 2$ with prime factorisation $N=p_1^{a_1}p_2^{a_2}\cdots p_k^{a_k}$ we define \[f(N):=1+p_1a_1+p_2a_2+\cdots+p_ka_k.\] Let $x_0\geq 2$ be a positive integer. We define the sequence $x_{n+1}=f(x_n)$ for all $n\geq 0.$ Prove that this sequence is eventually periodic and determine its fundamental period.

Let be a sequence $ \left( a_n \right)_{n\geqslant 1} $ of real numbers defined recursively as $$ a_n=2007+1004n^2-a_{n-1}-a_{n-2}-\cdots -a_2-a_1. $$ Calculate: $$ \lim_{n\to\infty} \frac{1}{n}\int_1^{a_n} e^{1/\ln t} dt $$

Distinct points $A, B , C, D, E$ are given in this order on a semicircle with radius $1$. Prove that \[AB^{2}+BC^{2}+CD^{2}+DE^{2}+AB \cdot BC \cdot CD+BC \cdot CD \cdot DE < 4.\]

Let $a$ and $b$ be real numbers satisfying $a>b>0$. Evaluate \[\int_0^{2\pi}\dfrac{1}{a+b\cos(\theta)}d\theta.\] Express your answer in terms of $a$ and $b$.

[b]Problem 1[/b] Let $f : \mathbb{R} \rightarrow \mathbb{R}$ be differentiable on $\mathbb{R}$. Prove that there exists $x \in [0, 1]$ such that $$\frac{4}{\pi} ( f(1) - f(0) ) = (1+x^2) f'(x) \ .$$

Carl chooses a [i]functional expression[/i]* $E$ which is a finite nonempty string formed from a set $x_1, x_2, \dots$ of variables and applications of a function $f$, together with addition, subtraction, multiplication (but not division), and fixed real constants. He then considers the equation $E = 0$, and lets $S$ denote the set of functions $f \colon \mathbb R \to \mathbb R$ such that the equation holds for any choices of real numbers $x_1, x_2, \dots$. (For example, if Carl chooses the functional equation $$ f(2f(x_1)+x_2) - 2f(x_1)-x_2 = 0, $$ then $S$ consists of one function, the identity function. (a) Let $X$ denote the set of functions with domain $\mathbb R$ and image exactly $\mathbb Z$. Show that Carl can choose his functional equation such that $S$ is nonempty but $S \subseteq X$. (b) Can Carl choose his functional equation such that $|S|=1$ and $S \subseteq X$? *These can be defined formally in the following way: the set of functional expressions is the minimal one (by inclusion) such that (i) any fixed real constant is a functional expression, (ii) for any positive integer $i$, the variable $x_i$ is a functional expression, and (iii) if $V$ and $W$ are functional expressions, then so are $f(V)$, $V+W$, $V-W$, and $V \cdot W$. [i]Proposed by Carl Schildkraut[/i]

Find all functions $f:\mathbb R \to \mathbb R$ such that for all $x,y\in \mathbb R$ $f(x+f(y))=2x+2f(y+1)$

Given a real number $\alpha$, a function $f$ is defined on pairs of nonnegative integers by $f(0,0) = 1, f(m,0) = f(0,m) = 0$ for $m > 0$, $f(m,n) = \alpha f(m,n-1)+(1- \alpha)f(m -1,n-1)$ for $m,n > 0$. Find the values of $\alpha$ such that $| f(m,n)| < 1989$ holds for any integers $m,n \ge 0$.

Is there exist a function $f:\mathbb {N}\to \mathbb {N}$ with for $\forall m,n \in \mathbb {N}$ $$f\left(mf\left(n\right)\right)=f\left(m\right)f\left(m+n\right)+n ?$$

The function $ f : \mathbb{N} \to \mathbb{Z}$ is defined by $ f(0) \equal{} 2$, $ f(1) \equal{} 503$ and $ f(n \plus{} 2) \equal{} 503f(n \plus{} 1) \minus{} 1996f(n)$ for all $ n \in\mathbb{N}$. Let $ s_1$, $ s_2$, $ \ldots$, $ s_k$ be arbitrary integers not smaller than $ k$, and let $ p(s_i)$ be an arbitrary prime divisor of $ f\left(2^{s_i}\right)$, ($ i \equal{} 1, 2, \ldots, k$). Prove that, for any positive integer $ t$ ($ t\le k$), we have $ 2^t \Big | \sum_{i \equal{} 1}^kp(s_i)$ if and only if $ 2^t | k$.

Show that for all $n \in \mathbb{N}$, \[n = \sum^{}_{d \vert n}\phi(d).\]