cyc ∑ b c + 1 a Let a , b and c be positive reals satisfying a + b + c = 3 .
Find the minimum value of the expression above.
Bonus : Find as many approaches as possible
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.
We can rewrite it as :
a b c + a a 2 + a b c + b b 2 + a b c + c c 2 Call it S .
By Titu's Lemma ,
S ≥ 3 a b c + a + b + c ( a + b + c ) 2 = 3 a b c + 3 9 = a b c + 1 3 .
By AM - GM Inequality , we have ,
a + b + c ≥ 3 ⋅ 3 a b c
⇒ 1 ≥ a b c ⇒ 2 ≥ a b c + 1 ⇒ 3 2 ≥ 3 a b c + 1
⇒ 2 3 ≤ a b c + 1 3
Therefore , S ≥ 2 3
Equality holds when a = b = c = 1
That's a great application of Titu's Lemma. For inequalities involving fractions, it often helps to "standardize" the terms while making the numerator a perfect square, so that we can apply Titu.
Nice solution! +1
Did the same
@Calvin Lin Sir, now that I am quite acquainted with LATEX , shall I remove the pic and write it in LATEX code ?
Log in to reply
Yes please. Thanks!
Here's my U.C.T approach c y c ∑ a , b , c b c + 1 a ≥ AM-GM c y c ∑ a , b , c 4 ( b + c ) 2 + 1 a = c y c ∑ a , b , c ( 3 − a ) 2 + 4 4 a = c y c ∑ a , b , c a 2 − 6 a + 1 3 4 a Now we must prove that a 2 − 6 a + 1 3 4 a ≥ 2 1 + 2 3 ( a − 1 ) ⇔ a 2 − 6 a + 1 3 − ( a − 1 ) 2 ( 3 a − 1 3 ) ≥ 0 ( T r u e f o r e v e r y 0 < x < 3 ) Proving the similar for b 2 − 6 b + 1 3 4 b and c 2 − 6 c + 1 3 4 c then combine all 3 inequalities we get c y c ∑ a , b , c b c + 1 a ≥ c y c ∑ a , b , c a 2 − 6 a + 1 3 4 a ≥ 2 3 So the minimum value is 2 3 = 1 . 5 0 , the equality holds when a = b = c = 1
How do know that a 2 − 6 a + 1 3 4 a ≥ 2 1 + 2 3 ( a − 1 ) in the first place?
Log in to reply
I predict that the equality case happens at a = b = c = 1 , so I replace a = 1 in to the L H S and get 2 1 , proving L S H ≥ 2 1 would be impossible since it gives you a 2 − 6 a + 1 3 − ( a − 1 ) ( a − 1 3 ) ≥ 0 which is not always true with a ∈ ( 0 ; 3 ) . So now I need to choose 2 number m , n that satisfy L H S ≥ 2 1 + m a + n Doing the same with b , c then combine all the inequalities we get c y c ∑ a , b , c a 2 − 6 a + 1 3 4 a ≥ 2 3 + m ( a + b + c ) + 3 n = 2 3 + 3 ( m + n ) We need 3 ( m + n ) = 0 ⇒ m = − n , Replace this into the inequality above and we get this a 2 − 6 a + 1 3 4 a ≥ 2 1 + m ( a − 1 ) ⇔ − ( a − 1 ) ( a 2 − 6 a + 1 3 a − 1 3 + m ) ≥ 0 To create ( a − 1 ) 2 on the L H S , we plug a = 1 into a 2 − 6 a + 1 3 a − 1 3 = 2 − 3 , so m = 2 3 ∴ a 2 − 6 a + 1 3 4 a ≥ 2 1 + 2 3 ( a − 1 )
What U.C.T stands for ?
Log in to reply
Undefined coefficient technique
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Classical Inequalities - Problem Solving - Intermediate
cyc ∑ a , b , c b c + 1 a = cyc ∑ a , b , c a b c + a a 2 ≥ Titu’s Lemma 3 a b c + ( a + b + c ) ( a + b + c ) 2 cyc ∑ a , b , c b c + 1 a ≥ a b c + 1 3 Now: 3 a + b + c ⟹ a b c + 1 a b c + 1 3 ⟹ a b c + 1 3 ≥ AM-GM 3 a b c ≤ ( 3 a + b + c ) 3 + 1 ≥ ( 3 a + b + c ) 3 + 1 1 ≥ 2 3 Equality occurs when a = b = c