How do I go about solving this? Yet another difficult, but interesting question. Question ENCL
@Hero @amistre64 @radar @mathstudent55
min max brings to mind derivatives let f=(a+b)c and ng=n(a^2+b^2+c^2-1) fa = c nga = n 2a fb = c ngb = n 2b fc = a+b ngc = n 2c when f, = ng, we have a max/min condition if my idea is going correctly
a+b = 2nc; n=(a+b)/2c c = 2n b = b(a+b)/c c^2 = b(a+b) c = 2n a =a(a+b)/c c^2 = a(a+b) a(a+b) = b(a+b) when a/b = 1; hence when a=b c^2 = b(b+b) = 2b^2 therefore: assuming all positive values for a,b,c b^2 + b^2 +2b^2 = 1 4b^2 = 1 b^2 = 1/4, b=1/2 a=1/2, b=1/2, c=sqrt(2)/2 is my rough idea
or does f=(a+b)^c ?? since thats an odd place to place the c for multiplication ... not unheard of, but just odd in general
langrange multipliers is what my idea was trying to recall :)
im guessing this means the wolf agrees http://www.wolframalpha.com/input/?i=maximize+%28a%2Bb%29*c%2C+given+that+a%5E2%2Bb%5E2%2Bc%5E2%3D1
@amistre64 Can you explain a little?
i explained alot ... what else is there :)
ng ?
theres not lambda key .... and lambda is just sume multiplier to g
g = a^2 + b^2 + c^2 - 1 ?
in lagrange multipliers; we have a setup that is constrained; in this case: f is constrained by g f = (a+b)c and g is the sphere of radius 1 centered at the origin
Is this Multivar. Calc?
yes
No other way to do this?
prolly, but you didnt specify a method
Okay, I think this is good enough. I am not very well-versed in Multi.-Vari. Calc. I'll see what i can do about that. Thanks! :)
when the gradient of f and g are equal there is a min max relationship involved. which is what the lagrange multipler method is about
@ganeshie8 ? Can you explain this a little? I don't know multi var calc.
@BSwan wana try this using number theory ? :)
why he thinks its multi var calc. ?!
Because the answer is amistre64 provided was purely multi var. calc.
multi var calc gave the answer already : amistre's solution was using lagrange multipliers
Akash wants to do this without calculus i think...
Yeah.
|dw:1400421606378:dw|
yes we want to optimize the value of (a+b)c over a sphere
ok let me think , number theory dnt help with real number
unless it said (a+b)c integer which is not given
yeah, max value of (a+b)c is is 1/sqrt(2) http://www.wolframalpha.com/input/?i=maximize+%28a%2Bb%29*c%2C+given+that+a%5E2%2Bb%5E2%2Bc%5E2%3D1
so i think we may have to try completing the square or some other tricks and look for upper bound
mmm ill think of dump method :D |dw:1400423340973:dw|
Join our real-time social learning platform and learn together with your friends!