Find the largest constant k such that
a + b + c k a b c ≤ ( a + b ) 2 + ( a + b + 4 c ) 2
holds for all positive real numbers 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.
Can you explain how you got 2 1 4 in the denominator of the first part in the last line.
Log in to reply
Oh ya oops. Thanks for pointing it out. It was typo on my part :/
Amazing solution kerja yang baik solved the same way.
What is the guarantee that minimal value of the expression is attained when a = b = 2 c ?
if a , b , c > 0 ,I have answer k ≤ 1 0 0
since Use AM-GM inequality we have ( a + b ) 2 + ( a + b + 4 c ) 2 = ( a + b ) 2 + [ ( a + 2 c ) + ( b + 2 c ) ] 2 ≥ ( 2 a b ) 2 + ( 2 2 a c + 2 2 b c ) 2 = 4 a b + 8 a c + 8 b c + 1 6 c a b so a b c ( a + b ) 2 + ( a + b + 4 c ) 2 ≥ 8 ( 2 c 1 + b 1 + a 1 + a b 1 + a b 1 ) a + b + c = 2 a + 2 a + 2 b + 2 b + c so use AM-GM inequality we have a b c ( a + b ) 2 + ( a + b + 4 c ) 2 ( a + b + c ) ≥ 8 ( 5 5 2 a 2 b 2 c 1 ) ( 5 5 2 4 a 2 b 2 c ) = 1 0 0 if and only if a = b = 2 c
Another solution:
We can assume that:
a
+
b
+
c
=
1
(WLOG)
And use AM-GM:
a
b
≤
4
(
a
+
b
)
2
=
4
(
1
−
c
)
2
Hence:
k
≤
4
c
(
1
−
c
)
2
(
1
−
c
)
2
+
(
1
+
3
c
)
2
=
f
(
c
)
with (0<c<1)
Not too difficult, we have
min f(c) = 100 at c = 0.2
So
max k = 100.
If a=b=c=1 would k not be 120?
Log in to reply
I agree with max.
But it needs to hold for all positive real numbers a , b , c .
Log in to reply
Exactly. You never specified they had to be different. 1 is a positive real number
Log in to reply
@Max Colla – My point is that if you take for instance a = 2 = b and c = 1 then 2 + 2 + 1 1 2 0 × 2 × 2 × 1 = 9 6 ≤ ( 2 + 2 ) 2 + ( 2 + 2 + 2 ) 2 = 5 2 is false.
Why can you assume that a + b + c = 1?
Log in to reply
Yep, both sides are homogeneous: that means f ( a , b , c ) = f ( m a , m b , m c ) . Thus, if a + b + c = n , you can consider f ( n a , n b , n c ) . Eventually, you rename variables.
An easy way to solve the problem is first rearrange a bit, K<= a+b+c/abc *(a+b)^2 +(a+b+4c)^2 Now, as we can see that in rhs a+b+c/abc is increases if a,b,c all are less than one and the other term has least value equal to 0 but in that case any of one guy must be zero which is not possible so the minima of the rhs will occur when a=b as by symmetry a,b hold same position then pit c=xa and find the value of x so that rhs is minimum , u will get x= 1/2..
Problem Loading...
Note Loading...
Set Loading...
Key Technique: Examine the equality case.
The main idea here is the asymmetric factor . It is considerably motivated to break up the term 4 c among a and b somehow to make stuff a bit more "even out" so to speak. So we suspect that equality is when a = b = 2 c which gives us k = 1 0 0 .
This equality case resembles that of AM-GM . Part of our strategy is to break up 4 c as in the equality case. So we proceed as follows.
a b c a + b + c × [ ( a + b ) 2 + ( a + b + 4 c ) 2 ]
= a b c a + b + c × [ ( a + b ) 2 + ( a + 2 c + b + 2 c ) 2 ]
≥ a b c a + b + c × [ 4 a b + ( 2 2 a c + 2 2 b c ) 2 ]
= a b c a + b + c × [ 4 a b + 8 a c + 8 b c + 1 6 a c × c ]
= ( a + b + c ) ( c 4 + a 8 + b 8 + a b 1 6 )
Up till now we will notice that the variables on the denominator do not immediately cancel out if we just whack AM-GM straight . One way to remedy this is to break up the terms further . Since the numerator involve powers of 2 , we break stuff up into halves . We are also motivated to break things up into 5 parts to create the factors of 5 in the equality case when k = 1 0 0 .
= ( 2 a + 2 a + 2 b + 2 b + c ) ( c 4 + a 8 + b 8 + a b 8 + a b 8 )
≥ ( 5 5 2 4 a 2 b 2 c ) × ( 5 5 a 2 b 2 c 2 1 4 )
= 1 0 0