( y x + z y + x z ) ( x y + y z + z x )
Let S be the minimum value of the above expression for positive reals x , y and z satisfying ( y x + z y + x z ) + ( x y + y z + z x ) = 8 .
Given that S can be expressed as a b + c where a , b and c are integers and b square-free, find a + b + c .
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.
But is it possible to obtain this minimum value for some x,y,z? I got lower bound as 16 for x = 1 , y = ( 3 + 5 ) / 2 , z = ( 3 − 5 ) / 2 But I couldn't find a lower bound than 16.
Log in to reply
The equality can hold when z = 1 ; y = 2 1 ( − 1 + 1 1 + 8 − 2 1 1 ) ; x = 5 − 1 1 + 3 5 − 1 0 1 1
Log in to reply
Seems right. Thanks.
Please add the equality condition into your solution, and explain how to calculate it.
Great question btw :)
How is that hypothesis equal to 11?
Log in to reply
( ∑ x ) ( ∑ x 1 ) = 3 + ∑ y x + ∑ x y = 1 1
Log in to reply
How is (sum of x).(sum of 1/x) = (sum of xy).(sum of 1/xy)?
Log in to reply
@Saurabh Chaturvedi – There are 2 ways of seeing it:
can you explain how you applied cauchy schwartz? i can't seem to see how the equation under the line "applying the cauchy-schwarz inequality we have" looks anything like the cauchy-schwartz inequality. Thanks!
Log in to reply
(One version of) cauchy-schwarz inequality states that A C + B D ≤ ( A + B ) ( C + D ) .
That is what he applied, where A = 2 ( ∑ x y ) .
Log in to reply
oh...ic, how come there is a D on the right side of the inequality, but not one on the left? also, is the "other version" of the cauchy schwarz inequlity the vector form on the wiki? i can't see how the vector form is like the inequality you proposed. thanks!
Log in to reply
@Willia Chang – Sorry fixed the typo.
For the CS of 2 terms, you are most probably used to seeing
(
a
2
+
b
2
)
(
c
2
+
d
2
)
≥
(
a
c
+
b
d
)
2
.
Now, substitute
a
=
A
etc, and take square roots on both sides, you will get
(
A
+
B
)
(
C
+
D
)
≥
A
C
+
B
D
.
Write a = x + y + z , b = x y + x z = y z and c = x y z . Then 8 = ( y x + z y + x z ) + ( z x + y z + x y ) = x y z x 2 y + x 2 z + x y 2 + y 2 z + x z 2 + y z 2 = c a b − 3 c and hence a b = 1 1 c and so x , y , z are the roots of the cubic f ( X ) = X 3 − a X 2 + b X − 1 1 1 a b = 0 . Playing with elementary symmetric polynomials gives Q = = = = = = = ( y x + z y + x z ) ( z x + y z + x y ) 3 + ( y z x 2 + x z y 2 + x y z 2 ) + ( x 2 y z + y 2 x z + z 2 x y ) 3 + c x 3 + y 3 + z 3 + c 2 x 3 y 3 + x 3 z 3 + y 3 z 3 3 + c a 3 − 3 a b + 3 c + c 2 b 3 − 3 a b c + 3 c 2 9 + c a 3 + c 2 b 3 − c 6 a b 9 + b 1 1 a 2 + a 2 1 2 1 b − 6 6 1 1 u + 1 2 1 u − 1 − 5 7 where u = a 2 b − 1 .
Since Q ′ ( u ) = 1 1 − 1 2 1 u − 2 , we see that the minimum of Q over all positive u occurs when u = 1 1 , giving a value of Q = 2 2 1 1 − 5 7 .
It remains to show that these values of u and Q can be achieved with x , y , z all positive. With a = b = 1 1 , we have the cubic f ( X ) = X 3 − 1 1 X 2 + 1 1 X − 1 = ( X − 1 ) ( X 2 + ( 1 − 1 1 ) X + 1 ) , which has positive roots 1 , 2 1 [ 1 1 − 1 ± 8 − 2 1 1 ] . Thus this value of Q can be achieved, and so the desired answer is 2 2 + 1 1 − 5 7 = − 2 4 .
How did you know that when u = 1 1 , then a = b = 1 1 must be true? Why can't other pairs of ( a , b ) be true?
By the way, nice solution. I tried solving it via cubic discriminant and I got stuck.
Log in to reply
I was looking for a simple solution to a 2 = b 1 1 , and found that the case I picked gives three positive real roots for f ( X ) . I am sure there are other solutions.
The other approach would be to consider the inequalities forced on a and b by the requirement that f ( X ) have three positive real roots, and solve those. Work those inequalities out! You need f ( X ) to have positive turning points 0 < u < v , and f ( u ) ≥ 0 ≥ f ( v ) for a , b > 0 .
Log in to reply
Hmmm, I can't seem to solve it by hand.
Here's my feeble approach:
f ( X ) = X 3 − a X 2 + b X − 1 1 1 a b = X 3 − a x 2 + a 2 1 1 X − a 1 1 1 .
By cubic discriminant, ( B C ) 2 − 4 A C 3 − 4 B 3 D − 2 7 ( A D ) 2 + 1 8 A B C D ≥ 0 , where A = 1 , B = − a , C = a 2 1 1 , D = − a 1 1 1 . Simplifying it gives this monstrosity:
a 2 1 1 − a 6 4 4 1 1 − 1 1 4 a 2 − 1 1 a 2 2 7 + a 2 1 8 ≥ 0 .
Solving it by WolframAlpha tells us that a satisfy the condition,
1 . 8 0 7 2 6 … ≤ x ≤ 1 . 8 3 5 1 6 …
But this contradicts the fact that a = 1 1 > 1 . 8 3 5 1 6 … is a possible solution.
I'm so confused right now.
Either way, thanks for your response. I think your a = b = 1 1 is the simplest approach. I interpreted that your solution implies that it's the only pair for the solution ( a , b ) , when in fact, it isn't.
On an unrelated topic, do you have any improvement for my solution here ? I've been told that Jensen's inequality is a viable approach, but I don't see how yet.
Log in to reply
@Pi Han Goh – We want to know the condition on a , b > 0 which ensures that the equation f ( X ) = X 3 − a X 2 + b X − 1 1 1 a b = 0 has positive real roots. It turns out the the condition can be expressed solely in terms of u = a 2 b − 1 . The algebra proving this is slightly neater in terms of v = u − 1 = a − 2 b . Note that f ( X ) f ( a X ) = = X 3 − a X 2 + a 2 v X − 1 1 1 a 3 v a 3 [ X 3 − X 2 + v X − 1 1 1 v ] and so f ( X ) will have three positive real roots precisely when g ( X ) = X 3 − X 2 + v X − 1 1 1 v does. Looking for roots of g ′ ( X ) , we see that g ( X ) has turning points at X = λ ± , where λ ± = 3 1 [ 1 ± 1 − 3 v ] provided that v < 3 1 (both of these numbers are positive), and we calculate g ( λ ± ) = 2 9 7 2 [ 3 6 v − 1 1 ∓ 1 1 ( 1 − 3 v ) 2 3 ] The polynomial g ( X ) will have three positive roots precisely when g ( λ − ) ≥ 0 ≥ g ( λ + ) , and this will occur precisely when ( 3 6 v − 1 1 ) 2 1 2 1 ( 3 v − 1 ) 3 + ( 3 6 v − 1 1 ) 2 2 7 v ( 1 2 1 v 2 − 7 3 v + 1 1 ) ≤ ≤ ≤ 1 2 1 ( 1 − 3 v ) 3 0 0 Thus, given that v must be positive, we deduce that f ( X ) will have three positive roots precisely when 2 4 2 7 3 − 5 2 2 7 3 − 5 ≤ ≤ v u ≤ ≤ 2 4 2 7 3 + 5 2 2 7 3 + 5 Note that, since 2 4 2 7 3 + 5 < 3 1 , this final condition includes the previous condition v < 3 1 for the existence of turning points.
To finish off, we note that u = 1 1 satisfies this inequality.
Log in to reply
@Mark Hennings – Thank you for your detailed writeup! I've never seen this technique being used before. I wondering whether there is a name for this technique or not.
I still don't know why my cubic discriminant working fails though... Oh well...
Problem Loading...
Note Loading...
Set Loading...
Let P = ( y x + z y + x z ) ( x y + y z + z x )
We have:
2 P = ( ∑ y x + ∑ x y ) 2 − ( ∑ y x ) 2 − ( ∑ x y ) 2 = 6 4 − ( ∑ y 2 x 2 + 2 ∑ y x ) + ( ∑ x 2 y 2 + 2 ∑ x y ) = 4 8 − ( ∑ y 2 x 2 + ∑ x 2 y 2 ) = 5 1 − ( ∑ x 2 ) ( ∑ x 2 1 )
From the hypothesis, we get: ( ∑ x ) ( ∑ x 1 ) = ( ∑ x y ) ( ∑ x y 1 ) = 1 1
Applying the Cauchy-Schwarz inequality we have:
≤ = ( 2 ∑ x y ) ( 2 ∑ x y 1 ) + ( ∑ x 2 ) ( ∑ x 2 1 ) ( 2 ∑ x y + ∑ x 2 ) ( 2 ∑ x y 1 + ∑ x 2 1 ) ( ∑ x ) ( ∑ x 1 )
Hence, ( ∑ x 2 ) ( ∑ x 2 1 ) ≤ ( 1 1 − 2 1 1 ) 2
So, P ≥ 2 5 1 − ( 1 1 − 2 1 1 ) 2 = 2 2 1 1 − 5 7
Thus, a + b + c = − 2 4 .