Let $f:\mathbb N\to \mathbb N$. Show that $f(m)+n\mid f(n)+m$ for all positive integers $m\le n$ if and only if $f(m)+n\mid f(n)+m$ for all positive integers $m\ge n$. [i]Proposed by Carl Schildkraut[/i]

$f,g:\mathbb{R}\rightarrow\mathbb{R}$ find all $f,g$ satisfying $\forall x,y\in \mathbb{R}$: \[g(f(x)-y)=f(g(y))+x.\]

It is given the function $f: \left(\mathbb{R} - \{0\}\right) \to \mathbb{R}$ such that $f(x)=x+\frac{1}{x}$. Is this function injective ? Justify your answer.

Let $f:\mathbb{R}^+\to\mathbb{R}^+$ be such that $$f(x+f(y))^2\geq f(x)\left(f(x+f(y))+f(y)\right)$$ for all $x,y\in\mathbb{R}^+$. Show that $f$ is [i]unbounded[/i], i.e. for each $M\in\mathbb{R}^+$, there exists $x\in\mathbb{R}^+$ such that $f(x)>M$.

Two subsets $A$ and $B$ of the $(x,y)$-plane are said to be [i]equivalent[/i] if there exists a function $f: A\to B$ which is both one-to-one and onto. (i) Show that any two line segments in the plane are equivalent. (ii) Show that any two circles in the plane are equivalent.

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.

Is there any function $ f : \mathbb{R}\to\mathbb{R}$ satisfying following conditions: $1) f(0) = 1$ $2) f(x+f(y)) = f(x+y) + 1$, for all $x,y \to\mathbb{R} $ $3)$ there exist rational, but not integer $x_0$, such $f(x_0)$ is integer

If $a,b,c>0$, what is the smallest possible value of $ \left\lfloor \dfrac {a+b}{c} \right\rfloor + \left\lfloor \dfrac {b+c}{a} \right\rfloor + \left\lfloor \dfrac {c+a}{b} \right\rfloor $? (Note that $ \lfloor x \rfloor $ denotes the greatest integer less than or equal to $x$.)

Let $S$ be a finite set. $f$ is a function defined on the subset-group $2^S$ of set $S$. $f$ is called $\textsl{monotonic decreasing}$ if when $X \subseteq Y\subseteq S$, then $f(X) \geq f(Y)$ holds. Prove that: $f(X \cup Y)+f(X \cap Y ) \leq f(X)+ f(Y)$ for $X, Y \subseteq S$ if and only if $g(X)=f(X \cup \{ a \}) - f(X)$ is a $\textsl{monotonic decreasing}$ funnction on the subset-group $2^{S \setminus \{a\}}$ of set $S \setminus \{a\}$ for any $a \in S$.

Let $f : \mathbb R \to \mathbb R$ be a real-valued function defined on the set of real numbers that satisfies \[f(x + y) \leq yf(x) + f(f(x))\] for all real numbers $x$ and $y$. Prove that $f(x) = 0$ for all $x \leq 0$. [i]Proposed by Igor Voronovich, Belarus[/i]

A circular disk is partitioned into $ 2n$ equal sectors by $ n$ straight lines through its center. Then, these $ 2n$ sectors are colored in such a way that exactly $ n$ of the sectors are colored in blue, and the other $ n$ sectors are colored in red. We number the red sectors with numbers from $ 1$ to $ n$ in counter-clockwise direction (starting at some of these red sectors), and then we number the blue sectors with numbers from $ 1$ to $ n$ in clockwise direction (starting at some of these blue sectors). Prove that one can find a half-disk which contains sectors numbered with all the numbers from $ 1$ to $ n$ (in some order). (In other words, prove that one can find $ n$ consecutive sectors which are numbered by all numbers $ 1$, $ 2$, ..., $ n$ in some order.) [hide="Problem 8 from CWMO 2007"]$ n$ white and $ n$ black balls are placed at random on the circumference of a circle.Starting from a certain white ball,number all white balls in a clockwise direction by $ 1,2,\dots,n$. Likewise number all black balls by $ 1,2,\dots,n$ in anti-clockwise direction starting from a certain black ball.Prove that there exists a chain of $ n$ balls whose collection of numbering forms the set $ \{1,2,3\dots,n\}$.[/hide]

A sequence of functions $\, \{f_n(x) \} \,$ is defined recursively as follows: \begin{align*}f_1(x) &= \sqrt{x^2 + 48}, \quad \mbox{and} \\ f_{n+1}(x) &= \sqrt{x^2 + 6f_n(x)} \quad \mbox{for } n \geq 1.\end{align*} (Recall that $\sqrt{\makebox[5mm]{}}$ is understood to represent the positive square root.) For each positive integer $n$, find all real solutions of the equation $\, f_n(x) = 2x \,$.

Consider $n$ lamps clockwise numbered from $1$ to $n$ on a circle. Let $\xi$ to be a configuration where $0 \le \ell \le n$ random lamps are turned on. A [i]cool procedure[/i] consists in perform, simultaneously, the following operations: for each one of the $\ell$ lamps which are turned on, we verify the number of the lamp; if $i$ is turned on, a [i]signal[/i] of range $i$ is sent by this lamp, and it will be received only by the next $i$ lamps which follow $i$, turned on or turned off, also considered clockwise. At the end of the operations we verify, for each lamp, turned on or turned off, how many signals it has received. If it was reached by an even number of signals, it remains on the same state(that is, if it was turned on, it will be turned on; if it was turned off, it will be turned off). Otherwise, it's state will be changed. The example in attachment, for $n=4$, ilustrates a configuration where lamps $2$ and $4$ are initially turned on. Lamp $2$ sends signal only for the lamps $3$ e $4$, while lamp $4$ sends signal for lamps $1$, $2$, $3$ e $4$. Therefore, we verify that lamps $1$ e $2$ received only one signal, while lamps $3$ e $4$ received two signals. Therefore, in the next configuration, lamps $1$ e $4$ will be turned on, while lamps $2$ e $3$ will be turned off. Let $\Psi$ to be the set of all $2^n$ possible configurations, where $0 \le \ell \le n$ random lamps are turned on. We define a function $f: \Psi \rightarrow \Psi$ where, if $\xi$ is a configuration of lamps, then $f(\xi)$ is the configurations obtained after we perform the [i]cool procedure[/i] described above. Determine all values of $n$ for which $f$ is bijective.

Find all functions $ f$ defined on non-negative real numbers having the following properties: (i) For all non-negative $ x$ it is $ f(x) \geq 0$. (ii) It is $ f\left(1\right)\equal{}\frac 12$. (iii) For all non-negative numbers $ x,y$ it is $ f\left( y \cdot f(x) \right) \cdot f(x) \equal{} f(x\plus{}y)$.

Let us consider a triangle $\Delta{PQR}$ in the co-ordinate plane. Show for every function $f: \mathbb{R}^2\to \mathbb{R}\;,f(X)=ax+by+c$ where $X\equiv (x,y) \text{ and } a,b,c\in\mathbb{R}$ and every point $A$ on $\Delta PQR$ or inside the triangle we have the inequality: \begin{align*} & f(A)\le \text{max}\{f(P),f(Q),f(R)\} \end{align*}