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))$.

Prove that there does not exist a function $f : \mathbb R^+\to\mathbb R^+$ such that \[f(f(x)+y)=f(x)+3x+yf(y)\] for all positive reals $x,y$.

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

Find all real polynomials $p(x) $ such that $p(x-1)p(x+1)= p(x^2-1)$.

Let $n$ be a positive integer greater than $2$. Find all functions $f: \mathbb{Z} \rightarrow \mathbb{Z}$ satisfying: $(f(x+y))^{n} = f(x^{n})+f(y^{n}),$ for all integers $x,y$

Find all functions $f:\mathbb{Z}_{\ge 1}\to \mathbb{R}_{>0}$ such that for all positive integers $n$ the following relation holds: $$\sum_{d|n} f(d)^3=\left (\sum_{d|n} f(d) \right )^2,$$ where both sums are taken over the positive divisors of $n$. [i] (Vlad Robu) [/i]

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 : R_+ \to R_+$ such that $f(f(x)+y)=x+f(y)$ , for all $x, y \in R_+$ (Folklore) [hide=PS]Using search terms [color=#f00]+ ''f(x+f(y))'' + ''f(x)+y[/color]'' I found the same problem [url=https://artofproblemsolving.com/community/c6h1122140p5167983]in Q[/url], [url=https://artofproblemsolving.com/community/c6h1597644p9926878]continuous in R[/url], [url=https://artofproblemsolving.com/community/c6h1065586p4628238]strictly monotone in R[/url] , [url=https://artofproblemsolving.com/community/c6h583742p3451211 ]without extra conditions in R[/url] [/hide]

Find all functions $f : Z \to Z$ such that $f(-1) = f(1)$ and $f(x)+ f(y) = f(x+2xy)+ f(y-2xy)$ for all $x,y \in Z$

Find all functions $f$ defined on all real numbers and taking real values such that \[f(f(y)) + f(x - y) = f(xf(y) - x),\] for all real numbers $x, y.$

Find all $f:\mathbb{R}^+ \rightarrow \mathbb{R}^+$ such that for all distinct $x,y,z$ $f(x)^2-f(y)f(z)=f(x^y)f(y)f(z)[f(y^z)-f(z^x)]$

Find all functions $f : \mathbb{R} \to\mathbb{R}$ such that $f(0)\neq 0$ and \[f(f(x)) + f(f(y)) = f(x + y)f(xy),\] for all $x, y \in\mathbb{R}$.

Find all unbounded functions $f:\mathbb Z \rightarrow \mathbb Z$ , such that $f(f(x)-y)|x-f(y)$ holds for any integers $x,y$.

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} $.

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 $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]

Functions $f(x)$ and $g(x)$ are defined on the set of real numbers and take real values. It is known that $g(x)$ takes all real values, $g(0)=0$, and for all $x,y \in \mathbb{R}$ the following equality holds $$f(x+f(y))=f(x)+g(y)$$ Prove that $g(x+y)=g(x)+g(y)$ for all $x,y \in \mathbb{R}$.

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 $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^+$.

Determine all functions $f : R \to R$ such that $f(x) \ge 0$ for all positive reals $x$, $f(0) = 0$ and for all reals $x, y$ $$f(x + y -xy) = f(x) + f(y) - f(xy).$$

Determine all functions $f : R_{\ge 0} \to R_{\ge 0}$ with the following properties: (a) $f(1) = 0$, (b) $f(x) > 0$ for all $x > 1$, (c) For all $x, y\ge 0$ with $x + y > 0$ holds $$f(xf(y))f(y) = f\left( \frac{xy}{x + y}\right)$$

Find all functions $f:\mathbb{R}\to\mathbb{R}$ such that \[f(x)^2+f(2y+1)=x^2+f(y)+y+1\] for all reals $x$, $y$. [i](Proposed by Lim Yun Zhe)[/i]

Given an integer $n\ge 2$, a function $f:\mathbb{Z}\rightarrow \{1,2,\ldots,n\}$ is called [i]good[/i], if for any integer $k,1\le k\le n-1$ there exists an integer $j(k)$ such that for every integer $m$ we have \[f(m+j(k))\equiv f(m+k)-f(m) \pmod{n+1}. \] Find the number of [i]good[/i] functions.

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]

Find all functions $f:\mathbb R \to \mathbb R$ such that for all $x,y\in \mathbb R$ $f(x+f(y))=2x+2f(y+1)$