Let $m,n \geqslant 2$ be integers, let $X$ be a set with $n$ elements, and let $X_1,X_2,\ldots,X_m$ be pairwise distinct non-empty, not necessary disjoint subset of $X$. A function $f \colon X \to \{1,2,\ldots,n+1\}$ is called [i]nice[/i] if there exists an index $k$ such that \[\sum_{x \in X_k} f(x)>\sum_{x \in X_i} f(x) \quad \text{for all } i \ne k.\] Prove that the number of nice functions is at least $n^n$.

Find all functions $f:\mathbb{R}\rightarrow \mathbb{R}$ such that for any real value of $x,y$ we have: $$f(xf(y)+f(x)+y)=xy+f(x)+f(y)$$

Let $f$ be a function defined on positive integers such that $f(1)=4$, $f(2n)=f(n)$ and $f(2n+1)=f(n)+2$ for every positive integer $n$. For how many positive integers $k$ less than $2014$, it is $f(k)=8$? $ \textbf{(A)}\ 45 \qquad\textbf{(B)}\ 120 \qquad\textbf{(C)}\ 165 \qquad\textbf{(D)}\ 180 \qquad\textbf{(E)}\ 215 $

Let $\sigma, \tau$ be two permutations of the quantity $\{1, 2,. . . , n\}$. Prove that there is a function $f: \{1, 2,. . . , n\} \to \{-1, 1\}$ such that for any $1 \le i \le j \le n$, we have $\left|\sum_{k=i}^{j} f(\sigma (k)) \right| \le 2$ and $\left|\sum_{k=i}^{j} f(\tau (k))\right| \le 2$

Le $S$ be the set of positive integers greater than or equal to $2$. A function $f: S\rightarrow S$ is italian if $f$ satifies all the following three conditions: 1) $f$ is surjective 2) $f$ is increasing in the prime numbers(that is, if $p_1<p_2$ are prime numbers, then $f(p_1)<f(p_2)$) 3) For every $n\in S$ the number $f(n)$ is the product of $f(p)$, where $p$ varies among all the primes which divide $n$ (For instance, $f(360)=f(2^3\cdot 3^2\cdot 5)=f(2)\cdot f(3)\cdot f(5)$). Determine the maximum and the minimum possible value of $f(2020)$, when $f$ varies among all italian functions.

Let $ f(x)$ be a real function such that \[ \lim_{x \rightarrow \plus{}\infty} \frac{f(x)}{e^x}\equal{}1\] and $ |f''(x)|\leq c|f'(x)|$ for all sufficiently large $ x$. Prove that \[ \lim_{x \rightarrow \plus{}\infty} \frac{f'(x)}{e^x}\equal{}1.\] [i]P. Erdos[/i]

Show that a function $ f(x)\equal{}\int_{\minus{}1}^1 (1\minus{}|\ t\ |)\cos (xt)\ dt$ is continuous at $ x\equal{}0$.

Find all continuous functions $f: \mathbb{R}\to\mathbb{R}$ such that for all real $x$ we have \[f(x)=f\left(x^{2}+\frac{x}{3}+\frac{1}{9}\right). \]

Let $\mathbb{R}^{*}$ be the set of non-zero real numbers. Find all functions $f : \mathbb{R}^{*} \to \mathbb{R}^{*}$ such that $f(x^{2}+y) = (f(x))^{2} + \frac{f(xy)}{f(x)}$, for all $x,y \in \mathbb{R}^{*}$ and $-x^{2} \not= y$.

Given $a\in (0,1)$ and $C$ the set of increasing functions $f:[0,1]\to [0,\infty )$ such that $\int\limits_{0}^{1}{f(x)}dx=1$ . Determine: $(a)\underset{f\in C}{\mathop{\max }}\,\int\limits_{0}^{a}{f(x)dx}$ $(b)\underset{f\in C}{\mathop{\max }}\,\int\limits_{0}^{a}{{{f}^{2}}(x)dx}$

Determine all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ such that \[f(x+yf(x))=f(x)+xf(y) \quad \text{for all}\ x,y \in\mathbb{R}\]

Let $ a_0$ be a natural number. The sequence $ (a_n)$ is defined by $ a_{n\plus{}1}\equal{}\frac{a_n}{5}$ if $ a_n$ is divisible by $ 5$ and $ a_{n\plus{}1}\equal{}[a_n \sqrt{5}]$ otherwise . Show that the sequence $ a_n$ is increasing starting from some term.

Let $ \mathbb{N}_0$ denote the set of nonnegative integers. Find all functions $ f$ from $ \mathbb{N}_0$ to itself such that \[ f(m \plus{} f(n)) \equal{} f(f(m)) \plus{} f(n)\qquad \text{for all} \; m, n \in \mathbb{N}_0. \]

The game of $pebbles$ is played on an infinite board of lattice points $(i,j)$. Initially there is a $pebble$ at $(0,0)$. A move consists of removing a $pebble$ from point $(i,j)$and placing a $pebble$ at each of the points $(i+1,j)$ and $(i,j+1)$ provided both are vacant. Show taht at any stage of the game there is a $pebble$ at some lattice point $(a,b)$ with $0 \leq a+b \leq 3$

