Found problems: 4776
For $a>0$, let $f(a)=\lim_{t\rightarrow +0} \int_{t}^{1} |ax+x\ln x|\ dx.$ Let $a$ vary in the range $0 <a< +\infty$, find the minimum value of $f(a)$.
Let $f, g:\mathbb{Z}\rightarrow [0,\infty )$ be two functions such that $f(n)=g(n)=0$ with the exception of finitely many integers $n$. Define $h:\mathbb{Z}\rightarrow [0,\infty )$ by \[h(n)=\max \{f(n-k)g(k): k\in\mathbb{Z}\}.\] Let $p$ and $q$ be two positive reals such that $1/p+1/q=1$. Prove that \[ \sum_{n\in\mathbb{Z}}h(n)\geq \Bigg(\sum_{n\in\mathbb{Z}}f(n)^p\Bigg)^{1/p}\Bigg(\sum_{n\in\mathbb{Z}}g(n)^q\Bigg)^{1/q}.\]
Find all functions $f:R^+\rightarrow R^+$ such that for all positive reals $x$ and $y$
$$4f(x+yf(x))=f(x)f(2y)$$
Find all functions $f: {\mathbb{R^\plus{}}}\to{\mathbb{R^\plus{}}}$ such that
\[ f(1\plus{}xf(y))\equal{}yf(x\plus{}y)\]
for all $x,y\in\mathbb{R^\plus{}}$.
Prove that any function that maps the integers to themselves is a sum of any finite number of injective functions that map the integers to themselves.
[i]Sorin Rădulescu[/i] and [i]Ion Savu[/i]
Let $ \mathbb{Z}$ be the set of all integers. Define the set $ \mathbb{H}$ as follows:
(1). $ \dfrac{1}{2} \in \mathbb{H}$,
(2). if $ x \in \mathbb{H}$, then $ \dfrac{1}{1\plus{}x} \in \mathbb{H}$ and also $ \dfrac{x}{1\plus{}x} \in \mathbb{H}$.
Prove that there exists a bijective function $ f: \mathbb{Z} \rightarrow \mathbb{H}$.
Find all positive integers $n$ such that $n$ is equal to $100$ times the number of positive divisors of $n$.
$P$ is a monic polynomial of odd degree greater than one such that there exists a function $f : \mathbb{R} \rightarrow \mathbb{N}$ such that for each $x \in \mathbb{R}$ ,\[f(P(x))=P(f(x))\]
(a) Prove that there are a finite number of natural numbers in range of $f$.
(b) Prove that if $f$ is not constant then the equation $P(x)-x=0$ has at least two real solutions.
(c) For each natural $n>1$ prove that there exists a function $f : \mathbb{R} \rightarrow \mathbb{N}$ and a monic polynomial of odd degree greater than one $P$ such that for each $x \in \mathbb{R}$ ,\[f(P(x))=P(f(x))\] and range of $f$ contains exactly $n$ different numbers.
Time allowed for this problem was 105 minutes.
Let $f$ be a real function defined in the interval $[0, +\infty )$ and suppose that there exist two functions $f', f''$ in the interval $[0, +\infty )$ such that
\[f''(x)=\frac{1}{x^2+f'(x)^2 +1} \qquad \text{and} \qquad f(0)=f'(0)=0.\]
Let $g$ be a function for which
\[g(0)=0 \qquad \text{and} \qquad g(x)=\frac{f(x)}{x}.\]
Prove that $g$ is bounded.
Find all functions $f : \mathbb R \to \mathbb R$ such that
\[f\left(x+xy+f(y)\right)= \left( f(x)+\frac 12 \right) \left( f(y)+\frac 12 \right) \qquad \forall x,y \in \mathbb R.\]
You use a lock with four dials, each of which is set to a number between 0 and 9 (inclusive). You can never remember your code, so normally you just leave the lock with each dial one higher than the correct value. Unfortunately, last night someone changed all the values to 5. All you remember about your code is that none of the digits are prime, 0, or 1, and that the average value of the digits is 5.
How many combinations will you have to try?
Find all functions $f:(0,+\infty) \to (0,+\infty)$ that satisfy
$(i)$ $f(xf(y))=yf(x), \forall x,y > 0,$
$(ii)$ $\displaystyle\lim_{x\to+\infty} f(x) = 0.$
Let $f_0$ be the function from $\mathbb{Z}^2$ to $\{0,1\}$ such that $f_0(0,0)=1$ and $f_0(x,y)=0$ otherwise. For each positive integer $m$, let $f_m(x,y)$ be the remainder when \[ f_{m-1}(x,y) + \sum_{j=-1}^{1} \sum_{k=-1}^{1} f_{m-1}(x+j,y+k) \] is divided by $2$.
Finally, for each nonnegative integer $n$, let $a_n$ denote the number of pairs $(x,y)$ such that $f_n(x,y) = 1$.
Find a closed form for $a_n$.
[i]Proposed by Bobby Shen[/i]
Find all functions $f ,g,h : R\to R$ such that $f(x+y^3)+g(x^3+y) = h(xy)$ for all $x,y \in R$
Given the vector spaces $V,W$ with coefficients over a field $K$ and function $ \phi :V\to W$ satisfying the relation :
$$\varphi(\lambda x+y)= \lambda \varphi(x)+\phi (y)$$ for all $x,y \in V, \lambda \in K$. Such a function is called linear.
Let $L\varphi=\{x\in V/\varphi(x)=0\}$ , and$M=\varphi(V)$ , prove that :
(i) $L\varphi$ is subspace of $V$ and $M$ is subspace of $W$
(ii) $L\varphi={O}$ iff $\varphi$ is $1-1$
(iii) Dimension of $V$ equals to dimension of $L\varphi$ plus dimension of $M$
(iv) If $\theta : \mathbb{R}^3\to\mathbb{R}^3$ with $\theta(x,y,z)=(2x-z,x-y,x-3y+z)$, prove that $\theta$ is linear function . Find $L\theta=\{x\in {R}^3/\theta(x)=0\}$ and dimension of $M=\theta({R}^3)$.
Let be three positive real numbers $ a,b,c, $ a natural number $ n, $ and the functions $ f:\mathbb{R}\longrightarrow\mathbb{R} ,g:(0,\infty )\longrightarrow\mathbb{R} $ defined as:
$$ f(x)=\frac{2(n+1)x^n(x^{n+1}-a) +nx^{n+1} +2a^2x+a}{x^{2n+2}-2ax^{n+1} +a^2x^2+a^2} , $$
$$ g(x)=\frac{a+bx^n}{x+cx^{2n+1}} $$
Calculate the antiderivatives of $ f $ and $ g. $
[i]Nicolae Sanda[/i]
For a positive integer $n$ denote $A = \{1,2,..., n\}$. Suppose that $g : A\to A$ is a fixed function with $g(k) \ne k$ and $g(g(k)) = k$ for $k \in A$. How many functions $f: A \to A$ are there such that $f(k)\ne g(k)$ and $f(f(f(k))= g(k)$ for $k \in A$?
Given three positive real numbers $ x$, $ y$, $ z$ such that $ x \plus{} y \plus{} z \equal{} 1$, prove that
$ \frac {xy}{\sqrt {xy \plus{} yz}} \plus{} \frac {yz}{\sqrt {yz \plus{} zx}} \plus{} \frac {zx}{\sqrt {zx \plus{} xy}} \le \frac {\sqrt {2}}{2}$.
Let $\mathbb{R}^+$ denote the set of positive real numbers. Find all functions $f : \mathbb{R}^+\to\mathbb{R}^+$ that satisfy \[ \Big(1+yf(x)\Big)\Big(1-yf(x+y)\Big)=1\] for all $x,y\in\mathbb{R}^+$.
Let $p(z)$ be a polynomial of degree $n,$ all of whose zeros have absolute value $1$ in the complex plane. Put $g(z)=\frac{p(z)}{z^{n/2}}.$ Show that all zeros of $g'(z)=0$ have absolute value $1.$
Prove that for any positive integer $n$ and any real numbers $a_1,a_2,\cdots,a_n,b_1,b_2,\cdots,b_n$ we have that the equation
\[a_1 \sin(x) + a_2 \sin(2x) +\cdots+a_n\sin(nx)=b_1 \cos(x)+b_2\cos(2x)+\cdots +b_n \cos(nx)\]
has at least one real root.
By a partition $\pi$ of an integer $n\ge 1$, we mean here a representation of $n$ as a sum of one or more positive integers where the summands must be put in nondecreasing order. (E.g., if $n=4$, then the partitions $\pi$ are $1+1+1+1$, $1+1+2$, $1+3, 2+2$, and $4$).
For any partition $\pi$, define $A(\pi)$ to be the number of $1$'s which appear in $\pi$, and define $B(\pi)$ to be the number of distinct integers which appear in $\pi$. (E.g., if $n=13$ and $\pi$ is the partition $1+1+2+2+2+5$, then $A(\pi)=2$ and $B(\pi) = 3$).
Prove that, for any fixed $n$, the sum of $A(\pi)$ over all partitions of $\pi$ of $n$ is equal to the sum of $B(\pi)$ over all partitions of $\pi$ of $n$.
Let $k$ be a natural number. For each natural number $n$ we define $f_k (n)$ to be the least number, greater than $kn$, for which $nf_k (n)$ is a perfect square. Prove that $f_k (n)$ is injective.
Let be a finite set $ S. $ Determine the number of functions $ f:S\rightarrow S $ that satisfy $ f\circ f=f. $
Find the number of real solutions of the equation $a e^x = x^3$, where $a$ is a real parameter.