Real numbers x , y , and z are such that x + y + z = 1 . Find the minimum value of
1 + x 2 x 2 + 1 + y 2 y 2 + 1 + z 2 z 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.
We note that f ( x ) = 1 + x 2 x 2 is convex within x ∈ [ 0 , 1 ] . By Jensen's inequality ,
3 1 ( 1 + x 2 x 2 + 1 + y 2 y 2 + 1 + z 2 z 2 ) ⟹ 1 + x 2 x 2 + 1 + y 2 y 2 + 1 + z 2 z 2 ≥ 1 + ( 3 x + y + z ) 2 ( 3 x + y + z ) 2 = 1 + 9 1 9 1 = 1 0 1 ≥ 1 0 3 = 0 . 3
Problem Loading...
Note Loading...
Set Loading...
Differenting the given constraint we get d x + d y + d z = 0
For f ( x , y , z ) = 1 + x 2 x 2 + 1 + y 2 y 2 + 1 + z 2 z 2 to be maximum,
( 1 + x 2 ) 2 2 x d x + ( 1 + y 2 ) 2 2 y d y + ( 1 + z 2 ) 2 2 z d z = 0 .
Applying LaGrange's method of undetermined multipliers and using the constraint x + y + z = 1 , we get x = y = z = 3 1
The maximum value of the given expression is 3 × 1 + 9 1 9 1 = 1 0 3 = 0 . 3 .
Solution to this problem :
One obvious number for which n + n − 6 4 is an integer is 6 4 .
For other values, let n = m 2 , where m is an integer. Then
m 2 − 6 4 must be a perfect square, say, p 2 , where p is an integer. So p , 8 , m form a Pythagorean triplet. The primitive one is 8 , 1 5 , 1 7 , while the nonprimitive one is 6 , 8 , 1 0 . So there are two other values of n : 1 7 2 = 2 8 9 and n = 1 0 2 = 1 0 0 .
Therefore in all, there are 3 values of n satisfying the given condition.