Consider all n -tuples of real numbers, ( x 1 , x 2 , x 3 , . . . , x n ) such that i = 1 ∑ n x i 2 = 1 where n is a positive integer.
Let M n be the maximum value of i = 1 ∑ n i x i over all such n -tuples.
Determine the sum of all integers p , 1 ≤ p ≤ 3 0 0 such that M p is an integer.
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.
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?
Log in to reply
First,we need to understand that the expression will be maximum only when all x i are positive. Now,
i = 1 ∑ n i x i ≤ ( i = 1 ∑ n i 2 ) 2 1 ∗ ( i = 1 ∑ n x i 2 ) 2 1
Thus, M p = ( i = 1 ∑ p i 2 ) 2 1
Since, i = 1 ∑ n x i 2 = 1
Now, we need to find integer values of M p ,which is equal to
( 6 p ( p + 1 ) ( 2 p + 1 ) ) 2 1
Now,for 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 and p = 2 4 .
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.
Log in to reply
You need elliptic curves to solve the Diophantine 1 2 + 2 2 + … + x 2 = y 2 . It is a somewhat well-known problem called the cannonball problem .
I also got the expression of p but was unable to find values of P. well done Akshay Bodhare
Log in to reply
@Anish Kelkar – I got it by hit and trial.Nothing special.Just lucky.
did same ....
Problem Loading...
Note Loading...
Set Loading...
Done exactly the same