Let x , y , z be reals such that x + y = k ( y + z ) > 0 and z + x < 0 . Find the minimum value of t such that for all k ≥ t , there always exist x , y , z satisfying y + z x + x + z y + x + y z = 1 . If min ( t ) = g a + b c + d + e f (min t is fully simplified) for positive integers a , b , c , d , e , f , g , submit your answer as the product a b c d e f g .
P/S: Thanks to James Wilson for the conversation.
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.
Excellent solution! My reasoning on Sharky's problem was definitely flawed. I'll let you know if I can break apart exactly what went wrong.
Log in to reply
I believe it was the fact that I assumed all three partial derivatives were zero. I figured the meat (or all) of the solution set of y + z x + x + z y + x + y z = 1 was a connected region. Recall that that equation implies y + z x 2 + x + z y 2 + x + y z 2 = 0 . But this does not ensure all three partial derivatives of y + z x 2 + x + z y 2 + x + y z 2 over the same region are zero. That was the flaw in my thinking. The set would have to be "thicker."
Don't you want to say t > 1 instead of k > 1 ?
Problem Loading...
Note Loading...
Set Loading...
y + z x + x + z y + x + y z = 1 = > ( x + y + z ) ( x + y 1 + y + z 1 + z + x 1 ) = 4
Let x + y = a , y + z = b , z + x = c = > ( a + b + c ) ( a 1 + b 1 + c 1 ) = 8 (1)
Note that if the set x 0 , y 0 , z 0 satisfies the original equation, so does k x 0 , k y 0 , k z 0 . So WLOG, assume y + z = 1 .
Equation (1) becomes ( k + 1 + c ) ( k k + 1 + c 1 ) = 8
= > ( k + 1 + c ) ( c ( k + 1 ) + k ) = 8 c k
= > c 2 ( k + 1 ) + c ( k 2 − 5 k + 1 ) + k ( k + 1 ) = 0
= > ( c k + 1 ) 2 + 2 c k + 1 2 k + 1 k 2 − 5 k + 1 + 4 ( k + 1 ) ( k 2 − 5 k + 1 ) 2 = 4 ( k + 1 ) k 4 − 1 4 k 3 + 1 9 k 2 − 1 4 k + 1
= > ( c k + 1 + 2 k + 1 k 2 − 5 k + 1 ) 2 = 4 ( k + 1 ) k 4 − 1 4 k 3 + 1 9 k 2 − 1 4 k + 1
= > ( 2 c ( k + 1 ) + k 2 − 5 k + 1 ) 2 = k 4 − 1 4 k 3 + 1 9 k 2 − 1 4 k + 1 .
Note that for c to actually exist as a real number, k 4 − 1 4 k 3 + 1 9 k 2 − 1 4 k + 1 ≥ 0 .
Also note that k > 1 , as k = 1 = > k 4 − 1 4 k 3 + 1 9 k 2 − 1 4 k + 1 = − 7 .
= > k 2 − 1 4 k + 1 9 − k 1 4 + k 2 1 ≥ 0
= > ( k + k 1 ) 2 − 1 4 ( k + k 1 ) + 1 7 ≥ 0 .
Let k + k 1 = x .
= > x 2 − 1 4 x + 1 7 ≥ 0
= > ( x − 7 ) 2 ≥ 3 2
= > x ≥ 7 + 4 2
= > k + k 1 ≥ 7 + 4 2
= > 4 k 2 − 4 k ( 7 + 4 2 ) + 4 ≥ 0
= > ( 2 k − ( 7 + 4 2 ) ) 2 ≥ 7 7 + 5 6 2
= > k ≥ 2 7 7 + 5 6 2 + 7 + 4 2 .
So for all k ≥ 2 7 7 + 5 6 2 + 7 + 4 2 , there always exists x , y , z satisfying the original equation.
= > a b c d e f g = 9 6 5 8 8 8 .
P/S: Yes, the letter t wasn't used at all in my solution... I typed it out as I found out that k can be negative and there still exists a solution (just negate them) but when k = 1 , there exists no real solution. This is also the main reason I had to claim that k > 1 to proceed.