This website contains problems from math contests. Problems and corresponding tags were obtained from the Art of Problem Solving website.

Tags were heavily modified to better represent problems.

AND:
OR:
NO:

Found problems: 2

2016 Croatia Team Selection Test, Problem 1
Tags: kantorovich , n-variable inequality , inequalities
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 .$$

2016 Croatia Team Selection Test, Problem 1
Tags: kantorovich , n-variable inequality , inequalities
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 .$$