a , b and c are three positive real numbers such that a + b + c = n .
What is the smallest possible value of n such that
( a b + b c + c a ) ( 2 b + 3 c a + 2 c + 3 a b + 2 a + 3 b c ) ≥ 2 0
for all possible ordered triplets ( a , b , c ) ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Typo there - minimum n is 10. And yes that is the best method to sole it. I gave a rather more complex sol.
Log in to reply
thanks @Kartik Sharma fixed
Post please if you get a chance. Complex solutions may be as well be very inspiring!
Won't we have to consider two cases: one where 5 n 2 ≥ 2 0 and when 2 0 > 5 n 2 ?
Well, it might be easier than thought but I don't know, I made it difficult(my solution would seem to).
First of all, using Re-arrangement inequality,
( 2 b + 3 c a + 2 c + 3 a b + 2 a + 3 b c ) ≥ ( 2 c + 3 a a + 2 a + 3 b b + 2 b + 3 c c )
≥ ( 2 b + 3 c a + 2 c + 3 a b + 2 a + 3 b c )
≥ ( 2 c + 3 a a + 2 b + 3 c b + 2 a + 3 b c )
Adding all these,
3 ( 2 b + 3 c a + 2 c + 3 a b + 2 a + 3 b c ) ≥ ( 2 c + 3 a a + b + c + 2 a + 3 b a + b + c + 2 b + 3 c a + b + c )
≥ ( a + b + c ) ( 2 c + 3 a 1 + 2 b + 3 c 1 + 2 a + 3 b 1 )
Now using Cauchy-Schwarz in Engel form,
( 2 c + 3 a 1 + 2 b + 3 c 1 + 2 a + 3 b 1 ) ≥ 5 ( a + b + c ) 9
Now,
3 ( 2 b + 3 c a + 2 c + 3 a b + 2 a + 3 b c ) ≥ ( a + b + c ) ( 5 ( a + b + c ) 9 ) - (1)
Also,
a b + b c + c a ≥ 3 ( a + b + c ) 2 -(2)
Multiplying (1) and (2) and replacing a + b + c with n
( 2 b + 3 c a + 2 c + 3 a b + 2 a + 3 b c ) ( a b + b c + c a ) ≥ 5 n 2
5 n 2 ≥ 2 0
n ≥ 1 0
Since the given expression is cyclic, we can assume that a = b = c = 3 n .
Substituting this value, the expression is reduced to :
( 9 n 2 + 9 n 2 + 9 n 2 ) ( 5 1 + 5 1 + 5 1 ) ≥ 2 0
= > 3 n 2 ∗ 5 3 ≥ 2 0
= > n 2 ≥ 1 0 0
= > n ≥ 1 0
Thus the minimum value of n is 1 0 .
Note: we cannot assume a = b = c = 3 n just because it is cyclic. There are plenty of inequalities with equality cases that are not when all variables are equal. For example, the maximum value of x 2 y + y 2 z + z 2 x when x + y + z = 3 is not when x = y = z = 1 , it's when x = 2 , y = 1 , z = 0 or cyclic permutations.
Just a comment. The rearrangement inequality cannot be applied here because 2c + 3a is not necessarily greatest than 2a+3b
Problem Loading...
Note Loading...
Set Loading...
Notice ( a b + b c + c a ) ( 2 b + 3 c a + 2 c + 3 a b + 2 a + 3 b c ) = ( a b + b c + c a ) ( 2 a b + 3 c a a 2 + 2 b c + 3 a b b 2 + 2 c a + 3 b c c 2 ) By Titu's Lemma, this is greater than or equal to ≥ ( a b + b c + c a ) ( 5 a b + 5 b c + 5 c a ( a + b + c ) 2 ) = 5 n 2 If this is ≥ 2 0 , then n ≥ 1 0 and the minimum n is 1 0 .