Found problems: 112
Let $a_{1},a_{2},\ldots ,a_{n}$ be positive real numbers such that $a_{1}+a_{2}+\cdots +a_{n}<1$. Prove that
\[ \frac{a_{1} a_{2} \cdots a_{n} \left[ 1 - (a_{1} + a_{2} + \cdots + a_{n}) \right] }{(a_{1} + a_{2} + \cdots + a_{n})( 1 - a_{1})(1 - a_{2}) \cdots (1 - a_{n})} \leq \frac{1}{ n^{n+1}}. \]
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 $0<a_1<a_2<\cdots <a_n$ be real numbers. Prove that
\[\left (\frac{1}{1+a_1}+\frac{1}{1+a_2}+\cdots +\frac{1}{1+a_n}\right )^2 \leq \frac{1}{a_1}+\frac{1}{a_2-a_1}+\cdots +\frac{1}{a_n-a_{n-1}}.\]
Let $n\geq3$ be a given integer, and let $a_1,a_2,\cdots,a_{2n},b_1,b_2,\cdots,b_{2n}$ be $4n$ nonnegative reals, such that $$a_1+a_2+\cdots+a_{2n}=b_1+b_2+\cdots+b_{2n}>0,$$ and for any $i=1,2,\cdots,2n,$ $a_ia_{i+2}\geq b_i+b_{i+1},$ where $a_{2n+1}=a_1,$ $a_{2n+2}=a_2,$ $b_{2n+1}=b_1.$ Detemine the minimum of $a_1+a_2+\cdots+a_{2n}.$
Let \[ E_n=(a_1-a_2)(a_1-a_3)\ldots(a_1-a_n)+(a_2-a_1)(a_2-a_3)\ldots(a_2-a_n)+\ldots+(a_n-a_1)(a_n-a_2)\ldots(a_n-a_{n-1}). \] Let $S_n$ be the proposition that $E_n\ge0$ for all real $a_i$. Prove that $S_n$ is true for $n=3$ and $5$, but for no other $n>2$.
Let $n > 3$ be a natural number, and let $x_1$, $x_2$, ..., $x_n$ be $n$ positive real numbers whose product is $1$. Prove the inequality \[ \frac {1}{1 + x_1 + x_1\cdot x_2} + \frac {1}{1 + x_2 + x_2\cdot x_3} + ... + \frac {1}{1 + x_n + x_n\cdot x_1} > 1. \]
Let $n$ be a fixed positive integer. Find the maximum possible value of \[ \sum_{1 \le r < s \le 2n} (s-r-n)x_rx_s, \] where $-1 \le x_i \le 1$ for all $i = 1, \cdots , 2n$.
Let $n \geq 2$ be a positive integer and $a_{1},\ldots , a_{n}$ be positive real numbers such that $a_{1}+...+a_{n}= 1$. Prove that:
\[\frac{a_{1}}{1+a_{2}+\cdots +a_{n}}+\cdots +\frac{a_{n}}{1+a_{1}+a_{2}+\cdots +a_{n-1}}\geq \frac{n}{2n-1}\]
Prove that for all positive real numbers $a_1,a_2,\cdots a_n$ \[\frac{1}{\frac{1}{1+a_1}+\frac{1}{1+a_2}+\cdots +\frac{1}{1+a_n}}-\frac{1}{\frac{1}{a_1}+\frac{1}{a_2}+\cdots +\frac{1}{a_n}}\geq \frac{1}{n}\] When does the inequality hold?
The natural numbers $x_1, x_2, \ldots , x_n$ are such that all their $2^n$ partial sums are distinct. Prove that:
$$ {x_1}^2 + {x_2}^2 + \ldots + {x_n}^2 \geq \frac{4^n – 1}{3}. $$
Let $ n \geq 2, n \in \mathbb{N}$ and let $ p, a_1, a_2, \ldots, a_n, b_1, b_2, \ldots, b_n \in \mathbb{R}$ satisfying $ \frac{1}{2} \leq p \leq 1,$ $ 0 \leq a_i,$ $ 0 \leq b_i \leq p,$ $ i \equal{} 1, \ldots, n,$ and \[ \sum^n_{i\equal{}1} a_i \equal{} \sum^n_{i\equal{}1} b_i.\] Prove the inequality: \[ \sum^n_{i\equal{}1} b_i \prod^n_{j \equal{} 1, j \neq i} a_j \leq \frac{p}{(n\minus{}1)^{n\minus{}1}}.\]
Let ${a_1,a_2,\dots,a_n}$ be positive real numbers, ${n>1}$. Denote by $g_n$ their geometric mean, and by $A_1,A_2,\dots,A_n$ the sequence of arithmetic means defined by \[ A_k=\frac{a_1+a_2+\cdots+a_k}{k},\qquad k=1,2,\dots,n. \] Let $G_n$ be the geometric mean of $A_1,A_2,\dots,A_n$. Prove the inequality \[
n \root n\of{\frac{G_n}{A_n}}+ \frac{g_n}{G_n}\le n+1 \] and establish the cases of equality.
[i]Proposed by Finbarr Holland, Ireland[/i]
Let $a_1, a_2, ...,a_n$ be positive real numbers such that $$a_1 + a_2 + ... + a_n = a_1^2 + a_2^2 + ... + a_n^2$$ Prove that $$\sum_{1\le i<j\le n} a_ia_j(1 - a_ia_j) \ge 0$$
Võ Quốc Bá Cẩn.
Prove the inequality
[b]a.)[/b] $
\left( a_{1}+a_{2}+...+a_{k}\right) ^{2}\leq k\left(
a_{1}^{2}+a_{2}^{2}+...+a_{k}^{2}\right) , $
where $k\geq 1$ is a natural number and $a_{1},$ $a_{2},$ $...,$ $a_{k}$ are arbitrary real numbers.
[b]b.)[/b] Using the inequality (1), show that if the real numbers $a_{1},$ $a_{2},$ $...,$ $a_{n}$ satisfy the inequality
\[
a_{1}+a_{2}+...+a_{n}\geq \sqrt{\left( n-1\right) \left(
a_{1}^{2}+a_{2}^{2}+...+a_{n}^{2}\right) },
\]
then all of these numbers $a_{1},$ $a_{2},$ $\ldots,$ $a_{n}$ are non-negative.
Find the least number $ c$ satisfyng the condition $\sum_{i=1}^n {x_i}^2\leq cn$
and all real numbers $x_1,x_2,...,x_n$ are greater than or equal to $-1$ such that $\sum_{i=1}^n {x_i}^3=0$
Let $a_1,\ldots,a_n$ and $b_1\ldots,b_n$ be $2n$ real numbers. Prove that there exists an integer $k$ with $1\le k\le n$ such that
$ \sum_{i=1}^n|a_i-a_k| ~~\le~~ \sum_{i=1}^n|b_i-a_k|.$
(Proposed by Gerhard Woeginger, Austria)
Given the positive real numbers $a_{1},a_{2},\dots,a_{n},$ such that $n>2$ and $a_{1}+a_{2}+\dots+a_{n}=1,$ prove that the inequality
\[
\frac{a_{2}\cdot a_{3}\cdot\dots\cdot a_{n}}{a_{1}+n-2}+\frac{a_{1}\cdot a_{3}\cdot\dots\cdot a_{n}}{a_{2}+n-2}+\dots+\frac{a_{1}\cdot a_{2}\cdot\dots\cdot a_{n-1}}{a_{n}+n-2}\leq\frac{1}{\left(n-1\right)^{2}}\]
does holds.
Let $ n$ be an integer,$ n \geq 3.$ Let $ x_1, x_2, \ldots, x_n$ be real numbers such that $ x_i < x_{i\plus{}1}$ for $ 1 \leq i \leq n \minus{} 1$. Prove that
\[ \frac{n(n\minus{}1)}{2} \sum_{i < j} x_ix_j > \left(\sum^{n\minus{}1}_{i\equal{}1} (n\minus{}i)\cdot x_i \right) \cdot \left(\sum^{n}_{j\equal{}2} (j\minus{}1) \cdot x_j \right)\]
Let $n\geq 2$ be some fixed positive integer and suppose that $a_1, a_2,\dots,a_n$ are positive real numbers satisfying $a_1+a_2+\cdots+a_n=2^n-1$.
Find the minimum possible value of $$\frac{a_1}{1}+\frac{a_2}{1+a_1}+\frac{a_3}{1+a_1+a_2}+\cdots+\frac{a_n}{1+a_1+a_2+\cdots+a_{n-1}}$$
Let $ n$ be an integer, $ n \geq 3.$ Let $ a_1, a_2, \ldots, a_n$ be real numbers such that $ 2 \leq a_i \leq 3$ for $ i \equal{} 1, 2, \ldots, n.$ If $ s \equal{} a_1 \plus{} a_2 \plus{} \ldots \plus{} a_n,$ prove that
\[ \frac{a^2_1 \plus{} a^2_2 \minus{} a^2_3}{a_1 \plus{} a_2 \minus{} a_3} \plus{} \frac{a^2_2 \plus{} a^2_3 \minus{} a^2_4}{a_2 \plus{} a_3 \minus{} a_4} \plus{} \ldots \plus{} \frac{a^2_n \plus{} a^2_1 \minus{} a^2_2}{a_n \plus{} a_1 \minus{} a_2} \leq 2s \minus{} 2n.\]
Let $n\geq 2$ be an integer and let $a_1,a_2,\ldots,a_n$ be real numbers. Prove that for any non-empty subset $S\subset \{1,2,3,\ldots, n\}$ we have
\[ \left( \sum_{i \in S} a_i \right)^2 \leq \sum_{1\leq i \leq j \leq n } (a_i + \cdots + a_j ) ^2 . \]
[i]Gabriel Dospinescu[/i]
Let be an odd natural number $ n, $ and $ n $ real numbers $ y_1\le y_2\le\cdots\le y_n $ whose sum is $ 0. $ Prove that
$$ (n+2)y_{\frac{n+1}{2}}^2\le y_1^2+y_2^2+\cdots +y_n^2, $$
and specify where equality is attained.
[i]Nicolae Bourbăcuț[/i]
Prove the following inequality:
\[\prod^k_{i=1} x_i \cdot \sum^k_{i=1} x^{n-1}_i \leq \sum^k_{i=1}
x^{n+k-1}_i,\] where $x_i > 0,$ $k \in \mathbb{N}, n \in
\mathbb{N}.$
Let $a_{ij}, i = 1, 2, \dots, m$ and $j = 1, 2, \dots, n$ be positive real numbers. Prove that
\[ \sum_{i = 1}^m \left( \sum_{j = 1}^n \frac{1}{a_{ij}} \right)^{-1} \le \left( \sum_{j = 1}^n \left( \sum_{i = 1}^m a_{ij} \right)^{-1} \right)^{-1} \]
Positive real numbers $x_1,x_2,...,x_n$ satisfy the condition $\sum_{i=1}^n x_i \le \sum_{i=1}^n x_i ^2$ .
Prove the inequality $\sum_{i=1}^n x_i^t \le \sum_{i=1}^n x_i ^{t+1}$ for all real numbers $t > 1$.