Given positive real numbers x , y , and z such that
x y z − x − y − z = 2 ,
find the minimum possible value of x 1 + y 1 + z 1 .
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.
Ya, I too did it the same way.. nice!!
It can be shown that ( x , y , z ) = ( c a + b , a b + c , b c + a ) , for some positive real numbers a , b , and c . Thus,
x 1 + y 1 + z 1 = a + b c + b + c a + c + a b ≥ 1 . 5
What do you mean by "it can be shown;" do you have proof? What even is your justification for the final step? Nesbitt's Inequality?
Problem Loading...
Note Loading...
Set Loading...
We can rewrite the given equation as xyz-(x+y+z)=2.
The AM-GM inequality gives us 3 x + y + z = 3 x y z .
Equality occurs only when x=y=z.
We can now solve for x in x 3 − 3 x − 2 = 0 which factors to give us ( x + 1 ) 2 ( x − 2 ) .
Now since x, y, and z are positive, x = 2 is the only valid solution.
This gives us 0 . 5 ⋅ 3 = 1 . 5 as the answer.