Found problems: 4776
For each positive integer $n$, let $f_1(n)$ be twice the number of positive integer divisors of $n$, and for $j \ge 2$, let $f_j(n) = f_1(f_{j-1}(n))$. For how many values of $n \le 50$ is $f_{50}(n) = 12?$
$\textbf{(A) }7\qquad\textbf{(B) }8\qquad\textbf{(C) }9\qquad\textbf{(D) }10\qquad\textbf{(E) }11$
For $f(x)$ a positive , monotone decreasing function defined in $[0,1],$ prove that
$$ \int_{0}^{1} f(x) dx \cdot \int_{0}^{1} xf(x)^{2} dx \leq \int_{0}^{1} f(x)^{2} dx \cdot \int_{0}^{1} xf(x) dx.$$
Function $ f:\mathbb{R}\rightarrow\mathbb{R} $ such that $f(xf(y))=yf(x)$ for any $x,y$ are real numbers. Prove that $f(-x) = -f(x)$ for all real numbers $x$.
The range of function $y=x+\sqrt{x^2-3x+2}(x\in\mathbb{R})$ is________.
Prove that for each natural number $m$, there is a natural number $N$ such that for each $b$ that $2\leq b\leq1389$ sum of digits of $N$ in base $b$ is larger than $m$.
Given a positive integer $\displaystyle n = \prod_{i=1}^s p_i^{\alpha_i}$, we write $\Omega(n)$ for the total number $\displaystyle \sum_{i=1}^s \alpha_i$ of prime factors of $n$, counted with multiplicity. Let $\lambda(n) = (-1)^{\Omega(n)}$ (so, for example, $\lambda(12)=\lambda(2^2\cdot3^1)=(-1)^{2+1}=-1$).
Prove the following two claims:
i) There are infinitely many positive integers $n$ such that $\lambda(n) = \lambda(n+1) = +1$;
ii) There are infinitely many positive integers $n$ such that $\lambda(n) = \lambda(n+1) = -1$.
[i](Romania) Dan Schwarz[/i]
Find all monotonically increasing or monotonically decreasing functions $f: \mathbb{R}_+\to\mathbb{R}_+$ which satisfy the equation $f\left(xy\right)\cdot f\left(\frac{f\left(y\right)}{x}\right)=1$ for any two numbers $x$ and $y$ from $\mathbb{R}_+$.
Hereby, $\mathbb{R}_+$ is the set of all positive real numbers.
[i]Note.[/i] A function $f: \mathbb{R}_+\to\mathbb{R}_+$ is called [i]monotonically increasing[/i] if for any two positive numbers $x$ and $y$ such that $x\geq y$, we have $f\left(x\right)\geq f\left(y\right)$.
A function $f: \mathbb{R}_+\to\mathbb{R}_+$ is called [i]monotonically decreasing[/i] if for any two positive numbers $x$ and $y$ such that $x\geq y$, we have $f\left(x\right)\leq f\left(y\right)$.
2 Points $ P\left(a,\ \frac{1}{a}\right),\ Q\left(2a,\ \frac{1}{2a}\right)\ (a > 0)$ are on the curve $ C: y \equal{}\frac{1}{x}$. Let $ l,\ m$ be the tangent lines at $ P,\ Q$ respectively. Find the area of the figure surrounded by $ l,\ m$ and $ C$.
Let $(b_n)_{n \ge 0}$ be a sequence of positive integers satisfying $b_n=d\left(\sum_{i=0}^{n-1} b_k\right)$ for all $n \ge 1$. (By $d(m)$ we denote the number of positive divisors of $m$.)
a) Prove that $(b_n)_{n \ge 0}$ is unbounded.
b) Prove that there are infinitely many $n$ such that $b_n>b_{n+1}$.
Find all functions $f:R\rightarrow R$ such that \[ f(x^3)+f(y^3)=(x+y)(f(x^2)+f(y^2)-f(xy)) \] for all $x,y\in R$.
A function $f:\mathbb{R} \to \mathbb{R}$ has the following property:
$$\text{For every } x,y \in \mathbb{R} \text{ such that }(f(x)+y)(f(y)+x) > 0, \text{ we have } f(x)+y = f(y)+x.$$
Prove that $f(x)+y \leq f(y)+x$ whenever $x>y$.
Function $f:\mathbb{R}\to\mathbb{R}$, satisfies that $f(0)=1$, and $f(xy+1)=f(x)f(y)-f(y)-x+2$, then $f(x)=$________.
Let $ N$ be a positive integer. How many non-negative integers $ n \le N$ are there that have an integer multiple, that only uses the digits $ 2$ and $ 6$ in decimal representation?
Let $\mathbb N$ denote the set of positive integers, and for a function $f$, let $f^k(n)$ denote the function $f$ applied $k$ times. Call a function $f : \mathbb N \to \mathbb N$ [i]saturated[/i] if \[ f^{f^{f(n)}(n)}(n) = n \] for every positive integer $n$. Find all positive integers $m$ for which the following holds: every saturated function $f$ satisfies $f^{2014}(m) = m$.
[i]Proposed by Evan Chen[/i]
(a) Find out, whether there exists a differentiable function $f: R \longrightarrow R$, not equaling $0$ for all $x \in R$, satisfying the conditions $2f(f(x)) = f(x) \geq 0$ for all $x \in R$.
(b) Find out, whether there exists a differentiable function $f: R \longrightarrow R$, not equaling $0$ for all $x \in R$, satisfying the conditions $-1 \leq 2f(f(x)) = f(x) \leq 1$ for all $x \in R$.
Let $f : \mathbb{Z} \to \mathbb{Z}$ be a function satisfying $f(0) \ne 0$, $f(1) = 0$ and
$(i) f(xy) + f(x)f(y) = f(x) + f(y)$
$(ii)\left(f(x-y) - f(0)\right ) f(x)f(y) = 0 $
for all $x,y \in \mathbb{Z}$, simultaneously.
$(a)$ Find the set of all possible values of the function $f$.
$(b)$ If $f(10) \ne 0$ and $f(2) = 0$, find the set of all integers $n$ such that $f(n) \ne 0$.
Let \[ f(x_1,x_2,x_3,x_4,x_5,x_6,x_7)=x_1x_2x_4+x_2x_3x_5+x_3x_4x_6+x_4x_5x_7+x_5x_6x_1+x_6x_7x_2+x_7x_1x_3 \] be defined for non-negative real numbers $x_1,x_2,\dots,x_7$ with sum $1$.
Prove that $f(x_1,x_2,\dots,x_7)$ has a maximum value and find that value.
Let $ a_1,\ldots,a_n$ be positive reals so that $ a_1\plus{}a_2\plus{}\ldots\plus{}a_n\le\frac n2$. Find the minimal value of
$ \sqrt{a_1^2\plus{}\frac1{a_2^2}}\plus{}\sqrt{a_2^2\plus{}\frac1{a_3^2}}\plus{}\ldots\plus{}\sqrt{a_n^2\plus{}\frac1{a_1^2}}$.
The degree-$6$ polynomial $f$ satisfies $f(7) - f(1) = 1, f(8) - f(2) = 16, f(9) - f(3) = 81, f(10) - f(4) = 256$ and $f(11) - f(5) = 625.$ Compute $f(15) - f(-3).$
Let $ f:\mathbb{C}\longrightarrow\mathbb{C} $ be an holomorphic function which has the property that there exist three positive real numbers $ a,b,c $ such that $ |f(z)|\geqslant a|z|^b , $ for any complex numbers $ z $ with $ |z|\geqslant c. $
Prove that $ f $ is polynomial with degree at least $ \lceil b\rceil . $
Let $f$ be a continuous function on $[0,1]$ such that for every $x\in [0,1]$,
we have $\int_{x}^{1}f(t)dt \geq\frac{1-x^{2}}{2}$. Show that $\int_{0}^{1}f(t)^{2}dt \geq \frac{1}{3}$.
Let $ S$ be the set of nonnegative integers. Find all functions $ f,g,h: S\rightarrow S$ such that
$ f(m\plus{}n)\equal{}g(m)\plus{}h(n),$ for all $ m,n\in S$, and
$ g(1)\equal{}h(1)\equal{}1$.
Let be two real numbers $ a<b $ and a function $ f:[a,b]\longrightarrow\mathbb{R} $ having the property that if the sequence $ \left(f\left( x_n \right)\right)_{n\ge 1} $ is convergent, then the sequence $ \left( x_n \right)_{n\ge 1} $ is convergent.
[b]a)[/b] Prove that if $ f $ admits antiderivatives, then $ f $ is integrable.
[b]b)[/b] Is the converse of [b]a)[/b] true?
[i]Marcelina Popa[/i]
Let $ f: \mathbb{N} \rightarrow \mathbb{N} $ be a function from the positive integers to the positive integers for which $ f(1)=1,f(2n)=f(n) $ and $ f(2n+1)=f(n)+f(n+1) $ for all $ n\in \mathbb{N} $. Prove that for any natural number $ n $, the number of odd natural numbers $ m $ such that $ f(m)=n $ is equal to the number of positive integers not greater than $ n $ having no common prime factors with $ n $.
A sequence of integers $\{f(n)\}$ for $n=0,1,2,\ldots$ is defined as follows: $f(0)=0$ and for $n>0$,
$$\begin{matrix}f(n)=&f(n-1)+3,&\text{if }n=0\text{ or }1\pmod6,\\&f(n-1)+1,&\text{if }n=2\text{ or }5\pmod6,\\&f(n-1)+2,&\text{if }n=3\text{ or }4\pmod6.\end{matrix}$$Derive an explicit formula for $f(n)$ when $n\equiv0\pmod6$, showing all necessary details in your derivation.