Let x , y , z be positive numbers such that x + y + z = 2 and x y + y z + z x = 1 . Given that x 2 0 . 1 7 + y 2 0 . 1 7 + z 2 0 . 1 7 achieves its maximum value when ( x , y , z ) = ( X , Y , Z ) , and that X Y Z = b a , where a and b are coprime positive integers, find a + b .
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.
That lemma is good :) Remember to sleep well anyways :)
I don't know enough to decide if this is a coincidence or not, but actually, 2 7 4 is the maximum of x y z . Thought this would be a good thing to reflect on. Nice solution, by the way!
Log in to reply
Well... It's not a coincidence. Still asking why :)
Log in to reply
I got it while I was spacing out.
Let the triplet ( x , y , z ) make x 2 0 . 1 7 + y 2 0 . 1 7 + z 2 0 . 1 7 maximum and the triplet would make x 3 + y 3 + z 3 maximum, according to the solution Julian posted.
x 3 + y 3 + z 3 = ( x + y + z ) ( x 2 + y 2 + z 2 − x y − y z − z x ) + 3 x y z = 2 + 3 x y z
And x 3 + y 3 + z 3 would reach its maximum when x y z is maximum.
Therefore x 2 0 . 1 7 + y 2 0 . 1 7 + z 2 0 . 1 7 would reach its maximum too, when x y z is maximum.
Log in to reply
@Boi (보이) – Great idea! So now we can generalize this problem!
@Boi (보이) – Anyways, how would you know that x 2 0 . 1 7 + y 2 0 . 1 7 + z 2 0 . 1 7 will achieve the maximum when x 3 + y 3 + z 3 achieves it? It is true in most cases, yet all.
Log in to reply
@Steven Jim – Well, in this specific case, if x 2 0 . 1 7 + y 2 0 . 1 7 + z 2 0 . 1 7 is maximum, the triplet x , y , z would make every x n + y n + z n as large as possible.
So, x 3 + y 3 + z 3 would me maximum as well.
Log in to reply
@Boi (보이) – That's what I've been thinking of. It's not somewhat provable atm, so I'm stuck. I do think though that you're right, though I'm not sure if n < 1 .
@Boi (보이) – Oh wow! I was thinking of Newton's sum, by setting x=X^1000, y = Y^1000, z=Z^1000. And I got plenty of huge expressions to work with. =(
Log in to reply
@Pi Han Goh – Oops, that sounds like a pain in the arse.
Oh also @Julian Poon , I will do what you asked.
It's not x > y > z , it's x > y ≥ z .
Also, x n + y n + z n = ( y + z ) 2 n + y n + z n , and
( y + z ) 2 n + y n + z n ≤ ( 1 + 2 2 n 2 ) ( y + z ) 2 n = ( 1 + 2 2 n 2 ) ⋅ x n
....sleep well and regularly , dude =_=
Log in to reply
Well I'm back after a week of 0 internet activity, and I've edited it :)
He's been mad lately revising for his test :)
Superb! This is an awesome problem :)
Alternative solution
Problem Loading...
Note Loading...
Set Loading...
I'm typing this out at 3:11 AM cause I can't sleep. If there;s any errors please just tell:
Lemma: z n + y n ≤ 2 2 n 2 ( y + z ) 2 n for all real n Proof: Since we need to prove for all real n , it indicates that we should use a continuous method, namely calculus z n + y n = ( y + z ) 2 n ⋅ ( 1 + y z ) 2 n 1 + ( y z ) n Using calculus, it can be found that ( 1 + k ) 2 n 1 + k n = ( 1 + y z ) 2 n 1 + ( y z ) n ≤ 2 2 n 2 The inequality follows from here.
First thing to notice is that x 2 + y 2 + z 2 = 2 ( x y + y z + z x ) = 2 .
x 2 + y 2 + z 2 − 2 ( x y + y z + z x ) = ( x + y + z ) ( − x + y + z ) ( x − y + z ) ( x + y − z ) = 0
Without loss of generality, we can assume x > y ≥ z . Hence x = y + z
x n + y n + z n = ( y + z ) 2 n + y n + z n
Now since z n + y n ≤ 2 2 n 2 ( y + z ) 2 n
( y + z ) 2 n + y n + z n ≤ ( 1 + 2 2 n 2 ) ( y + z ) 2 n = ( 1 + 2 2 n 2 ) ⋅ x n
Now since z + y = 2 − x , y z = 1 − z x − x y = 1 − x ( 2 − x ) and ( y + z ) 2 ≥ 4 y z through AM-GM, max x = 3 4 .
Hence x n + y n + z n ≤ ( 1 + 2 2 n 2 ) ⋅ x n ≤ ( 1 + 2 2 n 2 ) ⋅ ( 3 4 ) n With equality achieved when 4 y = 4 z = x = 3 4