a b b 2 + 2 a 2 + a c a 2 + 2 c 2 + b c c 2 + 2 b 2
Let a , b and c be positive reals satisfying a b + b c + c a = a b c .
If the minimum value of the expression above can be expressed as m , where m is a positive integer , find m .
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.
i also simplified it first
Obviously, a b + b c + c a = a b c > 0 We have:
S = a b b 2 + 2 a 2 + a c a 2 + 2 c 2 + b c c 2 + 2 b 2 = a b c c b 2 + 2 a 2 + b a 2 + 2 c 2 + a c 2 + 2 b 2 = a b c b 2 c 2 + 2 a 2 c 2 + a 2 b 2 + 2 c 2 b 2 + c 2 a 2 + 2 b 2 a 2 .
Applying the AM-GM inequality yields:
2 ( b 2 c 2 + a 2 c 2 ) ≥ 4 a b c 2 a 2 c 2 + a 2 c 2 = 2 a 2 c 2 ⇒ 2 ( b 2 c 2 + 2 a 2 c 2 ) ≥ 2 a 2 c 2 + 4 a b c 2 ⇒ 3 ( b 2 c 2 + a 2 c 2 + a 2 c 2 ) ≥ b 2 c 2 + a 2 c 2 + a 2 c 2 + 2 a 2 c 2 + 2 a b c 2 + 2 a 2 c 2 + 2 a b c 2 = ( b c + 2 a c ) 2 ⇒ b 2 c 2 + 2 a 2 c 2 ≥ 3 1 ( b c + 2 a c ) 2 ⇒ b 2 c 2 + 2 a 2 c 2 ≥ 3 3 ( b c + 2 a c ) ( b e c a u s e b c + 2 a c > 0 ) S i m i l a r l y , a 2 b 2 + 2 c 2 b 2 ≥ 3 3 ( a b + 2 b c ) c 2 a 2 + 2 b 2 a 2 ≥ 3 3 ( 2 a b + a c ) A d d t h e t h r e e i n e q u a l i t i e s s i d e t o s i d e y i e l d s b 2 c 2 + 2 a 2 c 2 + a 2 b 2 + 2 c 2 b 2 + c 2 a 2 + 2 b 2 a 2 ≥ 3 3 3 ( a b + b c + a c ) = 3 ( a b + b c + a c ) = 3 a b c ⇒ S ≥ a b c 3 a b c = 3 ( a b c > 0 ) E q u a l i t y h a p p e n s w h e n a = b = c = 3 S o m = 3
Good approach.
To shortens the process you can apply Cauchy-Schwarz for the square roots, like this for an example b 2 c 2 + 2 a 2 c 2 = b 2 c 2 + a 2 c 2 + a 2 c 2 ≥ 3 1 ( b c + 2 a c ) 2 ⇒ b 2 c 2 + 2 a 2 c 2 ≥ 3 1 ( b c + 2 a c )
Rewriting the expression into: a 2 1 + b 2 2 + c 2 1 + a 2 2 + b 2 1 + c 2 2 OR a 2 1 + b 2 1 + b 2 1 + c 2 1 + a 2 1 + a 2 1 + b 2 1 + c 2 1 + c 2 1 Rewriting the condition to a 1 + b 1 + c 1 = 1 . According to Cauchy-Schwarz inequality, we may find that ( a 1 + b 1 + b 1 ) 2 ≤ 3 ( a 2 1 + b 2 1 + b 2 1 ) ( c 1 + a 1 + a 1 ) 2 ≤ 3 ( c 2 1 + a 2 1 + a 2 1 ) ( b 1 + c 1 + c 1 ) 2 ≤ 3 ( b 2 1 + c 2 1 + c 2 1 ) OR a 2 1 + b 2 1 + b 2 1 ≥ 3 1 ( a 1 + b 1 + b 1 ) c 2 1 + a 2 1 + a 2 1 ≥ 3 1 ( c 1 + a 1 + a 1 ) b 2 1 + c 2 1 + c 2 1 ≥ 3 1 ( b 1 + c 1 + c 1 )
Applying these to the expression, we get: a 2 1 + b 2 1 + b 2 1 + c 2 1 + a 2 1 + a 2 1 + b 2 1 + c 2 1 + c 2 1 ≥ 3 1 ( a 3 + b 3 + c 3 ) = 3 ( a 1 + b 1 + c 1 ) = 3 which m = 3
awasome better approach
why to do such a large claculation of course that is a formal approach but there is a short trick to as it is mentions a,b,c are the positive real no just try to satisfy the relation a 1 + b 1 + c 1 =1 you will find a=b=c=3
but you do learn the formal because it is more important than since it opens your mind to possiblitys
You have merely found an instance of a , b , c that satisfies the given condition. Why must the maximum/minimum occur at this single instance? There is no justification of the "short trick" here.
You should learn to do the "formal" approach, because it is the correct way.
Why can't we have a = b = 2 c ? You need to prove that a = b = c must hold true for the minimum to occur.
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Hölder's Inequality
Rewrite the expression a 2 1 + b 2 2 + c 2 1 + a 2 2 + b 2 1 + c 2 2 From the condition, we get a 1 + b 1 + c 1 = 1 . So applying Minkowski Inequality a 2 1 + b 2 2 + c 2 1 + a 2 2 + b 2 1 + c 2 2 ≥ 3 ( a 1 + b 1 + c 1 ) 2 = 3 So m = 3 and the equality holds when { 2 a 2 b 2 = 2 c 2 a 2 = 2 b 2 c 2 a 1 + b 1 + c 1 = 1 or a = b = c = 3