⎩ ⎨ ⎧ a 1 + a 2 + a 3 + a 4 + … + a 1 0 = 4 b 1 + b 2 + b 3 + b 4 + … + b 1 0 = − 1
Let a 1 , a 2 , a 3 , a 4 , … , a 1 0 and b 1 , b 2 , b 3 , b 4 , … , b 1 0 be real numbers such that they satisfy the system of equations above.
What is the minimum positive value of the expression below? ( a 1 2 + b 1 2 + a 2 2 + b 2 2 + … + a 1 0 2 + b 1 0 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.
Grt idea .and good sol.
Note that this problem doesn't change for any value of n
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).
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. Or b i a i = λ
So here the minimum value is 4 2 + 1 2 = 1 7
Typo: "Length of this TRIAL"
Lol, been a while since I posted a min/max question
Log in to reply
@Harsh Shrivastava post your solution.
Log in to reply
My solution uses Minkowski Inequality.
Oops, lol, the end of mine was intended for another problem. I revised it
Problem Loading...
Note Loading...
Set Loading...
Take ( a j , b j ) as points on complex plane. Then Z j = a j + i b j and ∣ Z j ∣ = a j 2 + b j 2 . Now ∣ Z 1 + Z 2 ∣ ≤ ∣ Z 1 ∣ + ∣ Z 2 ∣ . This means ∣ j = 1 ∑ n Z j ∣ ≤ j = 1 ∑ n ∣ Z j ∣ . So minimum value of j = 1 ∑ n ∣ Z j ∣ is ∣ j = 1 ∑ n Z j ∣ . Now j = 1 ∑ n Z j = j = 1 ∑ n a j + i j = 1 ∑ n b j = 4 − i . So minimum value of ( j = 1 ∑ n a j 2 + b j 2 ) 2 is ∣ 4 − i ∣ 2 = 1 7