For every set $S$ with $n(\ge3)$ distinct integers, show that there exists a function $f:\{1,2,\dots,n\}\rightarrow S$ satisfying the following two conditions. (i) $\{ f(1),f(2),\dots,f(n)\} = S$ (ii) $2f(j)\neq f(i)+f(k)$ for all $1\le i<j<k\le n$.

A uniform pool ball of radius $r$ and mass $m$ begins at rest on a pool table. The ball is given a horizontal impulse $J$ of fixed magnitude at a distance $\beta r$ above its center, where $-1 \le \beta \le 1$. The coefficient of kinetic friction between the ball and the pool table is $\mu$. You may assume the ball and the table are perfectly rigid. Ignore effects due to deformation. (The moment of inertia about the center of mass of a solid sphere of mass $m$ and radius $r$ is $I_{cm} = \frac{2}{5}mr^2$.) [asy] size(250); pen dps = linewidth(0.7) + fontsize(10); defaultpen(dps); filldraw(circle((0,0),1),gray(.8)); draw((-3,-1)--(3,-1)); draw((-2.4,0.1)--(-2.4,0.6),EndArrow); draw((-2.5,0)--(2.5,0),dashed); draw((-2.75,0.7)--(-0.8,0.7),EndArrow); label("$J$",(-2.8,0.7),W); label("$\beta r$",(-2.3,0.35),E); draw((0,-1.5)--(0,1.5),dashed); draw((1.7,-0.1)--(1.7,-0.9),BeginArrow,EndArrow); label("$r$",(1.75,-0.5),E); [/asy] (a) Find an expression for the final speed of the ball as a function of $J$, $m$, and $\beta$. (b) For what value of $\beta$ does the ball immediately begin to roll without slipping, regardless of the value of $\mu$?

Given that a sequence satisfies $x_0=0$ and $|x_k|=|x_{k-1}+3|$ for all integers $k\ge 1,$ find the minimum possible value of $|x_1+x_2+\cdots+x_{2006}|$.

Let $x_1=1$, $x_2$, $x_3$, $\ldots$ be a sequence of real numbers such that for all $n\geq 1$ we have \[ x_{n+1} = x_n + \frac 1{2x_n} . \] Prove that \[ \lfloor 25 x_{625} \rfloor = 625 . \]

Let $\mathbb{R}^{+}$ be the set of positive real numbers. Find all functions $f:\mathbb{R}^{+} \rightarrow \mathbb{R}^{+}$ such that for all $x,y>0$ we have $$f(xy+f(x))=yf(x)+x.$$ [i]Proposed by Nikola Velov[/i]

Let $ ABC$ be a triangle and $ K$ and $ L$ be two points on $ (AB)$, $ (AC)$ such that $ BK \equal{} CL$ and let $ P \equal{} CK\cap BL$. Let the parallel through $ P$ to the interior angle bisector of $ \angle BAC$ intersect $ AC$ in $ M$. Prove that $ CM \equal{} AB$.

A function $f(x)$ satisfies $\begin{cases} f(x)=-f''(x)-(4x-2)f'(x)\\ f(0)=a,\ f(1)=b \end{cases}$ Evaluate $\int_0^1 f(x)(x^2-x)\ dx.$

sppose that $\sigma_k:\mathbb N \longrightarrow \mathbb R$ is a function such that $\sigma_k(n)=\sum_{d|n}d^k$. $\rho_k:\mathbb N \longrightarrow \mathbb R$ is a function such that $\rho_k\ast \sigma_k=\delta$. find a formula for $\rho_k$.($\frac{100}{6}$ points)

Does there exist a function $f: \mathbb R \to \mathbb R $ satisfying the following conditions: (i) for each real $y$ there is a real $x$ such that $f(x)=y$ , and (ii) $f(f(x)) = (x - 1)f(x) + 2$ for all real $x$ ? [i]Proposed by Igor I. Voronovich, Belarus[/i]

Let $S$ be a finite set with $n{}$ $(n>1)$ elements, $M{}$ the set of all subsets of $S{}$ and a function $f:M\rightarrow\mathbb{R}$, that verifies the relation $f(A\cap B)=\min\{f(A),f(B)\}, \forall A,B\in M$. Show that $$\sum_{A\in M} (-1)^{n-|A|}\cdot f(A)=f(S)-\max\{f(A)|A\in M, A\neq S\},$$ where$|A|$ is the number of elements of subset $A{}$.

[b]a.)[/b] Let $a,b$ be real numbers. Define sequence $x_k$ and $y_k$ such that \[x_0 = 1, y_0 = 0, x_{k+1} = a \cdot x_k - b \cdot y_l, \quad y_{k+1} = x_k - a \cdot y_k \text{ for } k = 0,1,2, \ldots \] Prove that \[x_k = \sum^{[k/2]}_{l=0} (-1)^l \cdot a^{k - 2 \cdot l} \cdot \left(a^2 + b \right)^l \cdot \lambda_{k,l}\] where $\lambda_{k,l} = \sum^{[k/2]}_{m=l} \binom{k}{2 \cdot m} \cdot \binom{m}{l}$ [b]b.)[/b] Let $u_k = \sum^{[k/2]}_{l=0} \lambda_{k,l} $. For positive integer $m,$ denote the remainder of $u_k$ divided by $2^m$ as $z_{m,k}$. Prove that $z_{m,k},$ $k = 0,1,2, \ldots$ is a periodic function, and find the smallest period.