Found problems: 112
Let $a_1$, $a_2$, $\cdots$, $a_n$, $b_1$, $b_2$, $\cdots$, $b_n$ be positive real numbers such that $a_1 + a_2 + \cdots + a_n = b_1 + b_2 + \cdots + b_n$. Show that
\[ \frac{a_1^2}{a_1 + b_1} + \frac{a_2^2}{a_2 + b_2} + \cdots + \frac{a_n^2}{a_n + b_n} \geq \frac{a_1 + a_2 + \cdots + a_n}{2} \]
Let $n\ge 3$ be an integer, and let $a_2,a_3,\ldots ,a_n$ be positive real numbers such that $a_{2}a_{3}\cdots a_{n}=1$. Prove that
\[(1 + a_2)^2 (1 + a_3)^3 \dotsm (1 + a_n)^n > n^n.\]
[i]Proposed by Angelo Di Pasquale, Australia[/i]
Let $-1 < x_1 < x_2 , \cdots < x_n < 1$ and $x_1^{13} + x_2^{13} + \cdots + x_n^{13} = x_1 + x_2 + \cdots + x_n$. Prove that if $y_1 < y_2 < \cdots < y_n$, then \[ x_1^{13}y_1 + \cdots + x_n^{13}y_n < x_1y_1 + x_2y_2 + \cdots + x_ny_n. \]
$n$ is a natural number. for every positive real numbers $x_{1},x_{2},...,x_{n+1}$ such that $x_{1}x_{2}...x_{n+1}=1$ prove that:
$\sqrt[x_{1}]{n}+...+\sqrt[x_{n+1}]{n} \geq n^{\sqrt[n]{x_{1}}}+...+n^{\sqrt[n]{x_{n+1}}}$
Let $x_1$, $x_2$, $\cdots$, $x_n$ be positive real numbers, and let
\[ S = x_1 + x_2 + \cdots + x_n. \]
Prove that
\[ (1 + x_1)(1 + x_2) \cdots (1 + x_n) \leq 1 + S + \frac{S^2}{2!} + \frac{S^3}{3!} + \cdots + \frac{S^n}{n!} \]
Let $a$ and $b$ be positive real numbers, with $a < b$ and let $n$ be a positive integer. Prove that for all real numbers $x_1, x_2, \ldots , x_n \in [a, b]$:
$$ |x_1 - x_2| + |x_2 - x_3| + \cdots + |x_{n-1} - x_n| + |x_n - x_1| \leq \frac{2(b - a)}{b + a}(x_1 + x_2 + \cdots + x_n)$$
And determine for what values of $n$ and $x_1, x_2, \ldots , x_n$ the equality holds.
Let $ n$ be a positive integer such that $ n\geq 3$. Let $ a_1$, $ a_2$, ..., $ a_n$ and $ b_1$, $ b_2$, ..., $ b_n$ be $ 2n$ positive real numbers satisfying the equations
\[ a_1 \plus{} a_2 \plus{} ... \plus{} a_n \equal{} 1, \quad \text{and} \quad b_1^2 \plus{} b_2^2 \plus{} ... \plus{} b_n^2 \equal{} 1.\]
Prove the inequality
\[a_1\left(b_1 \plus{} a_2\right) \plus{} a_2\left(b_2 \plus{} a_3\right) \plus{} ... \plus{} a_{n \minus{} 1}\left(b_{n \minus{} 1} \plus{} a_n\right) \plus{} a_n\left(b_n \plus{} a_1\right) < 1.\]
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$ 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 $x_1, x_2, \cdots , x_n$ be positive reals with $x_1+x_2+\cdots+x_n=1$. Then show that
\[\sum_{i=1}^n \frac{x_i}{2-x_i} \ge \frac{n}{2n-1}\]
Let $n$ be an odd positive integer, and let $x_1,x_2,\cdots ,x_n$ be non-negative real numbers. Show that \[ \min_{i=1,\ldots,n} (x_i^2+x_{i+1}^2) \leq \max_{j=1,\ldots,n} (2x_jx_{j+1}) \]where $x_{n+1}=x_1$.
Let $P(x)$ be a polynomial with real non-negative coefficients. Let $k$ be a positive integer and $x_1, x_2, \dots, x_k$ positive real numbers such that $x_1x_2\cdots x_k=1$. Prove that
$$P(x_1)+P(x_2)+\cdots+P(x_k)\geq kP(1).$$
Let $0<a\leq 1$ be a real number and let $a\leq a_{i}\leq\frac{1}{a_{i}}\forall i=\overline{1,1996}$ are real numbers. Prove that for any nonnegative real numbers $k_{i}(i=1,2,...,1996)$ such that $\sum_{i=1}^{1996}k_{i}=1$ we have $(\sum_{i=1}^{1996}k_{i}a_{i})(\sum_{i=1}^{1996}\frac{k_{i}}{a_{i}})\leq (a+\frac{1}{a})^{2}$.
Let $ a_1\geq \cdots \geq a_n \geq a_{n \plus{} 1} \equal{} 0$ be real numbers. Show that
\[ \sqrt {\sum_{k \equal{} 1}^n a_k} \leq \sum_{k \equal{} 1}^n \sqrt k (\sqrt {a_k} \minus{} \sqrt {a_{k \plus{} 1}}).
\]
[i]Proposed by Romania[/i]
Find the largest real constant $a$ such that for all $n \geq 1$ and for all real numbers $x_0, x_1, ... , x_n$ satisfying $0 = x_0 < x_1 < x_2 < \cdots < x_n$ we have
\[\frac{1}{x_1-x_0} + \frac{1}{x_2-x_1} + \dots + \frac{1}{x_n-x_{n-1}} \geq a \left( \frac{2}{x_1} + \frac{3}{x_2} + \dots + \frac{n+1}{x_n} \right)\]
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 $a_0, a_1, a_2, ... , a_n$ be real numbers, which fulfill the following two conditions:
a) $0 = a_0 \leq a_1 \leq a_2 \leq ... \leq a_n$.
b) For all $0 \leq i < j \leq n$ holds: $a_j - a_i \leq j-i$.
Prove that
$$\left( \displaystyle \sum_{i=0}^n a_i \right)^2 \geq \sum_{i=0}^n a_i^3.$$
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 $x_1, x_2, \cdots , x_n$ be positive numbers. Prove that
\[\frac{x_1^2}{x_1^2+x_2x_3} + \frac{x_2^2}{x_2^2+x_3x_4} + \cdots +\frac{x_{n-1}^2}{x_{n-1}^2+x_nx_1} +\frac{x_n^2}{x_n^2+x_1x_2} \leq n-1\]
For those real numbers $x_1 , x_2 , \ldots , x_{2011}$ where each of which satisfies $0 \le x_1 \le 1$ ($i = 1 , 2 , \ldots , 2011$), find the maximum of
\[ x_1^3+x_2^3+ \cdots + x_{2011}^3 - \left( x_1x_2x_3 + x_2x_3x_4 + \cdots + x_{2011}x_1x_2 \right) \]
Let $a_i > 0$ for $i=1,2,\dots,n$ and suppose $a_1 + a_2 + \dots + a_n = 1$. Prove that for any positive integer $k$,
\[ \left( a_1^k + \frac{1}{a_1^k} \right) \left( a_2^k + \frac{1}{a_2^k} \right) \dots \left( a_n^k + \frac{1}{a_n^k} \right) \ge \left( n^k + \frac{1}{n^k} \right)^n. \]
Let $n \geq 3$ be an integer. Let $t_1$, $t_2$, ..., $t_n$ be positive real numbers such that \[n^2 + 1 > \left( t_1 + t_2 + \cdots + t_n \right) \left( \frac{1}{t_1} + \frac{1}{t_2} + \cdots + \frac{1}{t_n} \right).\] Show that $t_i$, $t_j$, $t_k$ are side lengths of a triangle for all $i$, $j$, $k$ with $1 \leq i < j < k \leq n$.
Let $x_1,x_2,\ldots,x_n$ be positive reals. Prove that
\[ \frac 1{1+x_1} + \frac 1{1+x_1+x_2} + \cdots + \frac 1{1+x_1+\cdots + x_n} < \sqrt { \frac 1{x_1} + \frac 1{x_2} + \cdots + \frac 1{x_n}} . \]
[i]Bogdan Enescu[/i]
The positive integers $a_1,a_2, \dots, a_n$ are aligned clockwise in a circular line with $n \geq 5$. Let $a_0=a_n$ and $a_{n+1}=a_1$. For each $i \in \{1,2,\dots,n \}$ the quotient \[ q_i=\frac{a_{i-1}+a_{i+1}}{a_i} \] is an integer. Prove \[ 2n \leq q_1+q_2+\dots+q_n < 3n. \]
If positive reals $ x_1,x_2,\cdots,x_n $ satisfy $\sum_{i=1}^{n}x_i=1.$ Prove that$$\sum_{i=1}^{n}\frac{1}{1+\sum_{j=1}^{i}x_j}<\sqrt{\frac{2}{3}\sum_{i=1}^{n}\frac{1}{x_i}}
$$