There are 300 followers. Yay!

Algebra Level 5

Consider all n n -tuples of real numbers, ( x 1 , x 2 , x 3 , . . . , x n ) \displaystyle{(x_{1}, x_{2}, x_{3}, ..., x_{n})} such that i = 1 n x i 2 = 1 \displaystyle{\sum_{i=1}^n x_{i}^{2} =1} where n n is a positive integer.

Let M n M_{n} be the maximum value of i = 1 n i x i \displaystyle{\sum_{i=1}^n i x_{i}} over all such n n -tuples.

Determine the sum of all integers p , 1 p 300 \displaystyle{p, 1 \leq p \leq 300} such that M p M_{p} is an integer.


The answer is 25.

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

Abhinav Rawat
Sep 19, 2015

Done exactly the same

Akshay Bodhare
Jan 11, 2015

First we use Cauchy-Schwarz Inequality to find Mp.Then we find that p=1 and p=24 satisfy the condition for integer solutions.Ans=1+24

How do you prove it? What is the expression for Mp? How do you use Cauchy Schwarz?

Joel Tan - 6 years, 5 months ago

Log in to reply

First,we need to understand that the expression will be maximum only when all x i x_i are positive. Now,

i = 1 n i x i ( i = 1 n i 2 ) 1 2 ( i = 1 n x i 2 ) 1 2 \displaystyle{\sum_{i=1}^n i x_{i}} \leq {(\displaystyle{\sum_{i=1}^n i ^2})}^{\frac {1}{2}}*(\displaystyle{\sum_{i=1}^n x_{i}^{2}})^{\frac {1}{2}}

Thus, M p = ( i = 1 p i 2 ) 1 2 M_p = (\displaystyle{\sum_{i=1}^p i^{2}})^{\frac {1}{2}}

Since, i = 1 n x i 2 = 1 \displaystyle{\sum_{i=1}^n x_{i}^{2}} = 1

Now, we need to find integer values of M p M_p ,which is equal to

( p ( p + 1 ) ( 2 p + 1 ) 6 ) 1 2 (\frac {p(p+1)(2p+1)}{6})^{\frac {1}{2}}

Now,for M p M_p to be integer,the entire expression should inside root must be a perfect square.I had to use hit and trial in order to find the values.

they are perfect squares for p = 1 p=1 and p = 24 p=24 .

Thus,Ans=1+24=25

However,Please let me know if you are able to find a method to find values of p without hit and trial.

Akshay Bodhare - 6 years, 5 months ago

Log in to reply

You need elliptic curves to solve the Diophantine 1 2 + 2 2 + + x 2 = y 2 1^{2}+2^{2}+\ldots+x^{2} = y^{2} . It is a somewhat well-known problem called the cannonball problem .

Jake Lai - 6 years, 2 months ago

I also got the expression of p but was unable to find values of P. well done Akshay Bodhare

Anish Kelkar - 6 years, 5 months ago

Log in to reply

@Anish Kelkar I got it by hit and trial.Nothing special.Just lucky.

Akshay Bodhare - 6 years, 5 months ago

did same ....

Dev Sharma - 5 years, 6 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...