b ( b + c ) 2 a + c ( c + a ) 2 b + a ( a + b ) 2 c
Let a , b and c be positive reals such that a b + b c + c a = k , where k is a positive real as well.
Let the minimum value of the above expression be y x k z , where x and y are coprime positive integers and z is an integer. Find x + y + z .
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.
By the Cauchy-Schwarz inequality, ⎝ ⎛ ( b ( b + c ) 2 a ) 2 + ( c ( c + a ) 2 b ) 2 + ( a ( a + b ) 2 c ) 2 ⎠ ⎞ ( ( a b ) 2 + ( b c ) 2 + ( c a ) 2 ) ≥ ( b + c a + c + a b + a + b c ) 2 Without loss of generality,let a ≥ b ≥ c .Then b + c 1 ≥ a + c 1 ≥ a + b 1 .
Applying the Rearrangement Inequality to the sequences ( a , b , c ) and ( b + c 1 , a + c 1 , a + b 1 ) ,we get: b + c a + c + a b + a + b c b + c a + c + a b + a + b c ≥ b + c b + c + a c + a + b a → ( 1 ) ≥ b + c c + c + a a + a + b b → ( 2 ) ( 1 ) + ( 2 ) ⟹ 2 ( b + c a + c + a b a + b c ) ≥ b + c b + c + c + a c + a + a + b a + b = 3 ⟹ b + c a + c + a b + a + b c ≥ 2 3 Hence b ( b + c ) 2 a + c ( c + a ) 2 b + a ( a + b ) 2 c ≥ ( 2 3 ) 2 × k − 1 = 4 9 k − 1 .Therefore x = 9 , y = 4 , z = − 1 ⟹ x + y + z = 1 2
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Classical Inequalities - Problem Solving - Intermediate
We will first prove Titu's lemma:
Titu's Lemma : x a 2 + y b 2 ≥ x + y ( a + b ) 2
Multiplying denominators leads to
a 2 y ( x + y ) + b 2 x ( x + y ) a 2 x y + a 2 y 2 + b 2 x 2 + b 2 x y a 2 y 2 + b 2 x 2 − 2 a b x y ( a y − b x ) 2 ≥ ( a + b ) 2 x y ≥ a 2 x y + b 2 x y + 2 a b x y ≥ 0 ≥ 0
The final statement is trivially true, so our lemma must also be true. Thus, proven. Note that we can generalise this to ∑ b i a i 2 ≥ ∑ b i ( ∑ a i ) 2 . The proof for this is not too hard and is left as exercise to the reader.
Note that b ( b + c ) 2 a = a b ( b + c ) 2 a 2 . Substituting this into the original expression for each of the other two parts as well, then applying the lemma, we yield
b ( b + c ) 2 a + c ( c + a ) 2 b + a ( a + b ) 2 c ≥ a b + b c + c a ( b + c a + c + a b + a + b c ) 2 = k ( b + c a + c + a b + a + b c ) 2
We will now prove b + c a + c + a b + a + b c ≥ 2 3 . Note the following:
b + c a + c + a b + a + b c = a b + a c a 2 + b c + a b b 2 + a c + b c c 2 ≥ 2 ( a b + b c + c a ) ( a + b + c ) 2
It suffices to prove 2 ( a b + b c + c a ) ( a + b + c ) 2 ≥ 2 3 , which simplifies to a 2 + b 2 + c 2 ≥ a b + b c + c a , which can be rearranged to ( a − b ) 2 + ( b − c ) 2 + ( c − a ) 2 ≥ 0 , which is trivially true. Thus, b + c a + c + a b + a + b c ≥ 2 3 , so ( b + c a + c + a b + a + b c ) 2 = 4 9 . Thus,
b ( b + c ) 2 a + c ( c + a ) 2 b + a ( a + b ) 2 c ≥ 4 k 9 = 4 9 k − 1
so x = 9 , y = 4 and z = − 1 . Thus, x + y + z = 1 2 .