If x , y , z ∈ R are positive, solve { x + y z 1 + z 2 = 3 y + x z 1 = 2
The solutions are ( x 1 , y 1 , z 1 ) , ( x 2 , y 2 , z 2 ) , … , ( x n , y n , z n ) .
Find i = 1 ∑ n ( x i + y i + z i ) .
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.
How does this prove that there are no other solutions other than x = y = z = 1 ?
Log in to reply
We know that x + y z 1 + z 2 + y + x z 1 is equal to its minimum value (we know it equals 5 and by using AM-GM we know that 5 is its minimum value) and that it reaches it if and only if x = y z 1 = z 2 = y = x z 1 , and this holds only if x = y = z = 1 , which works on the initial system of equations.
this is easy method just by inspection
thanks for the hint (AM GM might help!).........else could not have got it!!
Nice problem. Keep that going !! BTW what's your real name ?
please elaborate me how can we say that 5 is its minimum value?
Log in to reply
well, I did show that we know that because of AM-GM (arithmetic-geometric mean)(I wrote this above the inequality sign). 5 x + y z 1 + z 2 + y + x z 1 ≥ AM-GM 5 x ⋅ y z 1 ⋅ z 2 ⋅ y ⋅ x z 1 , and this big expression on the RHS, after some simplifying, is simply equal to 1. Now multiply both sides of the inequality I just wrote in this comment by 5 and you have that the minimum is 5.
From z^5=1 we get 5 solutions,but 4 of them are complex...
Log in to reply
how do you move to complex numbers from the system of equation given
It's given in the problem statement that x , y , z ∈ R are positive.
By AM-GM, 1 = 3 x + y z 1 + z 2 ≥ 3 y z x z 2 , i.e. 1 ≥ y x z . Similarly, 1 = 2 y + x z 1 ≥ x z y , i.e. 1 ≥ x z y . Taking the 2 inequalities above together, we must have x z y = 1 , or y = x z . Substituting this into the 2nd equation and using AM-GM again, 2 = y + y 1 ≥ 2 y ⋅ y 1 = 2 . Equality must hold in the inequality above, i.e. y = 1 / y , or y = 1.
This also implies that xz = 1, or z 1 = x . Substituting this into the first equation, we get x + x + x 2 1 = 3 , 2 x 3 − 3 x 2 + 1 = 0 , ( x − 1 ) 2 ( 2 x + 1 ) = 0 . Since x must be positive, the only solution is x = 1. This implies that the only solution is (1,1,1), so the desired sum is 3.
Problem Loading...
Note Loading...
Set Loading...
{ x + y z 1 + z 2 = 3 y + x z 1 = 2 ⟹ x + y z 1 + z 2 + y + x z 1 = 5 ≥ AM-GM 5 5 x ⋅ y z 1 ⋅ z 2 ⋅ y ⋅ x z 1 = 5
The minimum value of x + y z 1 + z 2 + y + x z 1 is 5 and it is reached if and only if x = y z 1 = z 2 = y = x z 1 .
Since we know x + y z 1 + z 2 + y + x z 1 is equal to its minimum value, we have x = y z 1 = z 2 = y = x z 1 , which implies after multiplying both sides by y z that we get y z ⋅ z 2 = 1 and from y = z 2 we get z 5 = 1 ⟹ z = 1 ⟹ x = y = 1 . After checking the solution ( 1 , 1 , 1 ) on the initial system of equations, we see it works.
Therefore, the answer is x + y + z = 1 + 1 + 1 = 3 .