k = 1 ∑ 4 0 0 x k 2 k 3 = 1
Given the above sum, with positive real numbers x 1 , x 2 , … , x 4 0 0 .
If the minimum value of k = 1 ∑ 4 0 0 x k can be expressed as p 3 for a positive real p , input your answer as the greatest integer less than 4 0 0 p .
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.
It's my birthday today, by the way. I turn 400 this year.
Log in to reply
Nice solution .
Btw , did you gain all your knowledge from the Internet or good stuff is being taught at Singaporean schools ( unlike schools here in India ) ?
Log in to reply
Internet :) I don't think people would appreciate it if higher maths was compulsory, and that's for the best. Higher mathematics rarely finds use in daily life.
Log in to reply
@Jake Lai – Yeah , that's one way to look at it
Also, Happy Birthday !!!
I didn't wish you earlier because your age still was 14 back then(and I really thought that you were just joking around!) , I see now it's 15 :)
EDIT: I just remembered that I hadn't upvoted your solution !
Congratulations @Joel Tan :)
Lagrangian Multipliers would make this problem very easy.
Problem Loading...
Note Loading...
Set Loading...
The Cauchy-Schwarz inequality for ( a 1 , a 2 , … , a n ) , ( b 1 , b 2 , … , b n ) ∈ R n only achieves equality for when both ordered tuples (vectors) are linearly dependant.
Taking a k = x k and b k = x k 2 x k k 3 , in order for the minimum to be achieved, we need
x k 2 x k A 3 k 3 = x k ⟶ x k = A k
for some nonzero scalar A .
Substituting x k into the given sum, we see
k = 1 ∑ 4 0 0 x k 2 k 3 = A 2 1 k = 1 ∑ 4 0 0 k = 2 A 2 4 0 0 × 4 0 1 = 1
Hence, A = 2 4 0 0 × 4 0 1 . Finally, we subsitute in x k again:
k = 1 ∑ 4 0 0 x k = A 2 4 0 0 × 4 0 1 = A 3