Found problems: 2349
A function $f$ from the set of positive real numbers to itself satisfies
$$f(x + f(y) + xy) = xf(y) + f(x + y)$$
for all positive real numbers $x$ and $y$. Prove that $f(x) = x$ for all positive real numbers $x$.
Let $\mathbb{R}^+$ be the set of positive real numbers. Find all functions $f \colon \mathbb{R}^+ \to \mathbb{R}^+$ such that, for all $x,y \in \mathbb{R}^+$,
$$f(xy+f(x))=xf(y)+2.$$
Determine all the functions $f : R \to R$ such that: $$x + f(xf(y)) = f(y) + yf(x)$$ for all $x, y \in R$.
Find all $a\in\mathbb{R}$ for which there exists a non-constant function $f: (0,1]\rightarrow\mathbb{R}$ such that \[a+f(x+y-xy)+f(x)f(y)\leq f(x)+f(y)\] for all $x,y\in(0,1].$
Determine all functions $f$ from the set of non-negative integers to itself such that $f(a + b) = f(a) + f(b) + f(c) + f(d)$, whenever $a, b, c, d$, are non-negative integers satisfying $2ab = c^2 + d^2$.
The function $f$ is defined on the set $\mathbb{Q}$ of all rational numbers and has values in $\mathbb{Q}$. It satisfies the conditions $f(1) = 2$ and $f(xy) = f(x)f(y) - f(x+y) + 1$ for all $x,y \in \mathbb{Q}$. Determine $f$.
1. Given $n \geq 1$, let $A_{n}$ denote the set of the first $n$ positive integers. We say that a bijection $f: A_{n} \rightarrow A_{n}$ has a hump at $m \in A_{n} \backslash\{1, n\}$ if $f(m)>f(m+1)$ and $f(m)>f(m-1)$. We say that $f$ has a hump at 1 if $f(1)>f(2)$, and $f$ has a hump at $n$ if $f(n)>f(n-1)$. Let $P_{n}$ be the probability that a bijection $f: A_{n} \rightarrow A_{n}$, when selected uniformly at random, has exactly one hump. For how many positive integers $n \leq 2020$ is $P_{n}$ expressible as a unit fraction?
Let $\alpha$ be a real number. Find all the functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that $f(f(x+y))=f(x+y) +f(x)f(y)+ \alpha xy$ for all $x,y \in \mathbb{R}$
Find all functions $f: R \rightarrow R$ such that
$f(x^{2015} + (f(y))^{2015}) = (f(x))^{2015} + y^{2015}$ holds for all reals $x, y$
Find all functions $f:R^{*} \rightarrow R$ such that $f(x)\not = x$ and
$$ f(y(f(x)-x))=\frac{f(x)}{y}-\frac{f(y)}{x} $$ for any $x,y \not = 0$.
Find all functions $f : R \to R$ satisfying the following conditions
(a) $f(1) = 1$,
(b) $f(x + y) = f(x) + f(y)$, $\forall (x,y) \in R^2$
(c) $f\left(\frac{1}{x}\right) =\frac{ f(x)}{x^2 }$, $\forall x \in R -\{0\}$
Trần Nam Dũng
Find all functions $f:\mathbb R^{+} \longrightarrow \mathbb R^{+}$ so that
$f(xy + f(x^y)) = x^y + xf(y)$ for all positive reals $x,y$.
Determine all functions $ f$ mapping the set of positive integers to the set of non-negative integers satisfying the following conditions:
(1) $ f(mn) \equal{} f(m)\plus{}f(n)$,
(2) $ f(2008) \equal{} 0$, and
(3) $ f(n) \equal{} 0$ for all $ n \equiv 39\pmod {2008}$.
Find all functions $f: \mathbb{Q} \mapsto \mathbb{C}$ satisfying
(i) For any $x_1, x_2, \ldots, x_{1988} \in \mathbb{Q}$, $f(x_{1} + x_{2} + \ldots + x_{1988}) = f(x_1)f(x_2) \ldots f(x_{1988})$.
(ii) $\overline{f(1988)}f(x) = f(1988)\overline{f(x)}$ for all $x \in \mathbb{Q}$.
Let $\mathbb{R}_{>0}$ be the set of all positive real numbers. Find all functions $f:\mathbb{R}_{>0} \to \mathbb{R}_{>0}$ such that for all $x,y\in \mathbb{R}_{>0}$ we have
\[f(x) = f(f(f(x)) + y) + f(xf(y)) f(x+y).\]
Find all functions $f:\mathbb{N} \rightarrow \mathbb{N}$ such that for every prime number $p$ and natural number $x$,
$$\{ x,f(x),\cdots f^{p-1}(x) \} $$
is a complete residue system modulo $p$. With $f^{k+1}(x)=f(f^k(x))$ for every natural number $k$ and $f^1(x)=f(x)$.
[i]Proposed by IndoMathXdZ[/i]
Find all functions $f:\mathbb{R}_{\ge 0} \to \mathbb{R}$ with
\[2x^3zf(z)+yf(y) \ge 3yz^2f(x)\]
for all $x,y,z \in \mathbb{R}_{\ge 0}$.
Find all functions $f: \mathbb{Q}\to\mathbb{R}$ which fulfill the following conditions:
a) $f(1)+1>0$;
b) $f(x+y) -xf(y) -yf(x) = f(x)f(y) -x-y +xy$, for all $x,y\in\mathbb{Q}$;
c) $f(x) = 2f(x+1) +x+2$, for every $x\in\mathbb{Q}$.
Quadratic function $f(x)=ax^2+bx+c$ satisfies that:
$(1)\forall x\in\mathbb{R},f(x-4)=f(2-x),f(x)\geq x$;
$(2)\forall x\in(0,2),f(x)\leq\left(\frac{x+1}{2}\right)^2$;
$(3)\min\limits_{x\in\mathbb{R}}f(x)=0$
Find the maximum of $m(m>1)$, satisfying:
There exists $t\in\mathbb{R}$, as long as $x\in[1,m]$, then $f(x+t)\leq x$.
Find all functions $f:\mathbb{R} \rightarrow \mathbb{R}$ that satisfy the conditions
\[f(1+xy)-f(x+y)=f(x)f(y) \quad \text{for all } x,y \in \mathbb{R},\]
and $f(-1) \neq 0$.
Determine all pairs $(f,g)$ of functions from the set of real numbers to itself that satisfy \[g(f(x+y)) = f(x) + (2x + y)g(y)\] for all real numbers $x$ and $y$.
[i]Proposed by Japan[/i]
Determine all functions $f:\mathbb R\to\mathbb R$ that satisfy equation:
$$ f(x^3+y^3) =f(x^3) + 3x^2f(x)f(y) + 3f(x)f(y)^2 + y^6f(y) $$
for all reals $x,y$
Determine all function $f:\mathbb{R}\to\mathbb{R}$ such that $xf(y)+yf(x)\leqslant xy$ for all $x,y\in\mathbb{R}$.
Find all $f:\mathbb{R}\to\mathbb{R}$ such that for all $x,y\in\mathbb{R}$, $f(x)+f(y) = f(x+y)$ and $f(x^{2013}) = f(x)^{2013}$.
[i]Proposed by Calvin Deng[/i]
Find all functions $f:\mathbb{R}\to \mathbb{R}$ satisfying $f(x-y)=f(x)+xy+f(y)$ for every $x \in \mathbb{R}$ and every $y \in \{f(x) \mid x\in \mathbb{R}\}$, where $\mathbb{R}$ is the set of real numbers.