Let $ f(x) \equal{} c_m x^m \plus{} c_{m\minus{}1} x^{m\minus{}1} \plus{}...\plus{} c_1 x \plus{} c_0$, where each $ c_i$ is a non-zero integer. Define a sequence $ \{ a_n \}$ by $ a_1 \equal{} 0$ and $ a_{n\plus{}1} \equal{} f(a_n)$ for all positive integers $ n$. (a) Let $ i$ and $ j$ be positive integers with $ i<j$. Show that $ a_{j\plus{}1} \minus{} a_j$ is a multiple of $ a_{i\plus{}1} \minus{} a_i$. (b) Show that $ a_{2008} \neq 0$

Let $n=p_1p_2\cdots p_s$, where $p_1,\ldots,p_s$ are distinct odd prime numbers. (a) Prove that the expression $$F_n(x)=\prod\left(x^{\frac n{p_{i_1}\cdots p_{i_k}}}-1\right)^{(-1)^k},$$where the product goes over all subsets $\{p_{i_1},\ldots,p_{i_k}\}$ or $\{p_1,\ldots,p_s\}$ (including itself and the empty set), can be written as a polynomial in $x$ with integer coefficients. (b) Prove that if $p$ is a prime divisor of $F_n(2)$, then either $p\mid n$ or $n\mid p-1$.

[b]a)[/b] Show that there is no function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ having the property that $$ f(f(x))=\left\{ \begin{matrix} \sqrt{2007} ,& \quad x\in\mathbb{Q} \\ 2007, & \quad x\not\in \mathbb{Q} \end{matrix} \right. , $$ for any real number $ x. $ [b]b)[/b] Prove that there is an infinite number of functions $ g:\mathbb{R}\longrightarrow\mathbb{R} $ having the property that $$ g(g(x))=\left\{ \begin{matrix} 2007 ,& \quad x\in\mathbb{Q} \\ \sqrt{2007}, & \quad x\not\in \mathbb{Q} \end{matrix} \right. , $$ for any real number $ x. $

Let $a\in\mathbb{R}-\{0\}$. Find all functions $f: \mathbb{R}\to\mathbb{R}$ such that $f(a+x) = f(x) - x$ for all $x\in\mathbb{R}$. [i]Dan Schwartz[/i]

On $[1,2]$ if two functions $f(x)=x^2+px+q$ and $g(x)=x+\frac{1}{x^2}$ get their minumum value at the same point, then the maximum value of $f(x)$ on $[1,2]$ is $\text{(A)}4+\frac{11}{2}\sqrt[3]{2}+\sqrt[3]{4}\qquad\text{(B)}4-\frac{5}{2}\sqrt[3]{2}+\sqrt[3]{4}$ $\text{(C)}1-\frac{1}{2}\sqrt[3]{2}+\sqrt[3]{4}\qquad\text{(D)}$ none above

Let $f : Z_{\ge 0} \to Z_{\ge 0}$ satisfy the functional equation $$f(m^2 + n^2) =(f(m) - f(n))^2 + f(2mn)$$ for all nonnegative integers $m, n$. If $8f(0) + 9f(1) = 2006$, compute $f(0)$.

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} $

For a positive integer $n$, we define the function $f_n(x)=\sum_{k=1}^n |x-k|$ for all real numbers $x$. For any two-digit number $n$ (in decimal representation), determine the set of solutions $\mathbb{L}_n$ of the inequality $f_n(x)<41$. [i](41st Austrian Mathematical Olympiad, National Competition, part 1, Problem 2)[/i]

Prove that \[ \sum_{n=1}^\infty {1\over n^n} = \int_0^1 x^{-x}\,dx. \]

A projectile moves in a resisting medium. The resisting force is a function of the velocity and is directed along the velocity vector. The equation $x=f(t)$ (where $f(t)$ is not constant) gives the horizontal distance in terms of the time $t$. Show that the vertical distance $y$ is given by $$y=-gf(t) \int \frac{dt}{f'(t)} + g \int \frac{f(t)}{f'(t)} \, dt +Af(t)+B$$ where $A$ and $B$ are constants and $g$ is the acceleration due to gravity.

A $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ where $h_i\left(x_1,x_2, \cdots , x_n\right)$ are $n$ variable polynomials with real coefficients is called [i]good[/i] if the following condition holds: For any $n$ functions $f_1,f_2, \cdots ,f_n : \mathbb R \to \mathbb R$ if for all $1 \le i \le n+1$, $P_i(x)=h_i \left(f_1(x),f_2(x), \cdots, f_n(x) \right)$ is a polynomial with variable $x$, then $f_1(x),f_2(x), \cdots, f_n(x)$ are polynomials. $a)$ Prove that for all positive integers $n$, there exists a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that the degree of all $h_i$ is more than $1$. $b)$ Prove that there doesn't exist any integer $n>1$ that for which there is a [i]good[/i] $n+1$-tuple $\left(h_1,h_2, \cdots, h_{n+1}\right)$ such that all $h_i$ are symmetric polynomials. [i]Proposed by Alireza Shavali[/i]

