Find all reals $A,B,C$ such that there exists a real function $f$ satisfying $f(x+f(y))= Ax+By+C$ for all reals $x,y$.

Determine all positive integers $n$ for which $\dfrac{n^2+1}{[\sqrt{n}]^2+2}$ is an integer. Here $[r]$ denotes the greatest integer less than or equal to $r$.

Consider the set $\mathcal{F}$ of functions $f:\mathbb{N}\to\mathbb{N}$ (where $\mathbb{N}$ is the set of non-negative integers) having the property that \[f(a^2-b^2)=f(a)^2-f(b)^2,\ \text{for all }a,b\in\mathbb{N},\ a\ge b.\] a) Determine the set $\{f(1)\mid f\in\mathcal{F}\}$. b) Prove that $\mathcal{F}$ has exactly two elements. [i]Nelu Chichirim[/i]

Find all polynomial functions with real coefficients for which $$(x-2)P(x+2)+(x+2)P(x-2)=2xP(x)$$ for all real $x$

For which positive integer $n$ is the quantity $\frac{n}{3} + \frac{40}{n}$ minimized? [i]Proposed by Eugene Chen[/i]

Let $f_0$ be the function from $\mathbb{Z}^2$ to $\{0,1\}$ such that $f_0(0,0)=1$ and $f_0(x,y)=0$ otherwise. For each positive integer $m$, let $f_m(x,y)$ be the remainder when \[ f_{m-1}(x,y) + \sum_{j=-1}^{1} \sum_{k=-1}^{1} f_{m-1}(x+j,y+k) \] is divided by $2$. Finally, for each nonnegative integer $n$, let $a_n$ denote the number of pairs $(x,y)$ such that $f_n(x,y) = 1$. Find a closed form for $a_n$. [i]Proposed by Bobby Shen[/i]

[b]8.[/b] Let the function $f(x)$ be periodic with the period $1$, non-negative, concave in the interval $(0,1)$ and continuous at the point $0$. Prove that $f(nx)\leq nf(x)$ for every real $x$ and positive integer $n$. [b](R. 6)[/b]

Let $f: \mathbb{R}\to\mathbb{R}$ be a continuous function, and $a<b$ be two points in the image of $f$ (that is, there exists $x,y$ such that $f(x)=a$ and $f(y)=b$). Show that there is an interval $I$ such that $f(I)=[a,b]$.

Let $\alpha , \beta , \gamma , \delta$ be positive numbers such that for all $x$, $\sin{\alpha x}+\sin {\beta x}=\sin {\gamma x}+\sin {\delta x}$. Prove that $\alpha =\gamma$ or $\alpha=\delta$.

Does there exist functions $ f,g: \mathbb{R}\to\mathbb{R}$ such that $ f(g(x)) \equal{} x^2$ and $ g(f(x)) \equal{} x^k$ for all real numbers $ x$ a) if $ k \equal{} 3$? b) if $ k \equal{} 4$?

There are $n$ balls numbered from $1$ to $n$, and $2n-1$ boxes numbered from $1$ to $2n-1$. For each $i$, ball number $i$ can only be put in the boxes with numbers from $1$ to $2i-1$. Let $k$ be an integer from $1$ to $n$. In how many ways we can choose $k$ balls, $k$ boxes and put these balls in the selected boxes so that each box has exactly one ball?

Let $f$ be a function from the set of integers to the set of positive integers. Suppose that, for any two integers $m$ and $n$, the difference $f(m) - f(n)$ is divisible by $f(m- n)$. Prove that, for all integers $m$ and $n$ with $f(m) \leq f(n)$, the number $f(n)$ is divisible by $f(m)$. [i]Proposed by Mahyar Sefidgaran, Iran[/i]

Suppose a function $f(x)$ is continuous on $[-1,\ 1]$ and satisfies the condition : 1) $f(-1)\geq f(1).$ 2) $x+f(x)$ is non decreasing function. 3) $\int_{-1}^ 1 f(x)\ dx=0.$ Show that $\int_{-1}^1 f(x)^2dx\leq \frac 23.$

Let $f:[0,1] \to \mathbb{R}$ be a continuous function with $f(1)=0.$ Prove that the limit $$\lim_{t \nearrow 1} \left( \frac{1}{1-t} \int\limits_0^1x(f(tx)-f(x)) \mathrm{d}x\right)$$ exists and find its value.

Let $\mathbb{R}$ be the set of all real numbers. Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ satisfying for all $x,y\in\mathbb{R}$ the equation $f(x)+f(y)=f(f(x)f(y))$.

