Found problems: 2349
Let real coefficient polynomial $f(x) = x^n + a_1 \cdot x^{n-1} + \ldots + a_n$ has real roots $b_1, b_2, \ldots, b_n$, $n \geq 2,$ prove that $\forall x \geq max\{b_1, b_2, \ldots, b_n\}$, we have
\[f(x+1) \geq \frac{2 \cdot n^2}{\frac{1}{x-b_1} + \frac{1}{x-b_2} + \ldots + \frac{1}{x-b_n}}.\]
find all functions from the reals to themselves. such that for every real $x,y$.
$$f(y-f(x))=f(x)-2x+f(f(y))$$
Let $n$ be some positive integer. Find all functions $f:{{R}^{+}}\to R$ (i.e., functions defined by the set of all positive real numbers with real values) for which equality holds $f\left( {{x}^{n+1}}+ {{y}^{n+1}} \right)={{x}^{n}}f\left( x \right)+{{y}^{n}}f\left( y \right)$ for any positive real numbers $x, y$
Find all functions $f\colon \mathbb{R}^+ \to \mathbb{R}^+$ such that
\[
f(xf(x)+y^2) = x^2+yf(y)
\]
for any positive reals $x,y$.
Find all functions $f : \mathbb{R} \to \mathbb{R}$ such that for all real $x,y$:
$$ f(x^2) + xf(y) = f(x) f(x + f(y)) \, . $$
Let $\mathbb{R}$ be the set of real numbers. Determine all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that, for any real numbers $x$ and $y$, \[ f(f(x)f(y)) + f(x+y) = f(xy). \]
[i]Proposed by Dorlir Ahmeti, Albania[/i]
Let $\mathbb{Q}_{>0}$ denote the set of all positive rational numbers. Determine all functions $f:\mathbb{Q}_{>0}\to \mathbb{Q}_{>0}$ satisfying $$f(x^2f(y)^2)=f(x)^2f(y)$$ for all $x,y\in\mathbb{Q}_{>0}$
Let $f : R^+ \to R^+$ be a function satisfying $$f(\sqrt{x_1x_2}) =\sqrt{f(x_1)f(x_2)}$$ for all positive real numbers $x_1, x_2$. Show that $$f( \sqrt[n]{x_1x_2... x_n}) = \sqrt[n]{f(x_1)f(x_2) ... f(x_n)}$$ for all positive integers $n$ and positive real numbers $x_1, x_2,..., x_n$.
Solve for $g : \mathbb{Z}^+ \to \mathbb{Z}^+$ such that
$$g(m + n) = g(m) + mn(m + n) + g(n)$$
Show that $g(n)$ is of the form $\sum_{i=0}^{d} {c_i n^i}$ \\
and find necessary and sufficient conditions on $d$ and $c_0, c_1, \cdots , c_d$
Find all functions $f: \mathbb R \rightarrow \mathbb R$ such that
\[f(x+xy+f(y)) = \left(f(x)+\frac{1}{2}\right) \left(f(y)+\frac{1}{2}\right)\]
holds for all real numbers $x,y$.
Let $F:\mathbb R^{\mathbb R}\to\mathbb R^{\mathbb R}$ be a function (from the set of real-valued functions to itself) such that
$$F(F(f)\circ g+g)=f\circ F(g)+F(F(F(g)))$$
for all $f,g:\mathbb R\to\mathbb R$.
Prove that there exists a function $\sigma:\mathbb R\to\mathbb R$ such that
$$F(f)=\sigma\circ f\circ\sigma$$
for all $f:\mathbb R\to\mathbb R$.
Consider a function $f: \mathbb Z \to \mathbb Z$ such that for every integer $n \ge 0$, there are at most $0.001n^2$ pairs of integers $(x,y)$ for which $f(x+y) \neq f(x)+f(y)$ and $\max\{ \lvert x \rvert, \lvert y \rvert \} \le n$. Is it possible that for some integer $n \ge 0$, there are more than $n$ integers $a$ such that $f(a) \neq a \cdot f(1)$ and $\lvert a \rvert \le n$?
[i]Proposed by David Yang[/i]
Find all functions $f:\mathbb{N}\setminus\{1\} \rightarrow\mathbb{N}$ such that for all distinct $x,y\in \mathbb{N}$ with $y\ge 2018$, $$\gcd(f(x),y)\cdot \mathrm{lcm}(x,f(y))=f(x)f(y).$$
Find all functions $f:\mathbb{N} \to \mathbb{N}$ such that for all $m,n\in \mathbb{N}$: [list][*] $f(2)=2$, [*] $f(mn)=f(m)f(n)$, [*] $f(n+1)>f(n)$. [/list]
Find all functions $f:\mathbb{R}\to\mathbb{R}$ which satisfy the following equality for all $x,y\in\mathbb{R}$ \[f(x)f(y)-f(x-1)-f(y+1)=f(xy)+2x-2y-4.\][i]Proposed by Dániel Dobák, Budapest[/i]
Let $\mathbb{N}$ be the set of positive integers. For every $n \in \mathbb{N}$, define $d(n)$ as the number of positive divisors of $n$. Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that:
a) $d(f(x)) = x$ for all $x \in \mathbb{N}$
b) $f(xy)$ divides $(x-1)y^{xy-1}f(x)$ for all $x,y \in \mathbb{N}$
Let $P$ be a plane. Prove that there is no function $f :P\rightarrow P$ where, for any convex quadrilateral $ABCD$, the points $f(A)$, $f(B)$, $f(C)$, $f (D)$ are the vertices of a concave quadrilateral.
[i](tatari/nightmare)[/i]
If $f$ is a continuous real function such that $ f(x-1) + f(x+1) \ge x + f(x) $ for all $x$, what is the minimum possible value of $ \displaystyle\int_{1}^{2005} f(x) \, \mathrm{d}x $?
$f:R->R$ such that :
$f(1)=1$ and for any $x\in R$
i) $f(x+5)\geq f(x)+5$
ii)$f(x+1)\leq f(x)+1$
If $g(x)=f(x)+1-x$ find g(2016)
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^+$.
Let $R_+=(0,+\infty)$. Find all functions $f: R_+ \to R_+$ such that
$f(xf(y))+f(yf(z))+f(zf(x))=xy+yz+zx$, for all $x,y,z \in R_+$.
by Athanasios Kontogeorgis (aka socrates)
Let $\mathbb{R}$ denote the set of all real numbers. Determine all functions $f:\mathbb{R}\to\mathbb{R}$ such that for all real numbers $x$ and $y$,
\[f(xy+xf(x))=f(x)\left(f(x)+f(y)\right).\]
Prove that a function $f:\mathbb{R}_+\to\mathbb{R}$ satisfies \[f(x+y)-f(x)-f(y)=f\left(\frac{1}{x}+\frac{1}{y}\right)\]if and only if it satisfies $f(xy)=f(x)+f(y)$.
Does there exist a strictly increasing function $f:\mathbb{N}\rightarrow \mathbb{N}$, such that for $\forall$ $n\in \mathbb{N}$:
$f(f(f(n)))=n+2f(n)$?
Given is a function $f:\mathbb{R}\rightarrow \mathbb{R}$ such that $|f(x+y)-f(x)-f(y)|\leq 1$.
Prove the existence of an additive function $g:\mathbb{R}\rightarrow \mathbb{R}$ (that is $g(x+y)=g(x)+g(y)$) such that $|f(x)-g(x)|\leq 1$ for any $x \in \mathbb{R}$