Found problems: 1671
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 $n$ and $k$ be positive integers. Prove that for $a_1, \dots, a_n \in [1,2^k]$ one has
\[ \sum_{i = 1}^n \frac{a_i}{\sqrt{a_1^2 + \dots + a_i^2}} \le 4 \sqrt{kn}. \]
Let $a_1,a_2,\ldots ,a_n$ be $n$ real numbers such that $0<a\le a_k\le b$ for $k=1,2,\ldots ,n$. If $m_1=\frac{1}{n}(a_1+a_2+\cdots+a_n)$ and $m_2=\frac{1}{n}(a_1^2+a_2^2+\cdots + a_n^2)$, prove that $m_2\le\frac{(a+b)^2}{4ab}m_1^2$ and find a necessary and sufficient condition for equality.
Consider a variable point $P$ inside a given triangle $ABC$. Let $D$, $E$, $F$ be the feet of the perpendiculars from the point $P$ to the lines $BC$, $CA$, $AB$, respectively. Find all points $P$ which minimize the sum \[ {BC\over PD}+{CA\over PE}+{AB\over PF}. \]
If three nonnegative reals $a$, $b$, $c$ satisfy $a+b+c=1$, prove that
$2 \leq \left(1-a^{2}\right)^{2}+\left(1-b^{2}\right)^{2}+\left(1-c^{2}\right)^{2}\leq \left(1+a\right)\left(1+b\right)\left(1+c\right)$.
Let $a, b, c$ be positive real numbers such that $a^2+b^2+c^2+(a+b+c)^2\leq4$. Prove that
\[\frac{ab+1}{(a+b)^2}+\frac{bc+1}{(b+c)^2}+\frac{ca+1}{(c+a)^2}\geq 3.\]
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 $ a,b,c$ be positive numbers, satisfying $ abc\geq 1$. Prove that
\[ a^{3} \plus{} b^{3} \plus{} c^{3} \geq ab \plus{} bc \plus{} ca.\]
Let $n$ be a positive integer. Prove that the inequality
\[n \sum_{i=1}^n \sum_{j = 1}^n \sum_{k=1}^n \frac{3}{a_ja_k + a_ka_i + a_i a_j} \ge \left(\sum_{j=1}^n \sum_{k=1}^n \frac{2}{a_j + a_k}\right)^2 \]
holds for any positive real numbers $a_1$, $a_2$, $\dots$, $a_n$.
[i]Proposed by Li4 and Ming Hsiao.[/i]
[b]Q.[/b] Find the minimum value of the expression for $x,y,z\in \mathbb{R}^{+}$
$$\sum_{\text{cyc}}\frac{(x+1)^{4}+2(y+1)^{6}-(y+1)^{4}}{(y+1)^{6}}$$
[i]Proposed by Aritra12[/i]
Let $n$ be a positive integer and let $a_1, a_2, \ldots, a_n$ be positive reals. Show that $$\sum_{i=1}^{n} \frac{1}{2^i}(\frac{2}{1+a_i})^{2^i} \geq \frac{2}{1+a_1a_2\ldots a_n}-\frac{1}{2^n}.$$
Let $ x_1, x_2,\ldots , x_n$ be positive real numbers such that $ x_1x_2\cdots x_n \equal{} 1$. Prove that
\[\sum_{i \equal{} 1}^n \frac {1}{n \minus{} 1 \plus{} x_i}\le 1.\]
There are $n$ students standing in a circle, one behind the other. The students have heights $h_1<h_2<\dots <h_n$. If a student with height $h_k$ is standing directly behind a student with height $h_{k-2}$ or less, the two students are permitted to switch places. Prove that it is not possible to make more than $\binom{n}{3}$ such switches before reaching a position in which no further switches are possible.
Let $\mathcal{S}$ denote the set of positive integer sequences (with at least two terms) whose terms sum to $2019$. For a sequence of positive integers $a_1, a_2, \dots, a_k$, its \emph{value} is defined to be
\[V(a_1, a_2, \dots, a_k) = \frac{a_1^{a_2} a_2^{a_3} \cdots a_{k-1}^{a_k}}{a_1! a_2! \cdots a_k!}.\]
Then the sum of the values over all sequences in $\mathcal{S}$ is $\frac{m}{n}$ where $m$ and $n$ are relatively prime positive integers. Compute the remainder when $m+n$ is divided by $1000$.
[i]Proposed by Sean Li[/i]
Prove that a ring that has a prime characteristic admits nonzero nilpotent elements if and only if its characteristic divides the number of its units.
Let $a,b,$ and $c$ be real numbers such that \begin{align*}
a+b+c &= 2, \text{ and} \\
a^2+b^2+c^2&= 12
\end{align*}
What is the difference between the maximum and minimum possible values of $c$?
$ \textbf{(A)}\ 2\qquad\textbf{(B)}\ \frac{10}{3}\qquad\textbf{(C)}\ 4\qquad\textbf{(D)}\ \frac{16}{3}\qquad\textbf{(E)}\ \frac{20}{3} $
If $a,b,c\in(0,\infty)$ such that $a+b+c=3$, then
$$\frac{a}{3a+bc+12}+\frac{b}{3b+ca+12}+\frac{c}{3c+ab+12}\le \frac{3}{16}$$
Let $m,n$ be naturals satisfying $n \geq m \geq 2$ and let $S$ be a set consisting of $n$ naturals. Prove that $S$ has at least $2^{n-m+1}$ distinct subsets, each whose sum is divisible by $m$. (The zero set counts as a subset).
Let $a,b,c,d$ be positive real numbers such that $ 2(a+b+c+d)\ge abcd $. Prove that \[ a^2+b^2+c^2+d^2 \ge abcd .\]
Prove that the fraction $ \dfrac{21n \plus{} 4}{14n \plus{} 3}$ is irreducible for every natural number $ n$.
Let $n$ be an integer number greater than $2$, let $x_{1},x_{2},\ldots ,x_{n}$ be $n$ positive real numbers such that
\[\sum_{i=1}^{n}\frac{1}{x_{i}+1}=1\]
and let $k$ be a real number greater than $1$. Show that:
\[\sum_{i=1}^{n}\frac{1}{x_{i}^{k}+1}\ge\frac{n}{(n-1)^{k}+1}\]
and determine the cases of equality.
For some positive integer $n,$ Elmo writes down the equation
\[x_1+x_2+\dots+x_n=x_1+x_2+\dots+x_n.\]
Elmo inserts at least one $f$ to the left side of the equation and adds parentheses to create a valid functional equation. For example, if $n=3,$ Elmo could have created the equation
\[f(x_1+f(f(x_2)+x_3))=x_1+x_2+x_3.\]
Cookie Monster comes up with a function $f: \mathbb{Q}\to\mathbb{Q}$ which is a solution to Elmo's functional equation. (In other words, Elmo's equation is satisfied for all choices of $x_1,\dots,x_n\in\mathbb{Q})$. Is it possible that there is no integer $k$ (possibly depending on $f$) such that $f^k(x)=x$ for all $x$?
[i]Srinivas Arun[/i]
Let $a,b,c,d $-reals positive numbers. Prove inequality:
$\frac{a^2+b^2+c^2}{ab+bc+cd}+\frac{b^2+c^2+d^2}{bc+cd+ad}+\frac{a^2+c^2+d^2}{ab+ad+cd}+\frac{a^2+b^2+d^2}{ab+ad+bc} \geq 4$
Let $N$ be a positive integer. Consider a $N \times N$ array of square unit cells. Two corner cells that lie on the same longest diagonal are colored black, and the rest of the array is white. A [i]move[/i] consists of choosing a row or a column and changing the color of every cell in the chosen row or column.
What is the minimal number of additional cells that one has to color black such that, after a finite number of moves, a completely black board can be reached?
Let \(d(n)\) denote the number of positive divisors of \(n\). The sequence \(a_0\), \(a_1\), \(a_2\), \(\ldots\) is defined as follows: \(a_0=1\), and for all integers \(n\ge1\), \[a_n=d(a_{n-1})+d(d(a_{n-2}))+\cdots+ {\underbrace{d(d(\ldots d(a_0)\ldots))}_{n\text{ times}}}.\] Show that for all integers \(n\ge1\), we have \(a_n\le3n\).
[i]Proposed by Karthik Vedula[/i]