Given that a 1 , a 2 , … , a n , b 1 , b 2 , … , b n are non-negative real numbers that sum to 10, find the minimum possible value of ( i = 1 ∑ n a i 2 + b i 2 ) 2 .
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.
Isn't it easier to visualize vectors rather than saying "trail of hypotenuses"?
Also, you could alternatively say that the final sum of all the hypotenuse vectors is a position vector whose x , y coordinates satisfy the condition x + y = 1 0 . Now we are left with finding the closest point to the origin that satisfies this property.
Wrong Answer P =Summation of ais and q is summation of bis. But P^2+q^2 is not equal to summation of a^2s and b^2s together.
A solution using Lagrange multipliers seems to work here. Since the objective function is positive, it's not necessary to deal with the square, so just ignore it and minimize ∑ i = 1 n a i 2 + b i 2 . You end up with the two sets of equations: a i 2 + b i 2 a i = λ and a i 2 + b i 2 b i = λ . But from here, it can be seen that a i = b i . It doesn't matter what values you choose for a i , b i as long as they add up to 1 0 and a i = b i (zero seems to be permissible as well); you'll end up with the sought minimum value. For example, a 1 = b 1 = 2 , a 2 = b 2 = 3 , with the rest zero, has a sum of 1 0 and gives ( 2 2 + 2 2 + 3 2 + 3 2 ) 2 = 5 0 .
Problem Loading...
Note Loading...
Set Loading...
View each pair ( a i , b i ) as a ordered pair in the Cartesian plane. Now each square root a i 2 + b i 2 represents the distance from the origin to that point (the hypotenuse).
Let p = ∑ a i and q = ∑ b i . Assume that we put each hypotenuse tip to tail so that they extend in a line. This "trail of hypotenuses" no matter what each individual length is, will end at the point ( p , q )
Thus the overall length this trial will represent our sum. Which is obviously minimized when this length is straight, so the minimum value is p 2 + q 2 .
Using the Power Mean (QAGH) inequalities, Q . M . ≥ A . M . :
2 p 2 + q 2 ≥ 2 p + q
Since p + q = 1 0 ,
p 2 + q 2 ≥ 5 0
The equality can be achieved when a 1 = a 2 = ⋯ = a n = b 1 = b 2 = ⋯ = b n = 2 n 1 0 .