Let $M,a,b,r$ be non-negative integers with $a,r\ge 2$, and suppose there exists a function $f:\mathbb{Z}\rightarrow\mathbb{Z}$ satisfying the following conditions: (1) For all $n\in \mathbb{Z}$, $f^{(r)}(n)=an+b$ where $f^{(r)}$ denotes the composition of $r$ copies of $f$ (2) For all $n\ge M$, $f(n)\ge 0$ (3) For all $n>m>M$, $n-m|f(n)-f(m)$ Show that $a$ is a perfect $r$-th power.

Let $x_0+\sqrt{2003}y_0$ be the minimum positive integer root of Pell function $x^2-2003y^2=1$. Find all the positive integer solutions $(x,y)$ of the equation, such that $x_0$ is divisible by any prime factor of $x$.

Let $ f : \mathbf {R} \to \mathbf {R} $ be a smooth function such that $ f'(x)^2 = f(x) f''(x) $ for all $x$. Suppose $f(0)=1$ and $f^{(4)} (0) = 9$. Find all possible values of $f'(0)$.

Suppose that $x$ is measured in radians. Find the maximum value of \[\frac{\sin2x+\sin4x+\sin6x}{\cos2x+\cos4x+\cos6x}\] for $0\le x\le \frac{\pi}{16}$

Let $f:[0,\infty)\to\mathbb R$ be a continuous function s.t. $\lim_{x\to\infty}\frac {f(x)}x=0$. Let $(x_n)_n$ be a sequence of positive real numbers s.t. $\left(\frac{x_n}n\right)_n$ is bounded. Prove that $\lim_{n\to\infty}\frac{f(x_n)}n=0$. [i]Dorin Andrica, Eugen Paltanea[/i]

Let $ \mathbb{R} ^{+} $ denote the set of all positive real numbers. Find all functions $ \mathbb{R} ^{+} \to \mathbb{R} ^{+} $ such that \[ f(x+f(y)) = yf(xy+1)\] holds for all $ x, y \in \mathbb{R} ^{+} $.

Determine all functions $f: \mathbb{Z}\to\mathbb{Z}$ satisfying \[f\big(f(m)+n\big)+f(m)=f(n)+f(3m)+2014\] for all integers $m$ and $n$. [i]Proposed by Netherlands[/i]

Let \[f(x)=\dfrac{1}{1-\dfrac{1}{1-x}}\,.\] Compute $f^{2016}(2016)$, where $f$ is composed upon itself $2016$ times.

Find all functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $n\in \mathbb{N}$: \[f(n+1) > f(f(n)).\]

A finite sequence of integers $a_1, a_2, \dots, a_n$ is called [i]regular[/i] if there exists a real number $x$ satisfying \[ \left\lfloor kx \right\rfloor = a_k \quad \text{for } 1 \le k \le n. \] Given a regular sequence $a_1, a_2, \dots, a_n$, for $1 \le k \le n$ we say that the term $a_k$ is [i]forced[/i] if the following condition is satisfied: the sequence \[ a_1, a_2, \dots, a_{k-1}, b \] is regular if and only if $b = a_k$. Find the maximum possible number of forced terms in a regular sequence with $1000$ terms.

For all natural numbers $n$, define $f(n) = \tau (n!) - \tau ((n-1)!)$, where $\tau(a)$ denotes the number of positive divisors of $a$. Prove that there exist infinitely many composite $n$, such that for all naturals $m < n$, we have $f(m) < f(n)$.

Let $f$ be a real-valued function such that \[f(x)+2f\left(\dfrac{2002}x\right)=3x\] for all $x>0$. Find $f(2)$. $\textbf{(A) }1000\qquad\textbf{(B) }2000\qquad\textbf{(C) }3000\qquad\textbf{(D) }4000\qquad\textbf{(E) }6000$

For an integer $ m$, denote by $ t(m)$ the unique number in $ \{1, 2, 3\}$ such that $ m \plus{} t(m)$ is a multiple of $ 3$. A function $ f: \mathbb{Z}\to\mathbb{Z}$ satisfies $ f( \minus{} 1) \equal{} 0$, $ f(0) \equal{} 1$, $ f(1) \equal{} \minus{} 1$ and $ f\left(2^{n} \plus{} m\right) \equal{} f\left(2^n \minus{} t(m)\right) \minus{} f(m)$ for all integers $ m$, $ n\ge 0$ with $ 2^n > m$. Prove that $ f(3p)\ge 0$ holds for all integers $ p\ge 0$. [i]Proposed by Gerhard Woeginger, Austria[/i]

Five distinct points $A, B, C, D$ and $E$ lie in this order on a circle of radius $r$ and satisfy $AC = BD = CE = r$. Prove that the orthocentres of the triangles $ACD, BCD$ and $BCE$ are the vertices of a right-angled triangle.