Found problems: 2349
Let $R^+$ be the set of positive real numbers. Find all function $f : R^+ \to R$ such that, for all positive real number $x$ and $y$, the following conditions are satisfied:
i) $2f (x) + 2f (y) \le f (x + y)$
ii) $(x + y)[y f (x) + x f (y)] \ge x y f (x + y)$
Find all functions $\mathbb R^+\to\mathbb R^+$ such that \[(f(a)+f(b))(f(c)+f(d))=(a+b)(c+d), \quad \forall a,b,c,d\in\mathbb R^+; \quad abcd=1\]
Find all functions $f: \mathbb{R} \rightarrow \mathbb{R}$ from $C^2$ (id est, $f$ is twice differentiable and $f''$ is continuous.) such that for every real number $t$ we have $f(t)^2=f(t \sqrt{2})$.
Do either (1) or (2):
(1) Show that any solution $f(t)$ of the functional equation
$$f(x+y)f(x-y)=f(x)^{2} +f(y)^{2} -1$$
for $x,y\in \mathbb{R}$ satisfies
$$f''(t)= \pm c^{2} f(t)$$
for a constant $c$, assuming the existence and continuity of the second derivative.
Deduce that $f(t)$ is one of the functions
$$ \pm \cos ct, \;\;\; \pm \cosh ct.$$
(2) Let $(a_{i})_{i=1,...,n}$ and $(b_{i})_{i=1,...,n}$ be real numbers. Define an $(n+1)\times (n+1)$-matrix $A=(c_{ij})$ by
$$ c_{i1}=1, \; \; c_{1j}= x^{j-1} \; \text{for} \; j\leq n,\; \; c_{1n+1}=p(x), \;\; c_{ij}=a_{i-1}^{j-1} \; \text{for}\; i>1, j\leq n,\;\;
c_{in+1}=b_{i-1}\; \text{for}\; i>1.$$
The polynomial $p(x)$ is defined by the equation $\det A=0$. Let $f$ be a polynomial and replace $(b_{i})$ with $(f(b_{i}))$. Then $\det A=0$ defines another polynomial $q(x)$. Prove that $f(p(x))-q(x)$ is a multiple of
$$\prod_{i=1}^{n} (x-a_{i}).$$
Find all functions $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that verify the relation
$$ f\left( x^3+y^3 \right) =xf\left( y^2 \right) + yf\left( x^2 \right) , $$
for all real numbers $ x,y. $
Let G be an abelian group, $0\leq\varepsilon<1$ and $f : G\to\Bbb R^n$ a function that satisfies the inequality.
$$||f(x+y)-f(x)-f(y)|| \leq \varepsilon ||f (y)|| \qquad (x, y)\in G^2$$
Prove that there is an additive function $A : G\to \Bbb R^n$ and a continuous function $\varphi : A (G) \to\Bbb R^n$ such that $f = \varphi\circ A$.
Denote by $\mathbb{Q}^+$ the set of positive rational numbers. A function $f : \mathbb{Q}^+ \to \mathbb{Q}$ satisfies
• $f(p) = 1$ for all primes $p$, and
• $f(ab) = af(b) + bf(a)$ for all $ a,b \in \mathbb{Q}^+ $.
For which positive integers $n$ does the equation $nf(c) = c$ have at least one solution $c$ in $\mathbb{Q}^+$?
Find all functions $f:\mathbb{R}\longrightarrow\mathbb{R}$ such that $f(x+y)+xy=f(x)f(y)$ for all reals $x, y$
Find all functions $f: \mathbb{Z} \mapsto \mathbb{Z}$ satisfying the condition: $f(x^3 +y^3 +z^3 )=f(x)^3+f(y)^3+f(z)^3.$
Determine all functions $f : R\to R$ satisfying: $$f(xy + 2x + 2y - 1) = f(x)f(y) + f(y) + x -2$$ for all real numbers $x, y$.
Find all functions $f:\mathbb R\to\mathbb R$ such that \[f(x^2)+2xf(y)=yf(x)+xf(x+y).\]
[i](Proposed by Yeoh Yi Shuen)[/i]
If for function $f$ holds that $$f(x)+f(x+1)+f(x+2)+...+f(x+1986)=0$$ for any $\in\mathbb{R}$, prove that $f$ is periodic and find one period of her.
Find all functions $f\colon \mathbb{Q}\to \mathbb{R}_{\geq 0}$ such that for any two rational numbers $x$ and $y$ the following conditions hold
[list]
[*] $f(x+y)\leq f(x)+f(y)$,
[*]$f(xy)=f(x)f(y)$,
[*]$f(2)=1/2$.
[/list]
On the Cartesian plane consider the set $V$ of all vectors with integer coordinates. Determine all functions $f : V \rightarrow \mathbb{R}$ satisfying the conditions:
(i) $f(v) = 1$ for each of the four vectors $v \in V$ of unit length.
(ii) $f(v+w) = f(v)+f(w)$ for every two perpendicular vectors $v, w \in V$
(Zero vector is considered to be perpendicular to every vector).
Find all functions $f: \mathbb{Q} \to \mathbb{R}$ such that $f(xy)=f(x)f(y)+f(x+y)-1$ for all rationals $x,y$
Determine all functions $ f$ defined in the set of rational numbers and taking their values in the same set such that the equation $ f(x + y) + f(x - y) = 2f(x) + 2f(y)$ holds for all rational numbers $x$ and $y$.
The non-decreasing functions $f,g: \mathbb{R}\rightarrow \mathbb{R}$ are such that $f(r)\leq g(r)$ for $\forall$ rational numbers $r$. Is it true that $f(x)\leq g(x)$ for $\forall$ real numbers $x$?
Let $ \mathbb{N}_0$ denote the set of nonnegative integers. Find all functions $ f$ from $ \mathbb{N}_0$ to itself such that
\[ f(m \plus{} f(n)) \equal{} f(f(m)) \plus{} f(n)\qquad \text{for all} \; m, n \in \mathbb{N}_0.
\]
Determine all the functions $f : \mathbb{R}\rightarrow\mathbb{R}$ that satisfies the following.
$f(xf(y)+yf(z)+zf(x))=yf(x)+zf(y)+xf(z)$
Determine all functions $f : \mathbb{R} \to \mathbb{R}$ that satisfy the following two properties.
(i) The Riemann integral $\int_a^b f(t) \mathrm dt$ exists for all real numbers $a < b$.
(ii) For every real number $x$ and every integer $n \ge 1$ we have
\[ f(x) = \frac{n}{2} \int_{x-\frac{1}{n}}^{x+\frac{1}{n}} f(t) \mathrm dt. \]
Let $\mathbb{Z}^+$ be the set of positive integers. Determine all functions $f : \mathbb{Z}^+\to\mathbb{Z}^+$ such that $a^2+f(a)f(b)$ is divisible by $f(a)+b$ for all positive integers $a,b$.
Given an integer $k\geq 2$, determine all functions $f$ from the positive integers into themselves such that $f(x_1)!+f(x_2)!+\cdots f(x_k)!$ is divisibe by $x_1!+x_2!+\cdots x_k!$ for all positive integers $x_1,x_2,\cdots x_k$.
$Albania$
It is known about the function $f : R \to R$ that
$\bullet$ $f(x) > f(y)$ for all real $x > y$
$\bullet$ $f(x) > x$ for all real $x$
$\bullet$ $f(2x - f (x)) = x$ for all real $x$.
Prove that $f(x) = x + f(0)$ for all real numbers $x$.
Determine all functions $f : R_+ \to R$ such that:$$f(x)f(y) = f(xy) + \frac{1}{x} + \frac{1}{y}$$
for all $x, y$ positive reals.
We consider all functions $f: \mathbb{N} \rightarrow \mathbb{N}$ such that $f(f(n)+n)=n$ and $f(a+b-1) \leq f(a)+f(b)$ for all positive integers $a, b, n$. Prove that there are at most two values for $f(2022)$.
$\textit {Proposed by Ilija Jovcheski}$