If a i > 0 and a 1 2 0 1 5 + a 2 2 0 1 5 + ⋯ ⋯ + a 2 0 1 5 2 0 1 5 = 2 0 1 6 . find the maximum value of a 1 + a 2 + a 3 . . . . . . . . . . + a 2 0 1 5 upto three decimal places.
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.
Can you tell me in detail?
Log in to reply
The gradients of the constraint function and the objective function must be parallel (the gradient being the list all the 2015 partial derivatives).
Now g r a d ( a 1 , a 2 , . . . , a 2 0 1 5 ) = ( 1 , 1 , . . . , 1 ) and g r a d ( a 1 2 0 1 5 , . . . , a 2 0 1 5 2 0 1 5 ) = 2 0 1 5 ( a 1 2 0 1 4 , . . . , a 2 0 1 5 2 0 1 4 ) . It follows that a i 2 0 1 4 = a j 2 0 1 4 for all i and j . Since the a k are positive, they must all be equal.
I will be glad to provide further details as needed.
Problem Loading...
Note Loading...
Set Loading...
I'm using Lagrange multipliers to see that all the a k must be identical. Thus 2 0 1 5 a k 2 0 1 5 = 2 0 1 6 and the sum of all a k is just a little above 2 0 1 5 .