Found problems: 2349
Let $\mathbb{Q^+}$ denote the set of positive rational numbers. Determine all functions $f: \mathbb{Q^+} \to \mathbb{Q^+}$ that satisfy the conditions
\[ f \left( \frac{x}{x+1}\right) = \frac{f(x)}{x+1} \qquad \text{and} \qquad f \left(\frac{1}{x}\right)=\frac{f(x)}{x^3}\]
for all $x \in \mathbb{Q^+}.$
Let $n\in\mathbb{N}\setminus\left\{0\right\}$ be a positive integer. Find all the functions $f:\mathbb{R}\rightarrow \mathbb{R}$ satisfying that : $$f(x+y^{2n})=f(f(x))+y^{2n-1}f(y),(\forall)x,y\in\mathbb{R},$$ and $f(x)=0$ has an unique solution.
Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ which satisfies the followings. (Note that $\mathbb{R}$ stands for the set of all real numbers)
(1) For each real numbers $x$, $y$, the equality $f(x+f(x)+xy) = 2f(x)+xf(y)$ holds.
(2) For every real number $z$, there exists $x$ such that $f(x) = z$.
Call a function $\mathbb Z_{>0}\rightarrow \mathbb Z_{>0}$ $\emph{M-rugged}$ if it is unbounded and satisfies the following two conditions:
$(1)$ If $f(n)|f(m)$ and $f(n)<f(m)$ then $n|m$.
$(2)$ $|f(n+1)-f(n)|\leq M$.
a. Find all $1-rugged$ functions.
b. Determine if the number of $2-rugged$ functions is smaller than $2019$.
Determine all functions $f:\mathbb R\rightarrow\mathbb R$ satisfying the condition
\[f(y^2+2xf(y)+f(x)^2)=(y+f(x))(x+f(y))\]
for all real numbers $x$ and $y$.
Find all functions $f: \mathbb{R}\rightarrow \mathbb{R}$ such that
\[ f(xy-1) + f(x)f(y) = 2xy-1 \]
for all x and y
Prove that there's no function $f: \mathbb{R}^+\rightarrow\mathbb{R}^+$ such that $f(x)^2\ge f(x+y)\left(f(x)+y\right)$ for all $x,y>0$.
Find all functions $f : \mathbb{R} \to \mathbb{R}$ such that for any real numbers $x , y$ this equality holds :
$$f(yf(x)+f(x)f(y))=xf(y)+f(xy)$$
[i]Proposed by Navid Safaei[/i]
Find all functions $f:\mathbb{Z}^+\rightarrow \mathbb{Z}^+$ satisfying $$m!!+n!!\mid f(m)!!+f(n)!!$$for each $m,n\in \mathbb{Z}^+$, where $n!!=(n!)!$ for all $n\in \mathbb{Z}^+$.
[i]Proposed by DVDthe1st[/i]
Let $\mathbb Q_{>0}$ be the set of all positive rational numbers. Let $f:\mathbb Q_{>0}\to\mathbb R$ be a function satisfying the following three conditions:
(i) for all $x,y\in\mathbb Q_{>0}$, we have $f(x)f(y)\geq f(xy)$;
(ii) for all $x,y\in\mathbb Q_{>0}$, we have $f(x+y)\geq f(x)+f(y)$;
(iii) there exists a rational number $a>1$ such that $f(a)=a$.
Prove that $f(x)=x$ for all $x\in\mathbb Q_{>0}$.
[i]Proposed by Bulgaria[/i]
If $f,g: \mathbb{R} \to \mathbb{R}$ are functions that satisfy $f(x+g(y)) = 2x+y $ $\forall x,y \in \mathbb{R}$, then determine $g(x+f(y))$.
For some positive integer $n,$ Elmo writes down the equation
\[x_1+x_2+\dots+x_n=x_1+x_2+\dots+x_n.\]
Elmo inserts at least one $f$ to the left side of the equation and adds parentheses to create a valid functional equation. For example, if $n=3,$ Elmo could have created the equation
\[f(x_1+f(f(x_2)+x_3))=x_1+x_2+x_3.\]
Cookie Monster comes up with a function $f: \mathbb{Q}\to\mathbb{Q}$ which is a solution to Elmo's functional equation. (In other words, Elmo's equation is satisfied for all choices of $x_1,\dots,x_n\in\mathbb{Q})$. Is it possible that there is no integer $k$ (possibly depending on $f$) such that $f^k(x)=x$ for all $x$?
[i]Srinivas Arun[/i]
Find all functions $f:\mathbb{R} \to \mathbb{R}$ satisfying the equation \[
f(x^2+y^2+2f(xy)) = (f(x+y))^2.
\] for all $x,y \in \mathbb{R}$.
Find all continuous functions $f:\mathbb{R}^+\rightarrow \mathbb{R}^+$ such that $$f(xf(y))+f(yf(x))=1+f(x+y)$$ for all $x, y>0.$
Find all functions $f:\mathbb R^+ \to \mathbb R^+$ satisfying
\begin{align*}
f\left(\frac{1}{x}\right) \geq 1 - \frac{\sqrt{f(x)f\left(\frac{1}{x}\right)}}{x} \geq x^2 f(x),
\end{align*}
for all positive real numbers $x$.
Let $f:\mathbb R^+ \to \mathbb R^+$ be a function such that: \[
x,y > 0 \qquad f(x+f(y)) = yf(xy+1).
\]
a) Show that $(y-1)*(f(y)-1) \le 0$ for $y>0$.
b) Find all such functions that require the given condition.
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]
Fin the functions $ f:\mathbb{N}\longrightarrow\mathbb{N} $ such that:
$$ \frac{f(x+y)+f(x)}{2x+f(y)} =\frac{2y+f(x)}{f(x+y)+f(y)} ,\quad\forall x,y\in\mathbb{N} . $$
Find all function $f:\mathbb{N}^*\rightarrow \mathbb{N}^*$ that satisfy:
$(f(1))^3+(f(2))^3+...+(f(n))^3=(f(1)+f(2)+...+f(n))^2$
Let $\,{\mathbb{R}}\,$ denote the set of all real numbers. Find all functions $\,f: {\mathbb{R}}\rightarrow {\mathbb{R}}\,$ such that \[ f\left( x^{2}+f(y)\right) =y+\left( f(x)\right) ^{2}\hspace{0.2in}\text{for all}\,x,y\in \mathbb{R}. \]
Find all functions $f: R \rightarrow R$ such that
\[f(x+yf(x))+f(xf(y)-y)=f(x)-f(y)+2xy\]
for all $x,y \in R$
Determine all functions $f: \mathbb {N} \to \mathbb {N}$ such that
$n!\hspace{1mm} +\hspace{1mm} f(m)!\hspace{1mm} |\hspace{1mm} f(n)!\hspace{1mm} +\hspace{1mm} f(m!)$,
for all $m$, $n$ $\in$ $\mathbb{N}$.
For each positive integer $k$, let $d(k)$ be the number of positive divisors of $k$ and $\sigma(k)$ be the sum of positive divisors of $k$. Let $\mathbb N$ be the set of all positive integers. Find all functions $f: \mathbb{N} \to \mathbb N$ such that \begin{align*}
f(d(n+1)) &= d(f(n)+1)\quad \text{and} \\
f(\sigma(n+1)) &= \sigma(f(n)+1)
\end{align*}
for all positive integers $n$.
Find all function $f: \mathbb{R} \rightarrow \mathbb{R}$ satisfied
\[f(x+y) + f(x)f(y) = f(xy) + 1 \]
$\forall x, y \in \mathbb{R}$
Find all functions $f : N \to N$ such that $$\frac{f(x+y)+f(x)}{2x+f(y)}= \frac{2y+f(x)}{f(x+y)+f(y)}$$ , for all $x, y$ in $N$.