x y z + y z x + z x y
Let x , y and z be positive reals such that x + y + z = 9 1 , find the minimum of the expression above.
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 apologize for the argument earlier. My approach seems to be wrong according. I am sorry.
As with all questions about minimum, other than establishing that we have a lower bound, we should also show that this lower bound can indeed be achieved. For example, while it is true that each term is ≥ 0 , we do not say that since x y z + y z x + z x y ≥ 0 , hence the minimum is 0 (because it cannot be achieved).
If X,y,z = equals 30,30,31 respectively we will find the results 89.06 less than the minimum limit as your example 91. Your answer is not accurate.
Log in to reply
With those numbers, I get a sum of 91.03.
Can you recheck your calculations?
Relevant wiki: Rearrangement Inequality
∑ c y c z x y ≥ ∑ c y c y x y = x + y + z = 9 1 rearrangement inequality
As with all questions about minimum, other than establishing that we have a lower bound, we should also show that this lower bound can indeed be achieved. For example, while it is true that each term is ≥ 0 , we do not say that since x y z + y z x + z x y ≥ 0 , hence the minimum is 0 (because it cannot be achieved).
Note that ( a − b ) 2 + ( b − c ) 2 + ( c − a ) 2 ≥ 0 ⟹ a 2 + b 2 + c 2 ≥ a b + b c + c a From this we can discern ( a + b + c ) 2 ≥ 3 ( a b + b c + c a ) ( 1 ) 3 ( a 2 + b 2 + c 2 ) ≥ ( a + b + c ) 2 ( 2 )
If a = z x y , b = x y z , c = y z x , then note that from (1) and (2)
( c y c ∑ z x y ) 2 ≥ 3 ( c y c ∑ x 2 ) ≥ ( x + y + z ) 2
From this, we have that the following inequality holds with equality when x = y = z . c y c ∑ z x y ≥ 9 1
As with all questions about minimum, other than establishing that we have a lower bound, we should also show that this lower bound can indeed be achieved. For example, while it is true that each term is ≥ 0 , we do not say that since x y z + y z x + z x y ≥ 0 , hence the minimum is 0 (because it cannot be achieved).
Problem Loading...
Note Loading...
Set Loading...
Applying AM-GM inequality , we have:
x y z + y z x ≥ 2 z
y z x + z x y ≥ 2 x
z x y + x y z ≥ 2 y
Therefore, adding these inequalities up gives z x y + x y z + y z x ≥ x + y + z = 9 1 .