For positive real numbers a , b , and c , what is the minimum value of b + c a + c + a b + 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.
This can be proved in a number of ways...including AM-GM, Titu's Lemma , and Jensen's Inequality .
Anyway, excellent use of rearrangement inequality!! :D
Let f ( a , b , c ) = ∑ c y c b + c a
Note that f ( a , b , c ) is homogeneous of degree 0
So,we may assume a + b + c = 1
Hence, f ( a , b , c ) = ∑ c y c b + c a = ∑ c y c ( b + c a + b + c − 1 )
= ∑ c y c a + b 1 − 3 ≥ 2 9 − 3 (By AM-HM)
In many questions sometimes i add 2 inequalities , the answer gets wrong , so when two inequalities can be added?
Log in to reply
I think we can do so when the equality cases are the same...
By Cauchy-Schwarz ,
( ( a + b ) + ( b + c ) + ( c + a ) ) ( a + b 1 + b + c 1 + c + a 1 ) ≥ 9 . Dividing by 2 and subtracting 3 gives the minimum of 1.5 when a = b = c .
Let S = b + c a + c + a b + a + b c
We know that (by AM-GM):
b + c a + b + c + a b + c + a + b c + a ≥ 3 ( b + c a ) + b + c b + ( c + a b ) + c + a c + ( a + b c ) + a + b a ≥ 3 ⇒ S + b + c b + c + a c + a + b a ≥ 3 ⇒ S + ( 1 − b + c c ) + ( 1 − c + a a ) + ( 1 − a + b b ) ≥ 3 ⇒ S − ( b + c c + c + a a + a + b b ) ≥ 0 ⇒ S ≥ b + c c + c + a a + a + b b ⇔ b + c a + c + a b + a + b c ≥ b + c c + c + a a + a + b b I
The minimum occurs when L H S = R H S . We see that the equality case of I is a cyclic equation, from which we deduce that a = b = c
Therefore, the minimum value is:
m i n ( S ) = 2 3
Wonderful solution!
How were you able to deduce a = b = c
Nesbitt's inequality... where k=3/2.
b + c a + c + a b + a + b c + 3 ≥ 2 9 ⇔ 2 ( a + b + c ) ( a + b 1 + b + c 1 + c + a 1 ) ≥ 9 ⇔ ( a + b + b + c + c + a ) ( a + b 1 + b + c 1 + c + a 1 ) ≥ 9 (Always happen)
by AM-GM,
b + c a + c + a b + a + b c ≥ 3 × 3 ( a + b ) ( b + c ) ( c + a ) a b c
The expression is at minimum when a = b = c, therefore 3 × 3 ( a + b ) ( b + c ) ( c + a ) a b c = 3 × 3 ( 2 a ) ( 2 a ) ( 2 a ) a 3 = 3 × 2 1 = 1.5
Starting with b + c a + c + a b + a + b c , if we add and subtract one from each term, we get
b + c a + b + c + c + a a + b + c + a + b a + b + c − 3
= ( a + b + c ) ( b + c 1 + c + a 1 + a + b 1 ) − 3
= 0 . 5 ( ( b + c ) + ( c + a ) + ( a + b ) ) ( b + c 1 + c + a 1 + a + b 1 ) − 3
now applying Cauchy-Schwarz , we get
≥ 0 . 5 ( 3 2 ) − 3
≥ 2 3
Thus, the minimum of the expression is 2 3 .
Problem Loading...
Note Loading...
Set Loading...
Here's one of the way other than using AM-GM .
Let a ≥ b ≥ c , so b + c 1 ≥ a + c 1 ≥ a + b 1 .
Now using the Rearrangement Inequality , we have
b + c a + a + c b + b + a c ≥ b + c b + a + c c + b + a a . . . . . . . . . . ( 1 )
b + c a + a + c b + b + a c ≥ b + c c + a + c a + b + a b . . . . . . . . . . ( 2 )
Add ( 1 ) and ( 2 ) to get
2 ( b + c a + a + c b + b + a c ) ≥ b + c b + c + a + c a + c + b + a a + b
2 ( b + c a + a + c b + b + a c ) ≥ 3
( b + c a + a + c b + b + a c ) ≥ 2 3
with equality occurring where a = b = c .