A sequence of real numbers $u_1, u_2, u_3, \dots$ is determined by $u_1$ and the following recurrence relation for $n \geq 1$: \[4u_{n+1} = \sqrt[3]{ 64u_n + 15.}\] Describe, with proof, the behavior of $u_n$ as $n \to \infty.$

$S$ is the set of functions $f:\mathbb{N} \to \mathbb{R}$ that satisfy the following conditions: [b]I.[/b] $f(1) = 2$ [b]II.[/b] $f(n+1) \geq f(n) \geq \frac{n}{n + 1} f(2n)$ for $n = 1, 2, \ldots$ Find the smallest $M \in \mathbb{N}$ such that for any $f \in S$ and any $n \in \mathbb{N}, f(n) < M$.

Find all function pairs $(f,g)$ where each $f$ and $g$ is a function defined on the integers and with values, such that, for all integers $a$ and $b$, \[f(a+b)=f(a)g(b)+g(a)f(b)\\ g(a+b)=g(a)g(b)-f(a)f(b).\]

Given $0 \le x_0 <1$, let \[ x_n= \begin{cases} 2x_{n-1} & \text{if}\ 2x_{n-1} <1 \\ 2x_{n-1}-1 & \text{if}\ 2x_{n-1} \ge 1 \end{cases} \] for all integers $n>0$. For how many $x_0$ is it true that $x_0=x_5$? $ \textbf{(A)}\ 0 \qquad\textbf{(B)}\ 1 \qquad\textbf{(C)}\ 5 \qquad\textbf{(D)}\ 31 \qquad\textbf{(E)}\ \text{infinitely many} $

Evaluate $\int_1^{e^2} \frac{(2x^2+2x+1)e^{x}}{\sqrt{x}}\ dx.$

Find the least positive integer $n$ such that $\cos\frac{\pi}{n}$ cannot be written in the form $p+\sqrt{q}+\sqrt[3]{r}$ with $p,q,r\in\mathbb{Q}$. [i]O. Mushkarov, N. Nikolov[/i] [hide]No-one in the competition scored more than 2 points[/hide]

Let $y=f(x)$ be a function of the graph of broken line connected by points $(-1,\ 0),\ (0,\ 1),\ (1,\ 4)$ in the $x$ -$y$ plane. Find the minimum value of $\int_{-1}^1 \{f(x)-(a|x|+b)\}^2dx.$ [i]2010 Tohoku University entrance exam/Economics, 2nd exam[/i]

Let $f$ be a function from the set $Q$ of the rational numbers onto itself such that $f(x+y)=f(x)+f(y)+2547$ for all rational numbers $x,y$. Moreover $f(2004) = 2547$. Determine $f(2547).$ Pierre.

Define a function $w:\mathbb{Z}\times\mathbb{Z}\to\mathbb{Z}$ as follows. For $|a|,|b|\le 2,$ let $w(a,b)$ be as in the table shown; otherwise, let $w(a,b)=0.$ \[\begin{array}{|lr|rrrrr|}\hline &&&&b&&\\ &w(a,b)&-2&-1&0&1&2\\ \hline &-2&-1&-2&2&-2&-1\\ &-1&-2&4&-4&4&-2\\ a&0&2&-4&12&-4&2\\ &1&-2&4&-4&4&-2\\ &2&-1&-2&2&-2&-1\\ \hline\end{array}\] For every finite subset $S$ of $\mathbb{Z}\times\mathbb{Z},$ define \[A(S)=\sum_{(\mathbf{s},\mathbf{s'})\in S\times S} w(\mathbf{s}-\mathbf{s'}).\] Prove that if $S$ is any finite nonempty subset of $\mathbb{Z}\times\mathbb{Z},$ then $A(S)>0.$ (For example, if $S=\{(0,1),(0,2),(2,0),(3,1)\},$ then the terms in $A(S)$ are $12,12,12,12,4,4,0,0,0,0,-1,-1,-2,-2,-4,-4.$)

A monic quadratic polynomial $f$ with integer coefficients attains prime values at three consecutive integer points.show that it attains a prime value at some other integer point as well.

Find all functions $g:R\rightarrow R$ for which there exists a strictly increasing function $ f:R\rightarrow R $ such that $f(x+y)=f(x)g(y)+f(y)$ $\forall x,y \in R$.

Let $\mathbb{N}$ and $\mathbb{N}^*$ be the sets containing the natural numbers/positive integers respectively. We define a binary relation on $\mathbb{N}$ by $a\acute{\in}b$ iff the $a$-th bit in the binary representation of $b$ is $1$. We define a binary relation on $\mathbb{N}^*$ by $a\tilde{\in}b$ iff $b$ is a multiple of the $a$-th prime number $p_a$. i) Prove that there is no bijection $f:\mathbb{N}\to \mathbb{N}^*$ such that $a\acute{\in}b\Leftrightarrow f(a)\tilde{\in}f(b)$. ii) Prove that there is a bijection $g:\mathbb{N}\to \mathbb{N}^*$ such that $(a\acute{\in}b \vee b\acute{\in}a)\Leftrightarrow (g(a)\tilde{\in}g(b) \vee g(b)\tilde{\in}g(a))$.

Find all functions $f: \mathbb{N}_{0}\rightarrow \mathbb{N}_{0}$ such that for all $n\in \mathbb{N}_{0}$: \[f(f(n))+f(n)=2n+6.\]

Let $f:\mathbb{R}\to \mathbb{R}$ be a function. Suppose that for every $\varepsilon >0$ , there exists a function $g:\mathbb{R}\to (0,\infty)$ such that for every pair $(x,y)$ of real numbers, if $|x-y|<\text{min}\{g(x),g(y)\}$, then $|f(x)-f(y)|<\varepsilon$ Prove that $f$ is pointwise limit of a squence of continuous $\mathbb{R}\to \mathbb{R}$ functions i.e., there is a squence $h_1,h_2,...,$ of continuous $\mathbb{R}\to \mathbb{R}$ such that $\lim_{n\to \infty}h_n(x)=f(x)$ for every $x\in \mathbb{R}$

Suppose that the measurement of time during the day is converted to the metric system so that each day has $10$ metric hours, and each metric hour has $100$ metric minutes. Digital clocks would then be produced that would read $9{:}99$ just before midnight, $0{:}00$ at midnight, $1{:}25$ at the former $3{:}00$ $\textsc{am}$, and $7{:}50$ at the former $6{:}00$ $\textsc{pm}$. After the conversion, a person who wanted to wake up at the equivalent of the former $6{:}36$ $\textsc{am}$ would have to set his new digital alarm clock for $\text{A:BC}$, where $\text{A}$, $\text{B}$, and $\text{C}$ are digits. Find $100\text{A} + 10\text{B} + \text{C}$.