Welcome all to the first ever Brilliant Inequality Contest. Like the Brilliant Integration Contest, the aim of the Inequality Contest is to improve skills and techniques often used in Olympiad-style Inequality problems. But above all, the main reason is so we can have fun.
Anyone is allowed to participate, as long as they adhere to the following rules.
I will post the first problem. If someone solves it, he or she can post a solution and then must post a new problem.
A solution must be posted below the thread of the problem. Then, the solver must post a new problem as a separate thread.
Please make a substantial comment. Spam or unrelated comments will be deleted. (To help me out, try to delete your comments within an hour of when you posted them, if they are not the solutions.)
Make sure you know how to solve your own problem before posting it, in case no one else is able to solve it within 48 hours. Then, you must post the solution and you have the right to post a new problem.
If the one who solves the last problem does not post a new problem in 24 hours, the creator of the previous problem has the right to post another problem.
The scope of the problems is Olympiad-style inequalities.
You are not allowed to post problems requiring calculus in the solutions (use of differentiation to prove a curve is concave or convex is allowed).
Lagrange Multipliers are not allowed to be used in a solution.
Inequalities allowed to be used are AM-GM, Muirhead, Power Mean and Weighted Power Mean, Cauchy-Schwarz, Holder, Rearrangement, Chebyshev, Schur, Jensen, Karamata, Reverse Rearrangement and Titu's lemma.
Try to post the simplest solution possible. For example, if someone posted a solution using Holder, Titu's and Cauchy, when there is a solution using only AM-GM, the latter is preferred.
Format your proof as follows:
SOLUTION OF PROBLEM (insert problem number here)
[Post your solution here]
PROBLEM (insert problem number here)
[Post your problem here]
Remember to reshare this note so it goes to everyone out there. And above all else, have fun!!!
PROBLEM 1
Let , and be positive reals such that , and . Find families of solutions for such that the following inequality is satisfied.
P.S.: For those who want to discuss problem solutions, they can do so here.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
Sort by:
Top NewestSolution of Problem 1 :
We will show that the given inequality is true for all positive reals x,y,z satisfying the conditions given in the question.
Case 1: When x,y,z are sides of triangle.
Let x=a+b,y=b+c,z=a+c; (a,b,c>0),so our inequality becomes:
cyc∑2(a+b)2(a+b+2c)≥cyc∑(a+b)3+9(a+b)(b+c)(a+c)
⟹2cyc∑(a+b)3+4cyc∑c(a+b)2≥cyc∑(a+b)3+9(a+b)(b+c)(a+c)
⟹cyc∑(a+b)3+4cyc∑c(a+b)2≥9(a+b)(b+c)(a+c)
⟹2cyc∑a3+3cyc∑(ab2+ba2)+4cyc∑(ab2+ba2)+24abc≥9(a+b)(b+c)(a+c)
⟹2cyc∑a3+7(a+b)(b+c)(c+a)+10abc≥9(a+b)(b+c)(c+a)
⟹2cyc∑a3+10abc≥2(a+b)(b+c)(c+a)
⟹cyc∑a3+5abc≥(a+b)(b+c)(c+a)
⟹cyc∑a3+3abc≥a2b+b2a+a2c+c2a+b2c+c2b
which is true by Schur's Inequality.
Equality occurs when a=b=c , that is x=y=z.
Hence proved.
Case 2: When x,y,z are not sides of a triangle.
In this case either x+y=z or y+z=x or z+x=y.
Let's take x+y=z.
Since the inequality is symmetric, WLOG we can assume that z≥x≥y.
Now substituting x+y=z in the inequality , we get 2x2(2y+x)+2y2(2x+y)+2(x+y)3≥x3+y3+(x+y)3+9xyz
After rearranging the expression, we get,x3+y3≥x2y+y2x
which is true by Rearrangement Inequality
Hence proved.
Log in to reply
Can you write the equality cases for Case 2?
Log in to reply
I don't think equality exists . . .
Log in to reply
Problem 8
For positive reals a,b,c, prove that (a+b1+b+c1)(b+c1+c+a1)(c+a1+a+b1)≤abc1
Log in to reply
Solution to Problem 8
I used a massive expansion, but I've triple-checked so its right (If you haven't figured it out, expansion is what I do with inequalities). We have to prove
(a+b1+b+c1)(b+c1+c+a1)(c+a1+a+b1)≤abc1
((a+b)(b+c)a+2b+c)((b+c)(c+a)b+2c+a)((c+a)(a+b)c+2a+b)≤abc1
Simplifying the denominators, we have
abc(a+2b+c)(b+2c+a)(c+2a+b)≤(a+b)2(b+c)2(c+a)2
Simplifying all the brackets, we get
2a4bc+2ab4c+2abc4+7a3b2c+7a3bc2+7a2b3c+7ab3c2+7a2bc3+7ab2c3+16a2b2c2≤2a4bc+2ab4c+2abc4+6a3b2c+6a3bc2+6a2b3c+6ab3c2+6a2bc3+6ab2c3+10a2b2c2+a4b2+a4c2+b4a2+b4c2+c4a2+c4b2+2a3b3+2b3c3+2c3a3
Simplifying, we get
a3b2c+a3bc2+a2b3c+ab3c2+a2bc3+ab2c3+6a2b2c2≤a4b2+a4c2+b4a2+b4c2+c4a2+c4b2+2a3b3+2b3c3+2c3a3
By AM - GM, we have
2a4c2+a2b4≥a3b2c,2a4b2+a2c4≥a3bc2,2b4c2+b2a4≥a2b3c
2b4a2+b2c4≥ab3c2,2c4b2+c2a4≥a2bc3,2c4a2+c2b4≥ab2c3
a3b3+b3c3+c3a3≥3a2b2c2⇒2a3b3+2b3c3+2c3a3≥6a2b2c2
Summing these, we get the expansion above. Thus, the statement is true.
Log in to reply
Consider this:
We just need to prove (a+bb+b+cb)(b+cc+c+ac)(c+aa+a+ba)≤1 However by AM-GM LHS≤⎝⎛a+bb+b+cb+b+cc+c+ac+c+aa+a+ba3⎠⎞3=1 A beautiful solution, not by me :P
Log in to reply
Problem 3
Prove the following inequality if a,b,c are positive reals and a+b+c+abc=4 ,
(1+ba+ac)(1+cb+ba)(1+ac+cb)≥27
Pakistan Round 1-2016
Log in to reply
Problem 6 :
Let x>y>z be positive reals greater than one.
Prove that cyc∑x37>cyc∑x2y31
Log in to reply
Solution 6: Thank You @Harsh Shrivastava,
Since we are given x,y,z∈R+ and x>y>z.
We have two sets x2>y2>z2 and x31>y31>z31.
By rearrangement inequality we have
x2x31+y2y31+z3z31>x2y31+y2z31+z2x31∴cyclic ∑x37> cyclic ∑x2y31
Now my time to post questions!! Harsh By the way how did you thought of this?
Log in to reply
Problem 13
Given that a,b,c are non-negative reals satisfying a+b+c=1, prove that (1−a)(1−b)(1−c)≤277+abc
Log in to reply
Solution to Problem 13
I expanded (once more) to get a solution.
Replace (1−a),(1−b),(1−c) with (b+c),(c+a),(a+b) in the in equation to get:
(a+b)(b+c)(c+a)≤277+abc
Expanding and simplifying, we get
a2b+a2c+b2a+b2c+c2a+c2b+abc≤277
Removing the denominator, we get
27a2b+27a2c+27b2a+27b2c+27c2a+27c2b+27abc≤7
Homogenising the RHS, we get
27a2b+27a2c+27b2a+27b2c+27c2a+27c2b+27abc≤7(a+b+c)3
27a2b+27a2c+27b2a+27b2c+27c2a+27c2b+27abc≤7a3+7b3+7c3+21a2b+21a2c+21b2a+21b2c+21c2a+21c2b+42abc
6a2b+6a2c+6b2a+6b2c+6c2a+6c2b≤7a3+7b3+7c3+15abc
a2(b+c)+b2(a+c)+c2(a+b)≤67a3+67b3+67c3+25abc
Note that by Schur's, a2(b+c)+b2(a+c)+c2(a+b)≤a3+b3+c3+3abc. We will prove the sharper inequality:
a3+b3+c3+3abc≤67a3+67b3+67c3+25abc
6a3+6b3+6c3+18abc≤7a3+7b3+7c3+15abc
3abc≤a3+b3+c3
Which is obviously true by AM-GM. Thus, proven.
Log in to reply
Note that this problem is actually equivalent to IMO 1984 #1.
Extension: can you find the best constants for the RHS?
Log in to reply
Problem 5
Let x, y, z be positive reals such that xyz=1. Show that
(x+1)2+y2+12+(y+1)2+z2+12+(z+1)2+x2+12≤1
Log in to reply
Solution 5 :
(x−y)2≥0
⟹x2+y2≥2xy
Adding 2x+2 on both sides, x2+y2+2x+2≥2xy+2x+2
⟹xy+x+11≥x2+y2+2x+22
⟹xy+x+11≥(x+1)2+y2+12
Similarly , yz+y+11≥(y+1)2+z2+12 and zx+z+11≥(z+1)2+x2+12
Adding the three inequalities, we get (x+1)2+y2+12+(y+1)2+z2+12+(z+1)2+x2+12≤yz+y+11+xy+x+11+xz+z+11
Since yz+y+11+xy+x+11+xz+z+11=1, the result is evident.
Log in to reply
Problem 14
Show that for non-negative real x, y and z,
2x3(x3+8y3)+2y3(y3+8z3)+2z3(z3+8x3)≥9x4(y2+z2)+9y4(z2+x2)+9z4(x2+y2)
Log in to reply
SOLUTION OF PROBLEM 14 LHS−RHS=cyc∑(x−y)4(x2+4xy+y2)≥0 Hence proved
Log in to reply
@Chris Galanis Can you please tell how you came up with that factorization?
Log in to reply
LHS−RHS≥0. Since x,y,z are non negative I expect all the negative terms to form a square. In particular I tried to find pattern like a2−2ab+b2 (which is (a−b)2) or a4−4a3b+6a2b2−4ab3+b4 (which is (a−b)4). Just that
Actually when I solve inequalities this way I expectLog in to reply
Log in to reply
Problem 25
For the positive real numbers a,b,c prove that: b(a+b)1+c(b+c)1+a(c+a)1≥2(a+b+c)227
Log in to reply
Solution to Problem 25
This solution is quite long and extremely bashy. Sorry. :P
We have to prove
cyc∑b(a+b)1≥2(a+b+c)227
Multiplying out the denominators and simplifying (here is the bash, but I have suppressed it), we get
cyc∑2a5b+6a4b2+2a2b4+6a3b3+8a4bc≥cyc∑7a3b2c+9a3bc2+8a2b2c2
By AM-GM, we have
7a5b+a4b2+c4a2+a2b4+a2b4+a3b3+a3c3≥7a21b14c7
9a5b+a4b2+c4a2+c4a2+c4a2+a3b3+a3b3+a3c3+a3c3≥9a27b9c18
38a4bc+8ab4c+8abc4≥324a6b6c6
These inequations imply
a5b+a4b2+c4a2+2a2b4+a3b3+a3c3≥7a3b2c
a5b+a4b2+3c4a2+2a3b3+2a3c3≥9a3bc2
8a4bc+8ab4c+8abc4≥24a2b2c2
Adding the first two equations cyclicly, then adding the third equation, we get the statement we wished to prove. Thus proven!
PS: It took me hours to get the right grouping of terms for the AM-GM.
Log in to reply
You could have grouped them by triples of powers that majorize each other, and then applied AM-GM... Saves you all the time of finding your own grouping ;)
Log in to reply
PROBLEM 2 :
Let a,b and c be non-negative reals such that a+b+c=1.
Show that 1+6abc≥41+3(a+b)(b+c)(c+a)
Log in to reply
Homogenizing and expanding gives a3+b3+c3+6abc≥a2b+ab2+b2c+bc2+c2a+ca2 which is just Schur.
Log in to reply
Solution Problem 2:
1+6abc≥41+3(1−a)(1−b)(1−c)
1+6abc≥41+3(1−(a+b+c)+∑cycab−abc)
1+6abc≥41+3(∑cycab−abc)
43+9abc≥3×∑cycab
41+3abc−∑cycab≥0
1+12abc≥4∑cycab
(a+b+c)3+12abc≥∑cycab
a3+b3+c3+6abc≥∑syma2b
This is schurs inequality.
Log in to reply
How did you use ab+bc+ca≤31 on 1+12abc≥4(ab+bc+ca) to get abc≥0?
Log in to reply
Some of you might have seen this but still answer me.
Problem 7
Let a,b,c be positive real numbers such that a1+b1+c1=a+b+c. Prove that
(2a+b+c)21+(2b+c+a)21+(2c+a+b)21≤163
Log in to reply
Solution to Problem 7
By AM-GM (2a+b+c)21≤4(a+b)(a+c)1 and thus it remains to prove cyc∑(a+b)(a+c)1≤43 Clearing denominators, it remains to prove 8(a+b+c)≤3(a+b)(b+c)(c+a) and after homogenizing this becomes 8abc(a+b+c)2≤3(ab+bc+ca)(a+b)(b+c)(c+a) which after expansion and simplification is 3sym∑a3b2≥sym∑a3bc+2sym∑a2b2c which is true by Muirhead.
Log in to reply
Problem 10
Given that a2,a3,…,an is a permutation of {2,3,…,n}, prove that (2a2−1)(3a3−1)⋯(nan−1)≥2(n−1)!(n+1)!
Log in to reply
Solution 10 :
Observe that2(n−1)!(n+1)!=(n2−1)((n−1)2−1)⋯(32−1)(22−1)
So now the inequality becomes (2a2−1)(3a3−1)⋯(nan−1)≥(n2−1)((n−1)2−1)⋯(32−1)(22−1)
This can be proven by applying Reverse Rearrangement Inequality on the sets X:(a2−1),(a3−1)⋯,(an−1) and Y:(1×a2),(2×a3),(3×a4)⋯,((n−1)×an).
X,Y will be similarly ordered when ak=k.
So applying Reverse Rearrangement Inequality (Random Sum Product > Similar ordered Product), i=2∏n(Xi+Yi)≥i=2∏n(i2−1)
Log in to reply
PROBLEM 12
If a,b,c,d are positive reals such that abcd=1, prove that (1+a)(1+a2)1+(1+b)(1+b2)1+(1+c)(1+c2)1+(1+d)(1+d2)1≥1
Log in to reply
Problem 15
Let x1,x2,x3,…,xm>1 ,where m∈N+, be positive integers such that xj<xj+1 (1≤j<m).
Prove that i=1∑mxi31<1
Log in to reply
Another interesting solution.
We got xi≥i+1⇔xi31≤(i+1)31<(i+1)21<i(i+1)1=i1−i+11⇔xi31<i1−i+11(∗) Thus taking the sum for i=1 until i=m: i=1∑mxi31<(∗)i=1∑mi1−i+11=1−m+11<1 Since i=1∑mi1−i+11 is a telescoping series. Hence proved
Log in to reply
i=1∑mxi31<∫i=1∞x31 dx=21<1
Log in to reply
Problem 23
Find the greatest positive real number k, for which is true that (x2+y2)(3x2+y2)xy≤k1 for all positive real numbers x,y.
Log in to reply
Log in to reply
@Chris Galanis, @Sualeh Asif, @Daniel Liu, @Sharky Kesa, @Harsh Shrivastava, @Svatejas Shivakumar. Thanks everyone fit making this such a beautiful contest, hope it went on! For season 2 I will be the organiser, comment please for it.
Log in to reply
Sure!
Log in to reply
More than welcome :)
Log in to reply
Waiting forit to begin...
Log in to reply
Problem 11 :
If a,b,c are positive real numbers that satisfy a+b+c=1, prove that a+bc+b+ac+c+ba≤2
Log in to reply
SOLUTION OF PROBLEM 11
(a+b+c)2=a2+b2+c2+2(ab+bc+ca)=1 or ab+bc+ca≤31 Sincea2+b2+c2≥ab+bc+ca
Now, by Cauchy-Schwarz inequality ((a+bc)2+(b+ac)2+(c+ba)2)(1+1+1)≥a+bc+b+ac+c+ba or 3+3(ab+bc+ca)≥a+bc+b+ac+c+ba
Now 3+3(ab+bc+ca)≤2 since ab+bc+ca≤31. Hence a+bc+b+ac+c+ba≤2.
Equality holds when a=b=c=31. Hence proved.
Log in to reply
Can you please elaborate more on how you applied Cauchy-Schwarz here?
Log in to reply
a+bc,b+ac,c+ba and (1,1,1) then, taking square root on both sides.
It's a just applying Cauchy-Schwarz withLog in to reply
Problem 16
For positive reals a,b,c, prove a2+8bca+b2+8cab+c2+8abc≥1.
Source: ISL
Log in to reply
Solution to Problem 16
I used Jensen's Inequality to solve this problem.
Apply Jensen's on the convex function
f(x)=x1
and weights a, b, c in the following way.
a+b+ca f(a2+8bc)+b f(b2+8ca)+c f(c2+8ab)≥f(a+b+ca(a2+8bc)+b(b2+8ca)+c(c2+8ab))
This may be rewritten as
a2+8bca+b2+8cab+c2+8ab