Over all positive a , b , c that satisfy
1 + b a + 1 + c b + 1 + a c = 1 ,
what is the maximum value of the product 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.
then why did you post a solution?
This is the best I can do... If you're looking for a real solution to this problem, then skip over this comment.
Using the method of Lagrange multipliers, I get the equations:
b c = λ ( 1 + b 1 − ( 1 + a ) 2 c )
a c = λ ( 1 + c 1 − ( 1 + b ) 2 a )
a b = λ ( 1 + a 1 − ( 1 + c ) 2 b ) .
I next note that a = b = c solves the equations, giving consistent values for λ .
Substituting this into 1 + b a + 1 + c b + 1 + a c = 1 yields a = b = c = 2 1 .
So, I find 8 1 is a possible value for the maximum of a b c .
The point here is to show that 8 1 is the global maximum.
If someone figures out how to show this, please comment here. Thanks!
Problem Loading...
Note Loading...
Set Loading...
sorry, this is not a rmo solving technique but for Jee: i just considered each of expression 1 + b a = 1 + c b = 1 + a c = 3 1 as it would lead to the minimum by symmetry :D.