Let $S$ be the set of all real numbers greater than or equal to $1$. Determine all functions$ f: S \to S$, so that for all real numbers $x ,y \in S$ with $x^2 -y^2 \in S$ the condition $f (x^2 -y^2) = f (xy)$ is fulfilled.

Find all functions $f : R-\{0\} \to R$ which satisfy $(1 + y)f(x) - (1 + x)f(y) = yf(x/y) - xf(y/x)$ for all real $x, y \ne 0$, and which take the values $f(1) = 32$ and $f(-1) = -4$.

Let $\mathbb{N}$ be the set of all positive integers. Find all functions $f\colon \mathbb{N}\to \mathbb{N}$ such that $mf(m)+(f(f(m))+n)^2$ divides $4m^4+n^2f(f(n))^2$ for all positive integers $m$ and $n$.

A function $f:\mathbb{R}\rightarrow\mathbb{R}$ satisfies the conditions \[\begin{cases}f(x+24)\le f(x)+24\\ f(x+77)\ge f(x)+77\end{cases}\quad\text{for all}\ x\in\mathbb{R}\] Prove that $f(x+1)=f(x)+1$ for all real $x$.

Let $f : Q \to Q$ be a function satisfying the equation $f(x + y) = f(x) + f(y) + 2547$ for all rational numbers $x, y$. If $f(2004) = 2547$, find $f(2547)$.

A function $g$ is such that for all integer $n$: $$g(n)=\begin{cases} 1\hspace{0.5cm} \textrm{if}\hspace{0.1cm} n\geq 1 & \\ 0 \hspace{0.5cm} \textrm{if}\hspace{0.1cm} n\leq 0 & \end{cases}$$ A function $f$ is such that for all integers $n\geq 0$ and $m\geq 0$: $$f(0,m)=0 \hspace{0.5cm} \textrm{and}$$ $$f(n+1,m)=\Bigl(1-g(m)+g(m)\cdot g(m-1-f(n,m))\Bigr)\cdot\Bigl(1+f(n,m)\Bigr)$$ Find all the possible functions $f(m,n)$ that satisfies the above for all integers $n\geq0$ and $m\geq 0$

Find all continuous functions $f$ such that $f(x)+ f(x^2) = 0$ for all real numbers $x$.

Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that $$f\left(x^3+f(y)\right)=x^2f(x)+y,$$for all $x,y\in\mathbb{R}.$ (Here $\mathbb{R}$ denotes the set of all real numbers.)

Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that \[f\left( {yf(x + y) + f(x)} \right) = 4x + 2yf(x + y)\] for all $x,y\in\mathbb{R}$. [i]Netherlands (Birgit van Dalen)[/i]

Let $Q^+$ denote the set of positive rationals. Determine all functions $f : Q^+ \to Q^+$ that satisfy both of these conditions: (i) $f(x)$ is an integer if and only if $x$ is an integer; (ii) $f(f(xf(y)) + x) = yf(x) + x$ for all $x, y \in Q^+$.

An infinite table whose rows and columns are numbered with positive integers, is given. For a sequence of functions $f_1(x), f_2(x), \ldots $ let us place the number $f_i(j)$ into the cell $(i,j)$ of the table (for all $i, j\in \mathbb{N}$). A sequence $f_1(x), f_2(x), \ldots $ is said to be {\it nice}, if all the numbers in the table are positive integers, and each positive integer appears exactly once. Determine if there exists a nice sequence of functions $f_1(x), f_2(x), \ldots $, such that each $f_i(x)$ is a polynomial of degree 101 with integer coefficients and its leading coefficient equals to 1.

Let $\mathbb{R}_{>0}$ be the set of the positive real numbers. Find all functions $f:\mathbb{R}_{>0} \rightarrow \mathbb{R}_{>0}$ such that $$f(xy+f(x))=f(f(x)f(y))+x$$ for all positive real numbers $x$ and $y$.

Find all functions $f: \mathbb{N}_{0}\to \mathbb{N}_{0}$ such that for all $n\in \mathbb{N}_{0}$: \[f(m+f(n))=f(f(m))+f(n).\]

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]

Determine whether there exists a function $f: \mathbb{Z}_{> 0} \rightarrow \mathbb{Z}_{> 0}$ such that for all positive integers $m$ and $n$, \[f(m+nf(m))=f(n)^m+2024! \cdot m.\] [i]Jaedon Whyte[/i]

[b]Q.[/b] Determine all the functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(x) \geqslant x+1, \forall\ x \in \mathbb{R}\quad \text{and}\quad f(x+y) \geqslant f(x) f(y), \forall\ x, y \in \mathbb{R}$$ [i]Proposed by TuZo[/i]

Find all the functions $f: \mathbb{R} \to\mathbb{R}$ such that \[f(x-f(y))=f(f(y))+xf(y)+f(x)-1\] for all $x,y \in \mathbb{R} $.

A function $f$ is defined on the positive integers by \[\left\{\begin{array}{rcl}f(1) &=& 1, \\ f(3) &=& 3, \\ f(2n) &=& f(n), \\ f(4n+1) &=& 2f(2n+1)-f(n), \\ f(4n+3) &=& 3f(2n+1)-2f(n), \end{array}\right.\] for all positive integers $n$. Determine the number of positive integers $n$, less than or equal to 1988, for which $f(n) = n$.

Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $$f(x + f(y)) + f(x - f(y)) = x.$$

Prove that there exists exactly one function $ƒ$ which is defined for all $x \in R$, and for which holds: $\bullet$ $x \le y \Rightarrow f(x) \le f(y)$, for all $x, y \in R$, and $\bullet$ $f(f(x)) = x$, for all $x \in R$.

Let $\mathbb{P}$ be the set of positive rational numbers and let $f:\mathbb{P}\to\mathbb{P}$ be such that $$f(x)+f\left(\frac{1}{x}\right)=1$$ and $$f(2x)=2f(f(x))$$ for all $x\in\mathbb{P}$. Find, with proof, an explicit expression for $f(x)$ for all $x\in \mathbb{P}$.

Find all functions $ f: \mathbb{N} \to \mathbb{N} $ such that $$ f\left(x+yf\left(x\right)\right) = x+f\left(y\right)f\left(x\right) $$ holds for all $ x,y \in \mathbb{N} $

Find all functions $f:\mathbb{R}\mapsto \mathbb{R}$ satisfy: $$f(x^2)+f(xy)=f(x)f(y)+yf(x)+xf(x+y)$$ for all real numbers $x,y$.

Let $ f : [0, 1] \to\ R $ be a function such that :- $1.)$ $f(x) \ge 0$ for all $x$ in $[0,1]$ . $2.)$ $f(1) = 1$ . $3.)$ If $x_1 , x_2$ are in $[0,1]$ such that $x_1 + x_2 \le 1$ , then $f(x_1) + f(x_2) \le f(x_1 + x_2)$ . Show that $f(x) \le 2x $ for all $x$ in $ [0,1] $.

Let $A$ be a finite set of functions $f: \Bbb{R}\to \Bbb{R.}$ It is known that: [list] [*] If $f, g\in A$ then $f (g (x)) \in A.$ [*] For all $f \in A$ there exists $g \in A$ such that $f (f (x) + y) = 2x + g (g (y) - x),$ for all $x, y\in \Bbb{R}.$ [/list] Let $i:\Bbb{R}\to \Bbb{R}$ be the identity function, ie, $i (x) = x$ for all $x\in \Bbb{R}.$ Prove that $i \in A.$