Found problems: 4776
find all functions $f : \mathbb{Z} \to \mathbb{Z}$ such that
$f(-f(x)-f(y)) = 1-x-y$ $\quad \forall x,y \in \mathbb{Z}$
Does there exist a pair $(g,h)$ of functions $g,h:\mathbb{R}\rightarrow\mathbb{R}$ such that the only function $f:\mathbb{R}\rightarrow\mathbb{R}$ satisfying $f(g(x))=g(f(x))$ and $f(h(x))=h(f(x))$ for all $x\in\mathbb{R}$ is identity function $f(x)\equiv x$?
Show that if $ f(x)$ is a real-valued, continuous function on the half-line $ 0\leq x < \infty$, and \[ \int_0^{\infty} f^2(x)dx
<\infty\] then the function \[ g(x)\equal{}f(x)\minus{}2e^{\minus{}x}\int_0^x e^tf(t)dt\] satisfies \[ \int _0^{\infty}g^2(x)dx\equal{}\int_0^{\infty}f^2(x)dx.\] [B. Szokefalvi-Nagy]
Find all functions $ f: \mathbb{N} \to \mathbb{N} $ such that $$ f\left(x+yf\left(x\right)\right) = x+f\left(y\right)f\left(x\right) $$ holds for all $ x,y \in \mathbb{N} $
Find all functions $f,g,h: \mathbb{R} \mapsto \mathbb{R}$ such that $f(x) - g(y) = (x-y) \cdot h(x+y)$ for $x,y \in \mathbb{R}.$
Find all (weakly) increasing $f\colon \mathbb{R}\to \mathbb{R}$ for which
\[f(f(x)+y)=f(f(y)+x)\]
holds for all $x, y\in \mathbb{R}$.
Let $x_1,x_2,\cdots, x_n$ be real valued differentiable functions of a variable $t$ which satisfy
\begin{align*}
& \frac{\mathrm{d}x_1}{\mathrm{d}t}=a_{11}x_1+a_{12}x_2+\cdots+a_{1n}x_n\\
& \frac{\mathrm{d}x_2}{\mathrm{d}t}=a_{21}x_1+a_{22}x_2+\cdots+a_{2n}x_n\\
& \;\qquad \vdots \\
& \frac{\mathrm{d}x_n}{\mathrm{d}t}=a_{n1}x_1+a_{n2}x_2+\cdots+a_{nn}x_n\\
\end{align*}
For some constants $a_{ij}>0$. Suppose that $\lim_{t \to \infty}x_i(t)=0$ for all $1\le i \le n$. Are the functions $x_i$ necessarily linearly dependent?
Find all positive integers $n$ such that $n^3$ is the product of all divisors of $n$.
Prove or disprove the existence of a function $f : S \to R$ such that for all $x \ne y \in S$ we have $|f(x) - f(y)| \ge \frac{1}{x^2 + y^2}$, in each of the cases:
a) $S = R$
b) $S = Q$.
Suppose that for a function $f: \mathbb{R}\to \mathbb{R}$ and real numbers $a<b$ one has $f(x)=0$ for all $x\in (a,b).$ Prove that $f(x)=0$ for all $x\in \mathbb{R}$ if
\[\sum^{p-1}_{k=0}f\left(y+\frac{k}{p}\right)=0\]
for every prime number $p$ and every real number $y.$
Consider a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ that admits primitives. Prove that:
$ \text{(i)} $ Every term (function) of the sequence functions $ \left( h_n\right)_{n\ge 2}:\mathbb{R}\longrightarrow\mathbb{R} $ defined, for any natural number $ n $ as $ h_n(x)=x^nf\left( x^3 \right) , $ is primitivable.
$ \text{(ii)} $ The function $ \phi :\mathbb{R}\longrightarrow\mathbb{R} $ defined as
$$ \phi (x) =\left\{ \begin{matrix} e^{-1/x^2} f(x),& \quad x\neq 0 \\ 0,& \quad x=0 \end{matrix} \right. $$
is primitivable.
[i]Cristinel Mortici[/i]
Let $\mathbb{N}_0$ and $\mathbb{Z}$ be the set of all non-negative integers and the set of all integers, respectively. Let $f:\mathbb{N}_0\rightarrow\mathbb{Z}$ be a function defined as
\[f(n)=-f\left(\left\lfloor\frac{n}{3}\right\rfloor \right)-3\left\{\frac{n}{3}\right\} \]
where $\lfloor x \rfloor$ is the greatest integer smaller than or equal to $x$ and $\{ x\}=x-\lfloor x \rfloor$. Find the smallest integer $n$ such that $f(n)=2010$.
Let $f:[0,1]\to[0,\infty)$ be an arbitrary function satisfying
$$\frac{f(x)+f(y)}2\le f\left(\frac{x+y}2\right)+1$$
for all pairs $x,y\in[0,1]$. Prove that for all $0\le u<v<w\le1$,
$$\frac{w-v}{w-u}f(u)+\frac{v-u}{w-u}f(w)\le f(v)+2.$$
For each continuous function $f: [0,1]\to\mathbb{R},$ let $I(f)=\int_{0}^{1}x^{2}f(x)\,dx$ and $J(f)=\int_{0}^{1}x\left(f(x)\right)^{2}\,dx.$ Find the maximum value of $I(f)-J(f)$ over all such functions $f.$
Let $P$ be the product of the nonreal roots of $x^4-4x^3+6x^2-4x=2005$. Find $\lfloor P\rfloor$.
Two spheres in contact have a common tangent cone. These three surfaces divide the space into various parts, only one of which is bounded by all three surfaces, it is "ring-shaped." Being given the radii of the spheres, $r$ and $R$, find the volume of the "ring-shaped" part. (The desired expression is a rational function of $r$ and $R.$)
Find all functions $ f: \mathbb{R} \to \mathbb{R}$, such that
\[ f(xf(y)) \plus{} f(f(x) \plus{} f(y)) \equal{} yf(x) \plus{} f(x \plus{} f(y))\]
holds for all $ x$, $ y \in \mathbb{R}$, where $ \mathbb{R}$ denotes the set of real numbers.
Let $a,b,c$ be positive reals such that $a+b+c=3$. Prove the inequality
\[\frac{a^2}{a+b^2}+\frac{b^2}{b+c^2}+\frac{c^2}{c+a^2}\geq \frac{3}{2}.\]
Let $n$ be a positive integer. A row of $n+ 1$ squares is written from left to right, numbered $0, 1, 2, \cdots, n$
Two frogs, named Alphonse and Beryl, begin a race starting at square 0. For each second that passes, Alphonse and Beryl make a jump to the right according to the following rules: if there are at least eight squares to the right of Alphonse, then Alphonse jumps eight squares to the right. Otherwise, Alphonse jumps one square to the right. If there are at least seven squares to the right of Beryl, then Beryl jumps seven squares to the right. Otherwise, Beryl jumps one square to the right. Let A(n) and B(n) respectively denote the number of seconds for Alphonse and Beryl to reach square n. For example, A(40) = 5 and B(40) = 10.
(a) Determine an integer n>200 for which $B(n) <A(n)$.
(b) Determine the largest integer n for which$ B(n) \le A(n)$.
Find all functions $ f : \mathbb{R} \rightarrow \mathbb{R} $ such that
\[ f( xf(x) + 2y) = f(x^2)+f(y)+x+y-1 \]
holds for all $ x, y \in \mathbb{R}$.
Let $ A,B\in\mathcal{M} \left( \mathbb{R} \right) $ that satisfy $ AB=O_3. $ Prove that:
[b]a)[/b] The function $ f:\mathbb{C}\longrightarrow\mathbb{C} $ defined as $ f(x)=\det \left( A^2+B^2+xBA \right) $ is a polynomial one, of degree at most $ 2. $
[b]b)[/b] $ \det\left( A^2+B^2 \right)\ge 0. $
Find the biggest real number $ k$ such that for each right-angled triangle with sides $ a$, $ b$, $ c$, we have
\[ a^{3}\plus{}b^{3}\plus{}c^{3}\geq k\left(a\plus{}b\plus{}c\right)^{3}.\]
Given $I=[0,1]$ and $G=\{(x,y)|x,y \in I\}$, find all functions $f:G\rightarrow I$, such that $\forall x,y,z \in I$ we have:
i. $f(f(x,y),z)=f(x,f(y,z))$;
ii. $f(x,1)=x, f(1,y)=y$;
iii. $f(zx,zy)=z^kf(x,y)$.
($k$ is a positive real number irrelevant to $x,y,z$.)
Determine all totally multiplicative and non-negative functions $f\colon\mathbb{Z}\rightarrow \mathbb{Z}$ with the property that if $a, b\in \mathbb{Z}$ and $b\neq 0$, then there exist integers $q$ and $r$ such that $a-qb+r$ and $f(r)<f(b)$.
Let $c_n$ be a sequence which is defined recursively as follows: $c_0 = 1$, $c_{2n+1} = c_n$ for $n \geq 0$, and $c_{2n} = c_n + c_{n-2^e}$ for $n > 0$ where $e$ is the maximal nonnegative integer such that $2^e$ divides $n$. Prove that
\[\sum_{i=0}^{2^n-1} c_i = \frac{1}{n+2} {2n+2 \choose n+1}.\]