x , y , and z are real numbers satisfying the equation x 2 + y 2 + z 2 = 1 .
The maximum value of 3 x y 2 z can be expressed in the form b a for co-prime positive integers a and b .
Find a + b .
Bonus:
Can you generalize the maximum value of x m y n z p for positive integers m , n , p given the same constraints?
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.
Does this still work if m , n , p are positive real numbers (and x , y , z are positive as well)?
Log in to reply
I reckon it won't, since you cant have a fraction repeated 7 . 8 times. I mis-worded the bonus so I'll fix that now.
Log in to reply
But does your result still hold when m , n , p aren't integers?
Log in to reply
@Otto Bretscher – From the tests I just did it will not, but once I get home later on tonight I'll see what I can do about fixing that.
Log in to reply
@Brandon Monsen – It should work... I did the problem with Lagrange multipliers, and there we are not restricted to integer values of m , n and p .
Log in to reply
@Otto Bretscher – And you got that exact maximum value when doing so? That's interesting. I assumed it would fall apart due to the fractional part in the summation.
Log in to reply
@Brandon Monsen – Lagrange multipliers, solved for λ , give you m x m − 2 y n z p = n x m y n − 2 z p = p x m y n z p − 2 so m x 2 = n y 2 = p z 2 ... same condition.
Log in to reply
@Otto Bretscher – Oh ok awesome! Thanks for confirming!
Log in to reply
@Brandon Monsen – You can also do AM-GM with fractional weights, of course... just write m m x 2 + n n y 2 + p p z 2 = 1 instead of the sums.
To complete your solution, you must show that equality can occur.
you cant apply am gm on all real numbers
Log in to reply
Oh sorry, you are applying it on squares which is positive
Problem Loading...
Note Loading...
Set Loading...
Since the constraints are squares of numbers, and we aren't subtracting or otherwise doing anything to the expression where a negative sign would matter, we can assume that x , y , z are all positive.
Rewrite our constraint as
x 2 + 2 1 y 2 + 2 1 y 2 + z 2 = 1
By AM-GM Inequality , we get that
4 x 2 + 2 1 y 2 + 2 1 y 2 + z 2 ≥ 4 4 1 x 2 y 4 z 2
4 2 ≥ x y 2 z
x y 2 z ≤ 8 1
Therefore
3 x y 2 z ≤ 8 3 .
And we know that equality can occur because by AM-GM once again, we get that
x 2 = 2 1 y 2 = z 2
And by our constraint we get
4 x 2 = 1 2 y 2 = 1 4 z 2 = 1
All of which have solutions over the real numbers, therefore equality must be obtained.
And our answer is 3 + 8 = 1 1
For the generalization:
Rewrite our constraint as
i = 1 ∑ m m x 2 + j = 1 ∑ n n y 2 + k = 1 ∑ p p z 2 = 1
And so, by AM-GM, we get
m + n + p ∑ i = 1 m m x 2 + ∑ j = 1 n n y 2 + ∑ k = 1 p p z 2 ≥ m + n + p m m n n p p x 2 m y 2 n z 2 p
m + n + p 1 ≥ m + n + p m m n n p p x 2 m y 2 n z 2 p
( m + n + p ) m + n + p m m n n p p ≥ x 2 m y 2 n z 2 p
And finally...
x m y n z p ≤ ( m + n + p ) m + n + p m m n n p p