We define the [i]Fibonacci sequence[/i] $\{F_n\}_{n\ge0}$ by $F_0=0$, $F_1=1$, and for $n\ge2$, $F_n=F_{n-1}+F_{n-2}$; we define the [i]Stirling number of the second kind[/i] $S(n,k)$ as the number of ways to partition a set of $n\ge1$ distinguishable elements into $k\ge1$ indistinguishable nonempty subsets. For every positive integer $n$, let $t_n = \sum_{k=1}^{n} S(n,k) F_k$. Let $p\ge7$ be a prime. Prove that \[ t_{n+p^{2p}-1} \equiv t_n \pmod{p} \] for all $n\ge1$. [i]Proposed by Victor Wang[/i]

(a) Let $a,x,y$ be positive integers. Prove: if $x\ne y$, the also \[ax+\gcd(a,x)+\text{lcm}(a,x)\ne ay+\gcd(a,y)+\text{lcm}(a,y).\] (b) Show that there are no two positive integers $a$ and $b$ such that \[ab+\gcd(a,b)+\text{lcm}(a,b)=2014.\]

Find all functions $f: \mathbb R \rightarrow \mathbb R$ such that \[f(x+xy+f(y)) = \left(f(x)+\frac{1}{2}\right) \left(f(y)+\frac{1}{2}\right)\] holds for all real numbers $x,y$.

Consider a function $f: \mathbb Z \to \mathbb Z$ such that for every integer $n \ge 0$, there are at most $0.001n^2$ pairs of integers $(x,y)$ for which $f(x+y) \neq f(x)+f(y)$ and $\max\{ \lvert x \rvert, \lvert y \rvert \} \le n$. Is it possible that for some integer $n \ge 0$, there are more than $n$ integers $a$ such that $f(a) \neq a \cdot f(1)$ and $\lvert a \rvert \le n$? [i]Proposed by David Yang[/i]

Find the functions $ f:\mathbb{N}\longrightarrow\mathbb{N} $ that satisfy the following relation: $$ \gcd\left( x,f(y)\right)\cdot\text{lcm}\left(f(x), y\right) = \gcd (x,y)\cdot\text{lcm}\left( f(x), f(y)\right) ,\quad\forall x,y\in\mathbb{N} . $$

Let $ f,g:\mathbb{R}\longrightarrow\mathbb{R} $ be functions with the property that $$ f\left( g(x) \right) =g\left( f(x) \right) =-x,\quad\forall x\in\mathbb{R} $$ [b]a)[/b] Show that $ f,g $ are odd. [b]b)[/b] Give a concrete example of such $ f,g. $

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]

Does there exist a function $f:[0,1]\rightarrow (0,\infty)$ such that [list] [*]$f$ is differentiable on $[0,1]$ [*] It's derivative $f'$ is continuous on $[0,1]$. [*] $(f'(x))^3-x^{\frac{1}{3}}>6(1-f(x)^{\frac{1}{5}})$ for all $x\in [0,1]$. [*] $f(1)=1$ [/list] [i]Proposed by Medhansh Tripathi[/i]

Find all functions $f$ from the set of real numbers to itself satisfying \[ f(x(1+y)) = f(x)(1 + f(y)) \] for all real numbers $x, y$.

Let $f(x)$ be a real function such that for each positive real $c$ there exist a polynomial $P(x)$ (maybe dependent on $c$) such that $| f(x) - P(x)| \leq c \cdot x^{1998}$ for all real $x$. Prove that $f$ is a real polynomial.

Prove that there is no function $f:\mathbb{N}\rightarrow \mathbb{N}$ such that $f(f(n))=n+1.$ Here $\mathbb{N}$ is the positive integers $\{1,2,3,\dots\}.$

Let $ I,J $ be two intervals, $ \varphi :J\longrightarrow\mathbb{R} $ be a continuous function whose image doesn't contain $ 0, $ and $ f,g:I\longrightarrow J $ be two differentiable functions such that $ f'=\varphi\circ f,g'=\varphi\circ g $ and such that the image of $ f-g $ contains $ 0. $ Show that $ f $ and $ g $ are the same function.

Find all functions $f : Z \to Z$ for which $f(g(n)) - g(f(n))$ is independent on $n$ for any $g : Z \to Z$.

Suppose $a>b>0$, $f(x)=\dfrac{2(a+b)x+2ab}{4x+a+b}$. Show that there exists an unique positive number $x$, such that $f(x)=\left(\dfrac{a^{\frac{1}{3}}+b^{\frac{1}{3}}}{2} \right)^3$.

Find all functions $f:\mathbb{Z}\to \mathbb{Z}_{>0}$ for which \[f(x+f(y))^2+f(y+f(x))^2=f(f(x)+f(y))^2+1\] holds for any $x,y\in \mathbb{Z}$.