Find the minimum value of
z x 2 + y 2 + y z 2 + x 2 + x y 2 + z 2 ,
subject to x + y + z = 2 0 1 5 and x , y , z > 0 .
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.
in 4th line in numerator it should be square of (x+y+z)
z x 2 + y 2 + x y 2 + z 2 + y z 2 + x 2 = x y z x y ( x 2 + y 2 ) + y z ( y 2 + z 2 ) + x z ( z 2 + x 2 ) N o w , x y ( x 2 + y 2 ) ≥ x y ( 2 x y ) = 2 x 2 y 2 S o , z x 2 + y 2 + x y 2 + z 2 + y z 2 + x 2 ≥ x y z 2 x 2 y 2 + 2 y 2 z 2 + 2 z 2 x 2 N o w , 2 x 2 y 2 + 2 y 2 z 2 + 2 z 2 x 2 = ( x 2 y 2 + y 2 z 2 ) + ( z 2 x 2 + x 2 y 2 ) + ( y 2 z 2 + z 2 x 2 ) ≥ 2 ( x 2 y z + x y 2 z + x y z 2 ) = 2 x y z ( x + y + z ) S o , z x 2 + y 2 + x y 2 + z 2 + y z 2 + x 2 ≥ x y z 2 x y z ( x + y + z ) = 2 ( x + y + z ) = 4 0 3 0
This question is taken RMO 2014 Andhra Pradesh region............Slightly edited.
Log in to reply
Will we get full marks for direct applying Titu's Lemma?
Log in to reply
Yes why not depends on the mood of examiner!the minimum u get for this is 14\17
Since this equation is symmetric about x = y = z , I guessed (correctly, apparently), that the mimimum value does in fact lie on x = y = z . Plugging in 3 2 0 1 5 for x, y, and z, the equation simplifies to 2 ∗ 2 0 1 5 = 4 0 3 0 .
It was an extremely lucky guess, though, as this equation could easily have had three (or even six) separate minimum points which evaulate to the same value. That sort of outcome would be more likely for a trig-type equation, though, as those tend to oscillate around the origin in very strange patterns.
I tried solving this before using Lagrange Multipliers, but the equations tried to eat me.
It's a common falacy that minimum occurs when a the terms are equal, and fails more times it works. Be careful while using it in the future. BTW - "equations tried to eat me" xD
First, it's trivial to prove that 2 ( a 2 + b 2 ) ≥ ( a + b ) 2 .
Applying this, we get that z x 2 + y 2 = 2 z 2 ( x 2 + y 2 ) ≥ 2 z ( x + y ) 2
x y 2 + z 2 = 2 x 2 ( y 2 + z 2 ) ≥ 2 x ( y + z ) 2
y z 2 + x 2 = 2 y 2 ( z 2 + x 2 ) ≥ 2 y ( z + x ) 2 .
Also, applying T2's lemma (Titu's lemma), we have that:
2 z ( x + y ) 2 + 2 x ( y + z ) 2 + 2 y ( z + x ) 2 ≥ 2 x + 2 y + 2 z ( x + y + y + z + z + x ) 2 = 2 ( x + y + z ) [ 2 ( x + y + z ) ] 2 = 2 ( x + y + z )
Hence, z x 2 + y 2 + x y 2 + z 2 + y z 2 + x 2 ≥ 2 z ( x + y ) 2 + 2 x ( y + z ) 2 + 2 y ( z + x ) 2 ≥ 2 ( x + y + z ) = 4 0 3 0 .
Well, a few minutes after posting this question, I have an even easier approach to this question using the very same T2's lemma.
z x 2 + y 2 + x y 2 + z 2 + y z 2 + x 2 = z x 2 + z y 2 + x y 2 + x z 2 + y z 2 + y x 2 ≥ z + z + x + x + y + y ( x + y + y + z + z + x ) 2 = 2 ( x + y + z ) = 4 0 3 0 .
And we're done.
Did the same way..
if x+y+z=2015 it should be divided equally. so that, the value of x=2015/3 then we a x=y=z
therefore : (x²+y²)/z + (z²+x²)/y + (y²+z²)/x =[(2015/3)² + (2015/3)²] / (2015/3)=1343.333333 then ; 1343.333333+1343.333333+1343.333333=4030 and (1343.333333)x(3)=4030
How do you know that "it should be divided equally"?
Log in to reply
@Calvin Lin I noticed the following : for any three no. x,y,z such tat x+y+z =a minimum x^2+y^2+z^2 is achieved when the three are equal i.e a/3. Why? Also if x,y,z are integers then we divide them to the three closest no. eg. x+y+z=2015, we take them as 672,672,671 as 2015 is closer to 2016 than to 2013 . Similarly if x+y+z=2014 ,we take them as 671,671,672. as 2014 is closer to 2013 than to 2015. This technique usually does the trick , But why ?
We can apply titu's lemma and solve this question - We can rewrite it and simply use the lemma
It's as easy as realizing the value of x, y, and z and then plugging the numbers in and simplifying. There is no need for the large expression until after you know the numbers.
Because you are looking for the minimum value of the expression, you want x, y, and z to be as large as possible since they will be the denominators (the larger the denominator of a fraction the smaller the value will reduce to).
I simply divided 2015 by 3 , as that will allow for the largest values of each of the 3 variables. So x, y, and z all equal 2015/3.
Next, plug 2015/3 in for all of the variables in the expression and simplify. You get 1343.3333... for each fraction individually and there for 4030 for all 3 added together.
So the answer to the problem is 4030.
The expression may be rewritten as S=x^2/z+x^2/y+... and that sum cyclic. Applyin CS, you obtain S=>{2(x+y+z)=4030
Can you state the CS step? Thanks!
Log in to reply
Sorry , but i did it assuming that x , y , z ∈ R +
Applying titu's leema,
z x 2 + . . . . . . . . . . . ≥ 2 ( x + y + z ) 4 ( x + y + z ) 2
thus,
minimum = 4030. Sir why it happened? what is CS?
Log in to reply
CS is Cauchy Schwarz. Titu's lemma is a lemma of the Cauchy Schwarz Theorem.
What do you mean by "why it happened"?
Log in to reply
@Calvin Lin – Here its not stated that to which set x,y,z belongs , if it belongs to set of real numbers then why considering only the set of positive real numbers it gives minimum
Log in to reply
@U Z – Right. I believe that the condition x , y , z > 0 is necessary, so was looking into that.
With x = x 3 , y = − x , z = 2 0 1 5 , we get the sum to be 2 0 1 5 2 x 2 , which approaches 0 as x appraoches 0. Hence, the condition is needed (and I have added it in).
Problem Loading...
Note Loading...
Set Loading...
The expression can be split and rewritten as:
z x 2 + z y 2 + x y 2 + x z 2 + y z 2 + y x 2
Applying Titu's Lemma Theorem to the above expression, we get:
z x 2 + z y 2 + x y 2 + x z 2 + y z 2 + y x 2 ≥ 2 ( x + y + z ) 4 ( x + y + z )
Solving the above inequality and substituting the value of x + y + z , we get:
z x 2 + y 2 + y z 2 + x 2 + x y 2 + z 2 ≥ 4 0 3 0
Thus, the minimum value of the expression is 4 0 3 0