{ 3 ( x 2 + y 2 + z 2 ) = 1 x 2 y 2 + y 2 z 2 + z 2 x 2 = x y z ( x + y + z ) 3 .
Find the number of ordered real triples x , y , z satisfying the system of equations 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.
Hey you missed a thing here.how the permutations all can be solutions only the all positive and all negative will do.but the rest 6 are rather cyclic permutations of (-1/√3,0,0) which is 3 and (+1/√3,0,0) which is 3.so total 2+3+3=8
is there another way?
Problem Loading...
Note Loading...
Set Loading...
Relevant wiki: Lagrange Multipliers
We treat the first equation as a constraint only, By AM-GM 2 7 x y z ( x + y + z ) 3 ≤ ( x + y + z ) 6 but 3 ( x 2 + y 2 + z 2 ) ≥ ( x + y + z ) 2 . Since we are given that 3 ( x 2 + y 2 + z 2 ) = 1 we claim ( x + y + z ) 6 ≤ 1 .
So, x y z ( x + y + z ) 3 ≤ 2 7 1 . Now consider the expression x y z ( x + y + z ) 3 x 2 y 2 + y 2 z 2 + z 2 x 2 ≥ 2 7 ( x 2 y 2 + y 2 z 2 + z 2 x 2 )
We need to minimize this with the constraint 3 ( x 2 + y 2 + z 2 ) = 1 . Set x 2 ≡ a , y 2 ≡ b , z 2 ≡ c
If we define the lagrangian as L λ ( a , b , c ) = a b + b c + c a + λ ( 3 ( a + b + c ) − 1 )
Solving the partial derivatives gives a = b = c = 9 1 . And by using Hessian matrix we are sure that it's a minimum. The minimum is 1
So, x y z ( x + y + z ) 3 x 2 y 2 + y 2 z 2 + z 2 x 2 ≥ 2 7 ( x 2 y 2 + y 2 z 2 + z 2 x 2 ) ≥ 1 but here have x y z ( x + y + z ) 3 x 2 y 2 + y 2 z 2 + z 2 x 2 ≥ 2 7 ( x 2 y 2 + y 2 z 2 + z 2 x 2 ) = 1 so equality holds and we must have,
x = y = z = ± 3 1 and solutions.