S = x 2 + y 2 1 + y 2 + z 2 1 + z 2 + x 2 1
Given that x , y and z are non-zero reals. Let the minimum value of S be S min . Find ( S min ) 2 .
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.
Nice... Did other way reaches at same answer.
I see a good application of Jensen's Inequality followed by AM-GM.
How does your answer follow from
https://brilliant.org/discussions/thread/proof-of-minkowskis-inequality/
Problem Loading...
Note Loading...
Set Loading...
Call the expression P, we can apply Minkowski Inequality directly P ≥ ( x + y + z ) 2 + ( x 1 + y 1 + z 1 ) 2 By Titu's Lemma x 1 + y 1 + z 1 ≥ x + y + z 9 ∴ P ≥ ( x + y + z ) 2 + ( x + y + z ) 2 9 2 ≥ 1 8 ( B y A M − G M ) So S m i n 2 = 1 8 , the equality holds when a = b = c = ± 1