A problem by Josh Rowley

Level pending

i = 1 2014 a i = 100 \sum_{i=1}^{2014} a_{i} = 100 , where a k R , a k a_{k} \in \mathbb{R} , a_{k} > 0 {0} k \forall k . What is the minimum value of 10000 i = 1 2014 a i 2 i \lfloor 10000 \sum_{i=1}^{2014} \dfrac{a_{i}^2}{i} \rfloor ?


The answer is 49.

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.

2 solutions

It follows by Cauchy-Schwarz Inequality that ( i = 1 2014 a i ) 2 ( i = 1 2014 a i 2 i ) ( i = 1 2014 i ) (\sum_{i=1}^{2014}a_i)^2\le(\sum_{i=1}^{2014}\frac{a_i^2}{i})(\sum_{i=1}^{2014}i) .

Hence the minimum value possible is 10 0 2 2014 2015 2 0.00492828 \frac{100^2}{\frac{2014*2015}{2}} \cong 0.00492828 and therefore the answer is 49 \boxed{49} .

Josh Rowley
Jan 4, 2014

From Titu's Lemma, we know that i = 1 2014 a i 2 b i ( a 1 + a 2 + . . . + a 2014 ) 2 b 1 + b 2 + . . . + b 2014 \sum_{i=1}^{2014} \dfrac{a_{i}^2}{b_{i}} \ge \dfrac{( a_{1} + a_{2} + ... + a_{2014} )^2}{ b_{1} + b_{2} + ... + b_{2014} } . So, if we let b i = i b_{i} = i then we have that the minimum is 10 0 2 1007 × 2015 \dfrac{100^2}{1007 \times 2015} . Then multiplying by 10000 and applying the floor function we achieve an answer of 49 49

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...