Found problems: 4776
Let be a sequence of continuous functions $ \left( f_n \right)_{n\ge 1} :[0,1]\longrightarrow\mathbb{R} $ satisfying the following properties:
$ \text{a) } $ for any natural $ n $ and $ x\in [1/n,1] ,$ it follows $ \left| f_n(x) \right|\leqslant 1/n. $
$ \text{b) } $ for any natural $ n, $ it follows $ \int_0^1 f_n^2(t)dt\leqslant 1. $
Then, $\lim_{n\to 0} \int_0^1\left| f_n(t) \right| dt=0 $
[i]Cristinel Mortici[/i]
On $[1,2]$ if two functions $f(x)=x^2+px+q$ and $g(x)=x+\frac{1}{x^2}$ get their minumum value at the same point, then the maximum value of $f(x)$ on $[1,2]$ is
$\text{(A)}4+\frac{11}{2}\sqrt[3]{2}+\sqrt[3]{4}\qquad\text{(B)}4-\frac{5}{2}\sqrt[3]{2}+\sqrt[3]{4}$
$\text{(C)}1-\frac{1}{2}\sqrt[3]{2}+\sqrt[3]{4}\qquad\text{(D)}$ none above
Determine all functions $f: \mathbb{Z}\to\mathbb{Z}$ satisfying \[f\big(f(m)+n\big)+f(m)=f(n)+f(3m)+2014\] for all integers $m$ and $n$.
[i]Proposed by Netherlands[/i]
Find all functions $f: \mathbb{R} \to \mathbb{R}$ that have a continuous second derivative and for which the equality $f(7x+1)=49f(x)$ holds for all $x \in \mathbb{R}$.
Let $n$ be a positive integer number and let $a_1, a_2, \ldots, a_n$ be $n$ positive real numbers. Prove that $f : [0, \infty) \rightarrow \mathbb{R}$, defined by
\[f(x) = \dfrac{a_1 + x}{a_2 + x} + \dfrac{a_2 + x}{a_3 + x} + \cdots + \dfrac{a_{n-1} + x}{a_n + x} + \dfrac{a_n + x}{a_1 + x}, \]
is a decreasing function.
[i]Dan Marinescu et al.[/i]
Let $T = \{1,2,...,10\}$. Find the number of bijective functions $f : T\to T$ that satis es the following for all $x \in T$:
$f(f(x)) = x$
$|f(x) - x| \ge 2$
Find all functions $f : \mathbb{N} \rightarrow \mathbb{N}$ such that for any two positive integers $m,n$ we have :
$$f(n)+1400m^2|n^2+f(f(m))$$
Find the number of functions $f$ that map the set $\{1,2, 3,4\}$ into itself such that the range of the function $f(x)$ is the same as the range of the function $f(f(x))$.
Let be a positive real number $ r, $ a natural number $ n, $ and a function $ f:\mathbb{R}\longrightarrow\mathbb{R} $ satisfying $ f(rxy)=(f(x)f(y))^n, $ for any real numbers $ x,y. $
[b]a)[/b] Give three distinct examples of what $ f $ could be if $ n=1. $
[b]b)[/b] For a fixed $ n\ge 2, $ find all possibilities of what $ f $ could be.
[i]Bogdan Blaga[/i]
Find all non decreasing functions or non increasing function $f \colon \mathbb{R} \to \mathbb{R}$ such that for all $x,y \in \mathbb{R}$
$$ f(x+f(y))=f(x)+f(y) \text{ or } f(f(f(x)))+y$$ .
Let $f : Z_{\ge 0} \to Z_{\ge 0}$ be a function which satisfies for all integer $n \ge 0$:
(a) $f(2n + 1)^2 - f(2n)^2 = 6f(n) + 1$, (b) $f(2n) \ge f(n)$
where $Z_{\ge 0}$ is the set of nonnegative integers. Solve the equation $f(n) = 1000$
Let $A = \{1,2,...,m + n\}$, where $m,n$ are positive integers, and let the function f : $A \to A$ be defined by:
$f(m) = 1$, $f(m+n) = m+1$ and $f(i) = i+1$ for all the other $i$.
(a) Prove that if $m$ and $n$ are odd, then there exists a function $g : A \to A$ such that $g(g(a)) = f(a)$ for all $a \in A$.
(b) Prove that if $m$ is even, then there is a function $g : A\to A$ such that $g(g(a))=f(a)$ for all $a \in A$ is and only if $n = m$.
Consider the triangle $ ABC$ with $ m(\angle BAC \equal{} 90^\circ)$ and $ AC \equal{} 2AB$. Let $ P$ and $ Q$ be the midpoints of $ AB$ and $ AC$,respectively. Let $ M$ and $ N$ be two points found on the side $ BC$ such that $ CM \equal{} BN \equal{} x$. It is also known that $ 2S[MNPQ] \equal{} S[ABC]$. Determine $ x$ in function of $ AB$.
Find all real numbers $ a,b,c,d$ such that \[ \left\{\begin{array}{cc}a \plus{} b \plus{} c \plus{} d \equal{} 20, \\
ab \plus{} ac \plus{} ad \plus{} bc \plus{} bd \plus{} cd \equal{} 150. \end{array} \right.\]
Let
\[f(x)=\frac{(x-18)(x-72)(x-98)(x-k)}{x}.\]
There exist exactly three positive real values of $k$ such that $f$ has a minimum at exactly two real values of $x$. Find the sum of these three values of $k$.
Let $ f : (0,\infty) \to \mathbb R$ be a continous function such that the sequences $ \{f(nx)\}_{n\geq 1}$ are nondecreasing for any real number $ x$. Prove that $ f$ is nondecreasing.
Is there a triangle with angles in ratio of $ 1: 2: 4$ and the length of its sides are integers with at least one of them is a prime number?
[i]Nanang Susyanto, Jogjakarta[/i]
Maria was a brilliant mathematician who found the following property about her year of birth: if $f$ is a function defined in the set of natural numbers $N = \{0, 1, 2, 3, 4, 5,...\}$ such that $f(1) = 1335$ and $f(n+1) = f(n)-2n+43$ for all $n \in N$, then his year of birth is the maximum value that $f(n)$ can reach when $n$ takes values in $N$. Determine the year of birth of Mary.
Find all functions $f:\mathbb{R} \to \mathbb{R}$ satisfying the equation \[
f(x^2+y^2+2f(xy)) = (f(x+y))^2.
\] for all $x,y \in \mathbb{R}$.
Let $x_i$, $y_i$, $z_i$, $w_i \in \mathbb{R}^+, i = 1, 2,\cdots n$, such that$$\sum \limits_{i=1}^nx_i=nx,\ \sum \limits_{i=1}^ny_i=ny,\ \sum \limits_{i=1}^nw_i=nw $$ $$\Gamma \left(z_i\right)\geq \Gamma \left(w_i\right),\ \sum \limits_{i=1}^n\Gamma \left(z_i\right)=n\Gamma^* (z)$$Then$$\sum \limits_{i=1}^n \frac{\left(\Gamma \left(x_i\right)+\Gamma \left(y_i\right)\right)^2}{\Gamma \left(z_i\right)-\Gamma \left(w_i\right)}\geq n\frac{\left(\Gamma \left(x\right)+\Gamma \left(y\right)\right)^2}{\Gamma^* \left(z\right)-\Gamma \left(w\right)}$$
The function $f:\mathbb{R} \to \mathbb{R}$ is such that $f(f(x+1)) = x^3+1$ for all real numbers $x$. Prove that the equation $f(x) = 0 $ has exactly one real root.
Each of $n$ boys and $n$ girls chooses a random number from the set $\{ 1, 2, 3, 4, 5 \}$, uniformly and independently. Let $p_n$ be the probability that every boy chooses a different number than every girl. As $n$ approaches infinity, what value does $\sqrt[n]{p_n}$ approach?
For each $ x$ in $ [0,1]$, define
\[ f(x)=\begin{cases}2x, &\text { if } 0 \leq x \leq \frac {1}{2}; \\
2 - 2x, &\text { if } \frac {1}{2} < x \leq 1. \end{cases}
\]Let $ f^{[2]}(x) = f(f(x))$, and $ f^{[n + 1]}(x) = f^{[n]}(f(x))$ for each integer $ n \geq 2$. For how many values of $ x$ in $ [0,1]$ is $ f^{[2005]}(x) = \frac {1}{2}$?
$ \textbf{(A)}\ 0 \qquad \textbf{(B)}\ 2005 \qquad \textbf{(C)}\ 4010 \qquad \textbf{(D)}\ 2005^2 \qquad \textbf{(E)}\ 2^{2005}$
Find the smallest possible value of the expression \[\left\lfloor\frac{a+b+c}{d}\right\rfloor+\left\lfloor\frac{b+c+d}{a}\right\rfloor+\left\lfloor\frac{c+d+a}{b}\right\rfloor+\left\lfloor\frac{d+a+b}{c}\right\rfloor\]
in which $a,~ b,~ c$, and $d$ vary over the set of positive integers.
(Here $\lfloor x\rfloor$ denotes the biggest integer which is smaller than or equal to $x$.)
Given the numbers $ 1,2,2^2, \ldots ,2^{n\minus{}1}$, for a specific permutation $ \sigma \equal{} x_1,x_2, \ldots, x_n$ of these numbers we define $ S_1(\sigma) \equal{} x_1$, $ S_2(\sigma)\equal{}x_1\plus{}x_2$, $ \ldots$ and $ Q(\sigma)\equal{}S_1(\sigma)S_2(\sigma)\cdot \cdot \cdot S_n(\sigma)$. Evaluate $ \sum 1/Q(\sigma)$, where the sum is taken over all possible permutations.