⎩ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎪ ⎪ ⎪ ⎧ k = 1 ∑ 6 6 a k = 2 0 1 5 k = 1 ∑ 6 6 a k 2 = 6 2 4 6 5
Suppose real numbers a 1 , a 2 , a 3 , … , a 6 6 satisfy the two equations above with S = max ( a 1 , a 2 , a 3 , … , a 6 6 ) .
If S = n m , where m and n are positive coprime integers, then find m + n .
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.
Right, one should be able to identify that Cauchy Schwarz Inequality is applicable when we are all given the sum of squares of all terms.
Problem Loading...
Note Loading...
Set Loading...
Without loss of generality we will isolate a 1 and determine its maximum possible value. Then by Cauchy's Inequality , with the b k 's all equalling 1 , we have that
( k = 2 ∑ 6 6 a k 2 ) ( k = 2 ∑ 6 6 1 ) ≥ ( k = 2 ∑ 6 6 a k ) 2
⟹ 6 5 × ( 6 2 4 6 5 − a 1 2 ) ≥ ( 2 0 1 5 − a 1 ) 2
⟹ 6 5 × 6 2 4 6 5 − 2 0 1 5 2 ≥ 6 6 a 1 2 − 4 0 3 0 a 1
⟹ 0 ≥ 2 a 1 ( 3 3 a 1 − 2 0 1 5 ) ⟹ 0 ≤ a 1 ≤ 3 3 2 0 1 5 .
The maximum value of a 1 = 3 3 2 0 1 5 can be realized by setting all other a k 's to 3 3 9 9 2 .
Thus S = 3 3 2 0 1 5 , and so m + n = 2 0 1 5 + 3 3 = 2 0 4 8 .