Found problems: 112
Let $a_1,a_2,...,a_{2020}$ be positive real numbers. Prove that:
$$\max{(a^2_1-a_2,a^2_2-a_3,...,a^2_{2020}-a_1)}\ge\max{(a^2_1-a_1,a^2_2-a_2,...,a^2_{2020}-a_{2020})}$$
Let $a_1, a_2, \dots, a_n$ be positive real numbers, whose sum is $1$. Prove that \[ \frac{a_1^2}{a_1+a_2}+\frac{a_2^2}{a_2+a_3}+\dots+\frac{a_{n-1}^2}{a_{n-1}+a_n}+\frac{a_n^2}{a_n+a_1}\ge \frac{1}{2} \]
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 $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$.
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.
Let $0=x_0<x_1<\cdots<x_n=1$ .Find the largest real number$ C$ such that for any positive integer $ n $ , we have $$\sum_{k=1}^n x^2_k (x_k - x_{k-1})>C$$
Prove that for $n>1$ and real numbers $a_0,a_1,\dots, a_n,k$ with $a_1=a_{n-1}=0$,
\[|a_0|-|a_n|\leq \sum_{i=0}^{n-2}|a_i-ka_{i+1}-a_{i+2}|.\]
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,\cdots,a_n$ be integers such that $1=a_1\le a_2\le \cdots\le a_{2019}=99$. Find the minimum $f_0$ of the expression $$f=(a_1^2+a_2^2+\cdots+a_{2019}^2)-(a_1a_3+a_2a_4+\cdots+a_{2017}a_{2019}),$$
and determine the number of sequences $(a_1,a_2,\cdots,a_n)$ such that $f=f_0$.
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 $u_1, u_2, \ldots, u_n, v_1, v_2, \ldots, v_n$ be real numbers. Prove that
\[1+ \sum_{i=1}^n (u_i+v_i)^2 \leq \frac 43 \Biggr( 1+ \sum_{i=1}^n u_i^2 \Biggl) \Biggr( 1+ \sum_{i=1}^n v_i^2 \Biggl) .\]
Let $x_1,x_2,\ldots,x_n$ be real numbers satisfying $x_1^2+x_2^2+\ldots+x_n^2=1$. Prove that for every integer $k\ge2$ there are integers $a_1,a_2,\ldots,a_n$, not all zero, such that $|a_i|\le k-1$ for all $i$, and $|a_1x_1+a_2x_2+\ldots+a_nx_n|\le{(k-1)\sqrt n\over k^n-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 $x_1, \ldots , x_{100}$ be nonnegative real numbers such that $x_i + x_{i+1} + x_{i+2} \leq 1$ for all $i = 1, \ldots , 100$ (we put $x_{101 } = x_1, x_{102} = x_2).$ Find the maximal possible value of the sum $S = \sum^{100}_{i=1} x_i x_{i+2}.$
[i]Proposed by Sergei Berlov, Ilya Bogdanov, Russia[/i]
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, \ldots , x_{100}$ be nonnegative real numbers such that $x_i + x_{i+1} + x_{i+2} \leq 1$ for all $i = 1, \ldots , 100$ (we put $x_{101 } = x_1, x_{102} = x_2).$ Find the maximal possible value of the sum $S = \sum^{100}_{i=1} x_i x_{i+2}.$
[i]Proposed by Sergei Berlov, Ilya Bogdanov, Russia[/i]
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 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 $n \ge 1$ and $x_1, \ldots, x_n \ge 0$. Prove that
$$ (x_1 + \frac{x_2}{2} + \ldots + \frac{x_n}{n}) (x_1 + 2x_2 + \ldots + nx_n) \le \frac{(n+1)^2}{4n} (x_1 + x_2 + \ldots + x_n)^2 .$$
Let $ {{a} _ {1}}, {{a} _ {2}}, \ldots, {{a} _ {n}} $ be permutation of numbers $ 1,2, \ldots, n $, where $ n \geq 2 $.
Find the maximum value of the sum $$ S (n) = | {{a} _ {1}} - {{a} _ {2}} | + | {{a} _ {2}} - {{a} _ {3}} | + \cdots + | {{a} _ {n-1}} - {{a} _ {n}} |. $$
Let $a_1, a_2, \ldots, a_n$ be positive real numbers. Prove the inequality
\[\binom n2 \sum_{i<j} \frac{1}{a_ia_j} \geq 4 \left( \sum_{i<j} \frac{1}{a_i+a_j} \right)^2\]
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)
$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}}}$
(1) Let $a,b,c$ be positive real numbers satisfying $(a^2+b^2+c^2)^2>2(a^4+b^4+c^4)$. Prove that $a,b,c$ can be the lengths of three sides of a triangle respectively.
(2) Let $a_1,a_2,\dots ,a_n$ be $n$ ($n>3$) positive real numbers satisfying $(a_1^2+a_2^2+\dots +a_n^2)^2>(n-1)(a_1^4+ a_2^4+\dots +a_n^4)$. Prove that any three of $a_1,a_2,\dots ,a_n$ can be the lengths of three sides of a triangle respectively.
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.\]