sum a_ia_j(1 - a_ia_j) >= 0 if sum a_1 = sum a_i^2, for a_i>0

Art of Problem Solving

AoPS Online

High School Olympiads Regional, national, and international math olympiads

Regional, national, and international math olympiads

3 M G

BBookmark VNew Topic kLocked

High School Olympiads Regional, national, and international math olympiads

Regional, national, and international math olympiads

3 M G

BBookmark VNew Topic kLocked

No tags match your search

M

sum a_ia_j(1 - a_ia_j) >= 0 if sum a_1 = sum a_i^2, for a_i>0

G H J

Reveal topic tags

n-variable inequality

L

G H BBookmark kLocked kLocked NReply

Source: 2015 Saudi Arabia IMO TST II p3

The post below has been deleted. Click to close.

This post has been deleted. Click here to see post.

30628 posts

#1 h Jul 24, 2020, 3:36 PM

Y by

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.

This post has been edited 1 time. Last edited by parmenides51, Jul 24, 2020, 3:36 PM

Z K Y

The post below has been deleted. Click to close.

This post has been deleted. Click here to see post.

433 posts

NaPrai

#3 h Jul 24, 2020, 4:25 PM • 1 Y

Y by lahmacun

We may write the inequality as $\sum_{1 \le i<j \le n} a_ia_j \ge \sum_{1 \le i<j \le n} a_i^2a_j^2.$ From the identities $\sum_{1 \le i < j \le n} a_ia_j = \frac{1}{2}\left(\left(\sum_{i=1}^n a_i\right)^2 - \sum_{i=1}^n a_i^2\right), \ \sum_{1 \le i < j \le n} a_i^2a_j^2 = \frac{1}{2}\left(\left(\sum_{i=1}^n a_i^2\right)^2 - \sum_{i=1}^n a_i^4\right)$ and the condition $\sum_{i=1}^n a_i = \sum_{i=1}^n a_i^2$ , the inequality is equivalent to $\sum_{i=1} a_i^4 \ge \sum_{i=1} a_i^2.$ By Hölder's inequality, we have $\left(\sum_{i=1}^n a_i^4\right)\left(\sum_{i=1}^n a_i\right)^2 \ge \left(\sum_{i=1}^n a_i^2\right)^3.$ From $\sum_{i=1}^n a_i = \sum_{i=1}^n a_i^2$ , the inequality becomes $\sum_{i=1} a_i^4 \ge \sum_{i=1} a_i^2$ as we want.

Z K Y

The post below has been deleted. Click to close.

This post has been deleted. Click here to see post.

272 posts

#4 h Jul 24, 2020, 6:33 PM

Y by

NaPrai wrote:

We may write the inequality as $\sum_{1 \le i<j \le n} a_ia_j \ge \sum_{1 \le i<j \le n} a_i^2a_j^2.$ From the identities $\sum_{1 \le i < j \le n} a_ia_j = \frac{1}{2}\left(\left(\sum_{i=1}^n a_i\right)^2 - \sum_{i=1}^n a_i^2\right), \ \sum_{1 \le i < j \le n} a_i^2a_j^2 = \frac{1}{2}\left(\left(\sum_{i=1}^n a_i^2\right)^2 - \sum_{i=1}^n a_i^4\right)$ and the condition $\sum_{i=1}^n a_i = \sum_{i=1}^n a_i^2$ , the inequality is equivalent to $\sum_{i=1} a_i^4 \ge \sum_{i=1} a_i^2.$ By Hölder's inequality, we have $\left(\sum_{i=1}^n a_i^4\right)\left(\sum_{i=1}^n a_i\right)^2 \ge \left(\sum_{i=1}^n a_i^2\right)^3.$ From $\sum_{i=1}^n a_i = \sum_{i=1}^n a_i^2$ , the inequality becomes $\sum_{i=1} a_i^4 \ge \sum_{i=1} a_i^2$ as we want.

Your solution is awesome! I am kinda new in olympiad inequalities and summation signs really scare me, i would be really thankful if you could share any resource that you used to improve your skills in this topic

Best regards
Thank you

Z K Y

N Quick Reply

G

H

=

© 2025 AoPS Incorporated

a