Found problems: 66
Find all reals $\lambda$ for which there is a nonzero polynomial $P$ with real coefficients such that
$$\frac{P(1)+P(3)+P(5)+\ldots+P(2n-1)}n=\lambda P(n)$$for all positive integers $n$, and find all such polynomials for $\lambda=2$.
Find all function $f:\mathbb{R}\rightarrow\mathbb{R}$ such that for all $x,y\in\mathbb{R}$ the following equality holds \[
f(\left\lfloor x\right\rfloor y)=f(x)\left\lfloor f(y)\right\rfloor \] where $\left\lfloor a\right\rfloor $ is greatest integer not greater than $a.$
[i]Proposed by Pierre Bornsztein, France[/i]
Find all functions $f:\mathbb N\to\mathbb N$ such that
\begin{align*}
x+f(y)&\mid f(y+f(x))\\
f(x)-2017&\mid x-2017\end{align*}
Functions $f,g:\mathbb{Z}\to\mathbb{Z}$ satisfy $$f(g(x)+y)=g(f(y)+x)$$ for any integers $x,y$. If $f$ is bounded, prove that $g$ is periodic.
Suppose that a function $f:\mathbb R\to\mathbb R$ satisfies the following conditions:
(i) $\left|f(a)-f(b)\right|\le|a-b|$ for all $a,b\in\mathbb R$;
(ii) $f(f(f(0)))=0$.
Prove that $f(0)=0$.
Suppose that a function $f:\mathbb R\to\mathbb R$ is such that for any real $h$ there exist at most $19990509$ different values of $x$ for which $f(x)\ne f(x+h)$. Prove that there is a set of at most $9995256$ real numbers such that $f$ is constant outside of this set.
Determine all functions $f:\mathbb{R} \to \mathbb{R}$ such that
\[ xf(y) + f(xf(y)) - xf(f(y)) - f(xy) = 2x + f(y) - f(x+y)\]
holds for all $x,y \in \mathbb{R}$.
Find all polynomials $p(x)$ satisfying $p(x^3+1)=p(x+1)^3$ for all $x$.
Let $\mathcal M_n(\mathbb R)$ denote the set of all real $n\times n$ matrices. Find all surjective functions $f:\mathcal M_n(\mathbb R)\to\{0,1,\ldots,n\}$ which satisfy
$$f(XY)\le\min\{f(X),f(Y)\}$$for all $X,Y\in\mathcal M_n(\mathbb R)$.
Find all real-valued functions $f$ defined on the set of real numbers such that $$f(f(x)+y)+f(x+f(y))=2f(xf(y))$$ for any real numbers $x$ and $y$.
Suppose an integer-valued function $f$ satisfies
$$\sum_{k=1}^{2n+1}f(k)=\ln|2n+1|-4\ln|2n-1|\enspace\text{and}\enspace\sum_{k=0}^{2n}f(k)=4e^n-e^{n-1}$$
for all non-negative integers $n$. Determine $\sum_{n=0}^\infty\frac{f(n)}{2^n}$.
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?
Find all functions $f:\mathbb N\to\mathbb N$ satisfying
$$\operatorname{lcm}(f(x),y)\gcd(f(x),f(y))=f(x)f(f(y))$$
for all $x,y\in\mathbb N$.
Show that for all non-constant functions $f:\mathbb R\to\mathbb R$, there are two real numbers $x,y$ such that
$$f(x+f(y))>xf(y)+x.$$
Let $S = \{2, 3, 4, \dots\}$ be the set of positive integers greater than 1. Find all functions $f : S \to S$ that satisfy
\[
\text{gcd}(a, f(b)) \cdot \text{lcm}(f(a), b) = f(ab)
\]
for all pairs of integers $a, b \in S$.
Clarification: $\text{gcd}(a,b)$ is the greatest common divisor of $a$ and $b$, and $\text{lcm}(a,b)$ is the least common multiple of $a$ and $b$.
Determine all the functions $f : \mathbb{R} \to \mathbb{R}$ such that
\[ f(x^2 + f(y)) = f(f(x)) + f(y^2) + 2f(xy) \]
for all real numbers $x$ and $y$.