Found problems: 2349
Let $A$ and $B$ be nonempty sets and let $f : A \to B$. Prove that the following statements are equivalent:
$\text{(i) }$ $f$ is surjective.
$\text{(ii)} $ For every set $C$ and and every functions $g, h : B \to C$, if $g\circ f = h \circ f$ then $g = h$.
Determine all function $f$ from the set of real numbers to itself such that for every $x$ and $y$,
\[f(x^2-y^2)=(x-y)(f(x)+f(y))\]
Find all functions $f: \mathbb{R} \mapsto \mathbb{R}$ such that $$f(x)f\left(yf(x)-1\right)=x^2f(y)-f(x),$$for all $x,y \in \mathbb{R}$.
Find all functions $f: \mathbb{R}\to [0;+\infty)$ such that:
\[f(x^2+y^2)=f(x^2-y^2)+f(2xy)\]
for all real numbers $x$ and $y$.
[i]Laurentiu Panaitopol[/i]
Find all functions $f: \mathbb{N}\to \mathbb{N}$ such that for all $m,n\in \mathbb{N}$: \[f(f(m)+f(n))=m+n.\]
An [I]automorphism[/i] of a group \(\left(G,*\right)\) is a bijective function \(f:G\to G\) satisfying \(f(x*y)=f(x)*f(y)\) for all \(x,y\in G\).
Find a group \((G,*)\) with fewer than \((201.6)^2=40642.56\) unique elements and exactly \(2016^2\) unique automorphisms.
[i]Proposed by the ICMC Problem Committee[/i]
Find all $f$ functions from real numbers to itself such that for all real numbers $x,y$ the equation
\[f(f(y)+x^2+1)+2x=y+(f(x+1))^2\]
holds.
Find all functions $f: \mathbb{N} \to \mathbb{N}$ such that for any pair of naturals $m,n$,
$$\gcd(f(m),n) = \gcd(m,f(n)).$$
Find all functions $f:\mathbb R\to\mathbb R$ such that $$(x-y)f(x+y) - (x+y)f(x-y) = 2y(f(x)-f(y) - 1)$$for all $x, y\in\mathbb R$.
Let there's a function $ f: \mathbb{R}\rightarrow\mathbb{R}$
Find all functions $ f$ that satisfies:
a) $ f(2u)\equal{}f(u\plus{}v)f(v\minus{}u)\plus{}f(u\minus{}v)f(\minus{}u\minus{}v)$
b) $ f(u)\geq0$
Find all functions $f:\mathbb{R} \to \mathbb{R}$ such that for all real $x, y$, the following relation holds: $$(x+y) \cdot f(x+y)= f(f(x)+y) \cdot f(x+f(y)).$$
[i]Proposed by Vadym Koval (Ukraine)[/i]
Let $Z$ be the set of all integers. Find all the function $f: Z->Z$ such that
$f(4x+3y)=f(3x+y)+f(x+2y)$
For all integers $x,y$
Find all functions $f: \mathbb{R} \to \mathbb{R}$ such that for all real number $x,y$, $$(y+1)f(yf(x))=yf(x(y+1)).$$
Let $\mathbb{N}$ be the set of positive integers. Across all function $f:\mathbb{N}\to\mathbb{N}$ such that $$mn+1\text{ divides } f(m)f(n)+1$$ for all positive integers $m$ and $n$, determine all possible values of $f(101).$
Find all functions $f : R \to R$ such that $x[f(x + y) - f (x - y)] = 4y f (x)$ for any real numbers $x, y$.
Suppose $ f(x)\equal{}a_0x^n\plus{}a_1x^{n\minus{}1}\plus{}\ldots\plus{}a_{n\minus{}1}x\plus{}a_n$ ($ a_0\neq 0$) is a polynomial with real coefficients satisfying $ f(x)f(2x^2) \equal{} f(2x^3 \plus{} x)$ for all $ x \in\mathbb{R}$. Prove that $ f(x)$ has no real roots.
Find all $f : \mathbb{N} \to \mathbb{N} $ such that $f(a) + f(b)$ divides $2(a + b - 1)$ for all $a, b \in \mathbb{N}$.
Remark: $\mathbb{N} = \{ 1, 2, 3, \ldots \} $ denotes the set of the positive integers.
Find all functions $f:\mathbb R\to \mathbb R$ such that \begin{align*} \left (x \left (f(x)-\dfrac{f(y)+f(z)}{2} \right) +y \left (f(y)-\dfrac{f(z)+f(x)}{2} \right ) +z\left (f(z)- \dfrac{f(x)+f(y)}{2} \right) \right )f(x+y+z)= \\ f(x^3)+f(y^3)+f(z^3)-3f(xyz) \end{align*} for all $x,y,z\in \mathbb R.$
Find all functions $f:\mathbb{R}\rightarrow\mathbb{R}$ which satisfy the equality,
\[f(x+f(y))=f(x-f(y))+4xf(y)\]
for any $x,y\in\mathbb{R}$.
Let $r$ be a nonnegative continuous function on the real line. Show that there exists a function $f\in C^1(\mathbb{R})$, not identically zero, such that $f'(x)=f(x-r(f(x)))$, $x\in\mathbb{R}$.
(translated by L. Erdős)
For any positive integer $k$, denote the sum of digits of $k$ in its decimal representation by $S(k)$. Find all polynomials $P(x)$ with integer coefficients such that for any positive integer $n \geq 2016$, the integer $P(n)$ is positive and $$S(P(n)) = P(S(n)).$$
[i]Proposed by Warut Suksompong, Thailand[/i]
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ such that
$$f(xy) = f(x)f(y) + f(f(x + y))$$
holds for all $x, y \in \mathbb{R}$.
Suppose a function $f:\mathbb{R}\to\mathbb{R}$ satisfies $|f(x+y)|\geqslant|f(x)+f(y)|$ for all real numbers $x$ and $y$. Prove that equality always holds. Is the conclusion valid if the sign of the inequality is reversed?
Find all functions $f$ from positive integers to themselves such that:
1)$f(mn)=f(m)f(n)$ for all positive integers $m, n$
2)$\{1, 2, ..., n\}=\{f(1), f(2), ... f(n)\}$ is true for infinitely many positive integers $n$.
Represent for $\mathbb {Z}$ the set of all integers. Find all of the functions ${f:}$ $ \mathbb{Z} \rightarrow \mathbb{Z}$ such that for any ${x,y}$ integers, they satisfy:
${f(x + f(y)) = f(x) - y.}$