Let a , b and c be positive real numbers satisfying a + b + c = 9 . Find the maximum value of a b + a c + 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.
Relevant wiki: Trivial Inequality
Firstly note that a 2 + b 2 + c 2 ≥ a b + b c + c a .
Since a + b + c = 9 ⟹ a 2 + b 2 + c 2 = 8 1 − 2 ( a b + b c + c a ) .
Thus a 2 + b 2 + c 2 = 8 1 − 2 ( a b + b c + c a ) ≥ a b + b c + c a ⟹ 2 7 ≥ a b + b c + c a .
Lemma: a 2 + b 2 + c 2 ≥ a b + a c + b c ( ∗ )
Proofs:
There are many proofs of this inequality,I shall provide three of them.
Proof 1: Consider the following inequalities: a 2 + b 2 b 2 + c 2 c 2 + a 2 ≥ AM-GM 2 a b ≥ AM-GM 2 b c ≥ AM-GM 2 c a Adding all these,we get: 2 ( a 2 + b 2 + c 2 ) ≥ 2 ( a b + a c + b c ) ⟹ a 2 + b 2 + c 2 ≥ a b + a c + b c
Proof 2:
Since a , b , c are positive reals,and because the inequality is symmetric,we can assume WLOG that a ≥ b ≥ c .Then we have,by the Rearrangment Inequality: a × a + b × b + c × c ≥ a × b + b × c + c × a ⟹ a 2 + b 2 + c 2 ≥ a b + a c + b c
Proof 3: Multiplying ( ∗ ) by 2,we get: 2 a 2 + 2 b 2 + 2 c 2 ≥ 2 a b + 2 b c + 2 a c ( a 2 − 2 a b + b 2 ) + ( b 2 − 2 b c + c 2 ) + ( c 2 − 2 a c + a 2 ) ≥ 0 ( a − b ) 2 + ( b − c ) 2 + ( c − a ) 2 ≥ 0 Which is true by the Trivial Inequality.
Returning to our original problem, notice that: ( a + b + c ) 2 = 9 2 ⟹ a 2 + b 2 + c 2 = 8 1 − 2 ( a b + a c + b c ) Plugging this in ( ∗ ) ,we get: a 2 + b 2 + c 2 ≥ a b + a c + b c ⟹ 8 1 − 2 ( a b + a c + b c ) ≥ a b + a c + b c ⟹ a b + a c + b c ≤ 2 7 Equality occurs as a = b = c = 3
Relevant wiki: Cauchy-Schwarz Inequality
Using Cauchy-Schwarz inequality , we have:
( a b + b c + c a ) 2 ⟹ a b + b c + c a a b + b c + c a 3 ( a b + b c + c a ) a b + b c + c a ≤ ( a 2 + b 2 + c 2 ) ( a 2 + b 2 + c 2 ) ≤ a 2 + b 2 + c 2 Equality occurs when a = b = c = 3 ≤ ( a + b + c ) 2 − 2 ( a b + b c + c a ) ≤ ( a + b + c ) 2 ≤ 3 1 ( a + b + c ) 2 = 3 8 1 = 2 7
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Lagrange Multipliers
Target Function : f ( a , b , c ) = a b + b c + c a subject to constraint a + b + c = 9 .
We have L f ( a , b , c , λ ) = a b + b c + c a − λ ( a + b + c − 9 )
Evaluating the partial derivatives we get the four equations :
⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ b + c = λ c + a = λ a + b = λ a + b + c = 9 , Solving we get a = b = c = 3 .
If we end it here it is incomplete, we must determine what the critical points leads us to, a maxima,minima or saddle point.
Taking the Hessian Matrix of L f ( a , b , c , λ ) we see,
Δ = ⎝ ⎜ ⎜ ⎛ 0 1 1 1 1 0 1 1 1 1 0 1 − 1 − 1 − 1 0 ⎠ ⎟ ⎟ ⎞ which is Negative definite matrix . Since Δ < 0 so f ( a , b , c ) attains it's maximum at ( a , b , c ) = ( 3 , 3 , 3 )
So, f max ( a , b , c ) = 2 7