Suppose that $ f: [0,1]\to\mathbb{R}$ has a continuous derivative and that $ \int_0^1f(x)\,dx\equal{}0.$ Prove that for every $ \alpha\in(0,1),$ \[ \left|\int_0^{\alpha}f(x)\,dx\right|\le\frac18\max_{0\le x\le 1}|f'(x)|\]

Find the indefinite integral $ \int \frac{x^3}{(x\minus{}1)^3(x\minus{}2)}\ dx$.

Find all triples $\left(x,\ y,\ z\right)$ of integers satisfying the following system of equations: $x^3-4x^2-16x+60=y$; $y^3-4y^2-16y+60=z$; $z^3-4z^2-16z+60=x$.

Consider the function $f_k:\mathbb{Z}^{+}\rightarrow\mathbb{Z}^{+}$ satisfying \[f_k(x)=x+k\varphi(x)\] where $\varphi(x)$ is Euler's totient function, that is, the number of positive integers up to $x$ coprime to $x$. We define a sequence $a_1,a_2,...,a_{10}$ with [list] [*] $a_1=c$, and [*] $a_n=f_k(a_{n-1}) \text{ }\forall \text{ } 2\le n\le 10$ [/list] Is it possible to choose the initial value $c\ne 1$ such that each term is a multiple of the previous, if (a) $k=2025$ ? (b) $k=2065$ ? [i]Proposed by chorn[/i]

Find all functions $f:Q\rightarrow Q$ such that \[ f(x+y)+f(y+z)+f(z+t)+f(t+x)+f(x+z)+f(y+t)\ge 6f(x-3y+5z+7t) \] for all $x,y,z,t\in Q.$

Let $z$ be a complex non-zero number such that $Re(z),Im(z)\in \mathbb{Z}$. Prove that $z$ is uniquely representable as $a_0+a_1(1+i)+a_2(1+i)^2+\dots+a_n(1+i)^n$ where $n\geq 0$ and $a_j \in \{0,1\}$ and $a_n=1$. Time allowed for this problem was 1 hour.

Let $n \geq 3$ be a positive integer. A [i]chipped $n$-board[/i] is a $2 \times n$ checkerboard with the bottom left square removed. Lino wants to tile a chipped $n$-board and is allowed to use the following types of tiles: [list] [*] Type 1: any $1 \times k$ board where $1 \leq k \leq n$ [*] Type 2: any chipped $k$-board where $1 \leq k \leq n$ that must cover the left-most tile of the $2 \times n$ checkerboard. [/list] Two tilings $T_1$ and $T_2$ are considered the same if there is a set of consecutive Type 1 tiles in both rows of $T_1$ that can be vertically swapped to obtain the tiling $T_2$. For example, the following three tilings of a chipped $7$-board are the same: [img]http://i.imgur.com/8QaSgc0.png[/img] For any positive integer $n$ and any positive integer $1 \leq m \leq 2n - 1$, let $c_{m,n}$ be the number of distinct tilings of a chipped $n$-board using exactly $m$ tiles (any combination of tile types may be used), and define the polynomial $$P_n(x) = \sum^{2n-1}_{m=1} c_{m,n}x^m.$$ Find, with justification, polynomials $f(x)$ and $g(x)$ such that $$P_n(x) = f(x)P_{n-1}(x) + g(x)P_{n-2}(x)$$ for all $n \geq 3$.

Suppose the function $\psi$ satisfies $\psi(1)=\sqrt{2+\sqrt{2+\sqrt2}}$ and $\psi(3x)+3\psi(x)=\psi(x)^3$ for all real $x$. Determine the greatest integer less than $\textstyle\prod_{n=1}^{100}\psi(3^n)$.

Let $n(n>1)$ be an odd. We define $x_k=(x^{(k)}_1,x^{(k)}_2,\cdots ,x^{(k)}_n)$ as follow: $x_0=(x^{(0)}_1,x^{(0)}_2,\cdots ,x^{(0)}_n)=(1,0,\cdots ,0,1)$; $ x^{(k)}_i =\begin{cases}0, \quad x^{(k-1)}_i=x^{(k-1)}_{i+1},\\ 1, \quad x^{(k-1)}_i\not= x^{(k-1)}_{i+1},\end{cases} $ $i=1,2,\cdots ,n$, where $x^{(k-1)}_{n+1}= x^{(k-1)}_1$. Let $m$ be a positive integer satisfying $x_0=x_m$. Prove that $m$ is divisible by $n$.

Show that if $f: [0,1]\rightarrow [0,1]$ is a continous function and it has topological transitivity then periodic points of $f$ are dense in $[0,1]$. Topological transitivity means there for every open sets $U$ and $V$ there is $n>0$ such that $f^n(U)\cap V\neq \emptyset$.