Found problems: 4776
Find all functions $f : \mathbb R \to \mathbb R$ such that for all reals $x, y, z$ it holds that
\[f(x + f(y + z)) + f(f(x + y) + z) = 2y.\]
For $f(x) = \cos\left(\frac{3\sqrt{3}\pi}{8}(x-x^3 ) \right)$, find the value of
$$\lim_{t\to\infty} \left( \int_0^1 f(x)^t dx \right)^\frac{1}{t} + \lim_{t\to-\infty} \left( \int_0^1 f(x)^t dx \right)^\frac{1}{t} $$
Find the minimum value of $f(x)=\int_0^{\frac{\pi}{4}} |\tan t-x|dt.$
Let $f(x)$ is such function, that $f(x)=1$ for integer $x$ and $f(x)=0$ for non integer $x$.
Build such function using only variable $x$, integer numbers, and operations $+,-,*,/,[.]$(plus, minus, multiply,divide and integer part)
Let $f(z)$ be a holomorphic function in $\{\vert z\vert \le R\}$ ($0<R<\infty$). Define
\[M(r,f)=\max_{\vert z\vert=r} \vert f(z)\vert, \quad A(r,f)=\max_{\vert z\vert=r} \text{Re}\{f(z)\}.\]
Show that
\[M(r,f) \le \frac{2r}{R-r}A(R,f)+\frac{R+r}{R-r} \vert f(0)\vert, \quad \forall 0 \le r<R.\]
Let $ S\subseteq\mathbb{R}$ be a set of real numbers. We say that a pair $ (f, g)$ of functions from $ S$ into $ S$ is a [i]Spanish Couple[/i] on $ S$, if they satisfy the following conditions:
(i) Both functions are strictly increasing, i.e. $ f(x) < f(y)$ and $ g(x) < g(y)$ for all $ x$, $ y\in S$ with $ x < y$;
(ii) The inequality $ f\left(g\left(g\left(x\right)\right)\right) < g\left(f\left(x\right)\right)$ holds for all $ x\in S$.
Decide whether there exists a Spanish Couple [list][*] on the set $ S \equal{} \mathbb{N}$ of positive integers; [*] on the set $ S \equal{} \{a \minus{} \frac {1}{b}: a, b\in\mathbb{N}\}$[/list]
[i]Proposed by Hans Zantema, Netherlands[/i]
Consider the positive reals $ x$, $ y$ and $ z$. Prove that:
a) $ \arctan(x) \plus{} \arctan(y) < \frac {\pi}{2}$ iff $ xy < 1$.
b) $ \arctan(x) \plus{} \arctan(y) \plus{} \arctan(z) < \pi$ iff $ xyz < x \plus{} y \plus{} z$.
[b]a)[/b] Is it possible to find a function $f:\mathbb N^2\to\mathbb N$ such that for every function $g:\mathbb N\to\mathbb N$ and positive integer $M$ there exists $n\in\mathbb N$ such that set $\left\{k\in \mathbb N : f(n,k)=g(k)\right\}$ has at least $M$ elements?
[b]b)[/b] Is it possible to find a function $f:\mathbb N^2\to\mathbb N$ such that for every function $g:\mathbb N\to\mathbb N$ there exists $n\in \mathbb N$ such that set $\left\{k\in\mathbb N : f(n,k)=g(k)\right\}$ has an infinite number of elements?
Let $f:[0,\infty)\to\mathbb R$ be a continuous function s.t. $\lim_{x\to\infty}\frac {f(x)}x=0$. Let $(x_n)_n$ be a sequence of positive real numbers s.t. $\left(\frac{x_n}n\right)_n$ is bounded. Prove that $\lim_{n\to\infty}\frac{f(x_n)}n=0$.
[i]Dorin Andrica, Eugen Paltanea[/i]
Let $n \geq 1$ be an odd integer. Determine all functions $f$ from the set of integers to itself, such that for all integers $x$ and $y$ the difference $f(x)-f(y)$ divides $x^n-y^n.$
[i]Proposed by Mihai Baluna, Romania[/i]
Let $ H$ denote the set of those natural numbers for which $ \tau(n)$ divides $ n$, where $ \tau(n)$ is the number of divisors of $ n$. Show that
a) $ n! \in H$ for all sufficiently large $ n$,
b)$ H$ has density $ 0$.
[i]P. Erdos[/i]
Define a function $g: \mathbb{N} \mapsto \mathbb{N}$ by the following rule:
(a) $g$ is nondecrasing
(b) for each $n$, $g(n)$ i sthe number of times $n$ appears in the range of $g$,
Prove that $g(1) = 1$ and $g(n+1) = 1 + g( n +1 - g(g(n)))$ for all $n \in \mathbb{N}$
Find the maximum value that the quantity $2m+7n$ can have such that there exist distinct positive integers $x_i \ (1 \leq i \leq m), y_j \ (1 \leq j \leq n)$ such that the $x_i$'s are even, the $y_j$'s are odd, and $\sum_{i=1}^{m} x_i +\sum_{j=1}^{n} y_j=1986.$
Let $ M $ be a finite set of integers, and let be a function $ \varphi :\mathbb{Z}\longrightarrow\mathbb{Z} $ whose restriction to $ \mathbb{Z}\setminus M $ evaluates to a constant $ c, $ such that
$$ 2\le |\varphi (M)|=|M|\neq \frac{1}{c}\cdot \sum_{\iota \in \varphi (M) } \iota . $$
Prove that $ \varphi $ is not a sum between an injective function and a surjective function.
[i]Sorin Rădulescu[/i] and [i]Ion Savu[/i]
A and B plays the following game: they choose randomly $k$ integers from $\{1,2,\dots,100\}$; if their sum is even, A wins, else B wins. For what values of $k$ does A and B have the same chance of winning?
Prove that there is no real function $ f(x)$ satisfying $ f\left(f(x)\right) \equal{} x^2 \minus{} 2$ for all real number $ x$.
Given an integer $n\ge 4$. $S=\{1,2,\ldots,n\}$. $A,B$ are two subsets of $S$ such that for every pair of $(a,b),a\in A,b\in B, ab+1$ is a perfect square. Prove that
\[\min \{|A|,|B|\}\le\log _2n.\]
Consider the following function $ f(x)=\frac{1}{1+2^{1-2x}}$. Compute the value of $$f\left(\frac{1}{10}\right)+f\left(\frac{2}{10}\right)+...+f\left(\frac{9}{10}\right).$$
Consider a function $f:\mathbb N\rightarrow \mathbb N$ such that for any two positive integers $x,y$, the equation $f(xf(y))=yf(x)$ holds. Find the smallest possible value of $f(2007)$.
Find the continuous function $f(x)$ such that the following equation holds for any real number $x$.
\[\int_0^x \sin t \cdot f(x-t)dt=f(x)-\sin x.\]
[i]1977 Keio University entrance exam/Medicine[/i]
For all rational $x$ satisfying $0 \leq x < 1$, the functions $f$ is defined by
\[f(x)=\begin{cases}\frac{f(2x)}{4},&\mbox{for }0 \leq x < \frac 12,\\ \frac 34+ \frac{f(2x - 1)}{4}, & \mbox{for } \frac 12 \leq x < 1.\end{cases}\]
Given that $x = 0.b_1b_2b_3 \cdots $ is the binary representation of $x$, find, with proof, $f(x)$.
Prove the inequality:
\[\sum_{i < j}{\frac {a_{i}a_{j}}{a_{i} \plus{} a_{j}}}\leq \frac {n}{2(a_{1} \plus{} a_{2} \plus{}\cdots \plus{} a_{n})}\cdot \sum_{i < j}{a_{i}a_{j}}\]
for positive reals $ a_{1},a_{2},\ldots,a_{n}$.
[i]Proposed by Dusan Dukic, Serbia[/i]
The minimal value of $ f(x) \equal{} \sqrt{a^2 \plus{} x^2} \plus{} \sqrt{(x\minus{}b)^2 \plus{} c^2}$ is
A. $ a\plus{}b\plus{}c$
B. $ \sqrt{a^2 \plus{} (b \plus{} c)^2}$
C. $ \sqrt{b^2 \plus{} (a\plus{}c)^2}$
D. $ \sqrt{(a\plus{}b)^2 \plus{} c^2}$
E. None of these
Let be a nonnegative integer $ n $ such that $ \sqrt n $ is not integer. Show that the function
$$ f:\{ a+b\sqrt n | a,b\in\{ 0\}\cup\mathbb{N} , a^2-nb^2=1 \}\longrightarrow\{ 0\}\cup\mathbb{N} , f(x) =\lfloor x \rfloor $$
is injective and non-surjective.
Let $n$ be an even positive integer. Show that there exists a permutation $(x_1, x_2, \ldots, x_n)$ of the set $\{1, 2, \ldots, n\}$, such that for each $i \in \{1, 2, \ldots, n\}, x_{i+1}$ is one of the numbers $2x_i, 2x_{i}-1, 2x_i - n, 2x_i - n - 1$, where $x_{n+1} = x_1.$