If a 2 + b 2 + c 2 + a 2 1 + b 2 1 + c 2 1 = 6 , find the smallest possible value of a 3 + b 3 + c 3 .
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 is much clearer than using AM-GM and more intuitive.
Log in to reply
Guillermo used a more advanced approach! Appreciate that too!
1 It has to be a , b , c = 0 , then applying AM- GM inequality 6 a 2 + b 2 + c 2 + a − 2 + b − 2 + c − 2 ≥ ( a 2 ⋅ b 2 ⋅ c 2 ⋅ a − 2 ⋅ b − 2 ⋅ c − 2 ) 6 1 = 1 ⇒ the equality is only possible if and only if a 2 = b 2 = c 2 = a − 2 = b − 2 = c − 2 = 1 and this is only possible if and only if a , b , c = ± 1 . Hence, the minimum of a 3 + b 3 + c 3 = − 3 .
2 Let f be the function f : R − { 0 } ⟶ R such that f ( x ) = x 2 + x 2 1 . This function reaches the minimum as x = ± 1 making the first derivative and seeing that f ′ ( ± 1 ) = 0 and its second derivative at these points is greater than 0. Thereforeore, f ( x ) ≥ f ( ± 1 ) = 2 and a 2 + b 2 + c 2 + a − 2 + b − 2 + c − 2 = 6 ⟺ a 2 = b 2 = c 2 = a − 2 = b − 2 = c − 2 = 1 . Hence, the minimum of a 3 + b 3 + c 3 = − 3 .
3 Applying method of Lagrange multipliers. Exercise for the reader.
4 ( x − x 1 ) 2 ≥ 0 ⟺ x 2 − 2 + x 2 1 ≥ 0 ⟺ x 2 + x 2 1 ≥ 2 . . .
Problem Loading...
Note Loading...
Set Loading...
Please realize that this can be rewritten as ( a − a 1 ) 2 + ( b − b 1 ) 2 + ( c − c 1 ) 2 = 0