Being brave 1

Algebra Level 5

j = 0 2015 i = 1 2015 x i j \large \displaystyle \sum^{2015}_{j=0} \sum^{2015 }_{i=1} x^{j}_{i}

Consider a polynomial P ( x ) = n = 1 2016 n 2 x 2016 n P(x)=\displaystyle \sum^{2016}_{n=1} n^2x^{2016-n} and { x i } i = 1 2015 \{x_{i}\}_{i=1}^{2015} are the roots of P ( x ) = 0 P(x)=0 .

Find the value of the expression above.


The answer is -4031.

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.

1 solution

Akshay Yadav
Dec 31, 2015

Well Akshat, first of all thanks for sharing such a delightful problem with the community.

Now here is the solution,

First we will construct the polynomial that is given in the question.

P ( x ) = ( 1 ) 2 x 2015 + ( 2 ) 2 x 2014 + . . . + ( 2015 ) 2 x + ( 2016 ) 2 P(x) = (1)^{2}x^{2015}+(2)^{2}x^{2014}+...+(2015)^{2}x+(2016)^{2}

P ( x ) = x 2015 + 4 x 2014 + . . . + 4060225 x + 4064256 \Rightarrow P(x) = x^{2015}+4x^{2014}+...+4060225x+4064256

Note that x 1 , x 2 , x 3 , . . . , x 2015 x_{1},x_{2},x_{3},...,x_{2015} are the roots of the above polynomial,

Now the expression whose value we need to calculate,

j = 0 2015 i = 0 2015 x i j \displaystyle\sum_{j=0}^{2015}\displaystyle\sum_{i=0}^{2015}x_{i}^{j}

i = 0 2015 x i 0 + i = 0 2015 x i 1 + i = 0 2015 x i 2 + . . . + i = 0 2015 x i 2015 \Rightarrow \displaystyle\sum_{i=0}^{2015}x_{i}^{0}+\displaystyle\sum_{i=0}^{2015}x_{i}^{1}+\displaystyle\sum_{i=0}^{2015}x_{i}^{2}+...+\displaystyle\sum_{i=0}^{2015}x_{i}^{2015}

In Newton's Sum Method , we write i = 0 2015 x i j = S j \displaystyle\sum_{i=0}^{2015}x_{i}^{j}=S_{j}

So,

S 0 + S 1 + S 2 + . . . + S 2015 S_{0}+S_{1}+S_{2}+...+S_{2015}

Now applying the Newton's Sum Identities,

( 1 ) S 1 + ( 1 ) ( 4 ) = 0 S 1 = 4 (1)S_{1}+(1)(4)=0 \Rightarrow S_{1}=-4

( 1 ) S 2 + ( 4 ) ( 4 ) + ( 2 ) ( 9 ) = 0 S 2 = 2 (1)S_{2}+(4)(-4)+(2)(9)=0 \Rightarrow S_{2}=-2

( 1 ) S 3 + ( 4 ) ( 2 ) + ( 9 ) ( 4 ) + ( 3 ) ( 16 ) = 0 S 3 = 4 (1)S_{3}+(4)(-2)+(9)(-4)+(3)(16)=0 \Rightarrow S_{3}=-4

( 1 ) S 4 + ( 4 ) ( 4 ) + ( 9 ) ( 2 ) + ( 16 ) ( 4 ) + ( 4 ) ( 25 ) = 0 S 4 = 2 (1)S_{4}+(4)(-4)+(9)(-2)+(16)(-4)+(4)(25)=0 \Rightarrow S_{4}=-2

\vdots

S 2014 = 2 S_{2014}=-2

S 2015 = 4 S_{2015}=-4

Now just adding all the valuse,

2015 + 1008 ( 4 ) + 1007 ( 2 ) \Rightarrow 2015+1008(-4)+1007(-2)

4031 \Rightarrow -4031

I did same.

Nice problem.

Dev Sharma - 5 years, 5 months ago

Log in to reply

Thanks brother !!

Akshat Sharda - 5 years, 5 months ago

Short and simple solution !!

If you prove that { S 2 n 1 } n = 1 1008 = 4 \{S_{2n-1}\}_{n=1}^{1008}=-4 and { S 2 n } n = 1 1007 = 2 \{S_{2n}\}_{n=1}^{1007}=-2 then your solution will be awesome !!

Akshat Sharda - 5 years, 5 months ago

Log in to reply

The roots of this polynomial are complex hence they have a tendency to repeat their values on odd-even powers.

Akshay Yadav - 5 years, 5 months ago

Log in to reply

You did not prove that this is true, and even if what you said is true, it has nothing to do with the question at all.

Pi Han Goh - 5 years, 5 months ago

Log in to reply

@Pi Han Goh I don't know how to prove this, however I have observed this in most of the Newton-Giard identity related questions on Brilliant. Maybe it is related to the conjugate nature of roots.

Akshay Yadav - 5 years, 5 months ago

Log in to reply

@Akshay Yadav No, they are not related and they are irrelevant to the question.

Pi Han Goh - 5 years, 5 months ago

Log in to reply

@Pi Han Goh I would like to know how to prove this! Please guide me!

Akshay Yadav - 5 years, 5 months ago

Assuming the answer is correct, you still have to prove that S odd = 4 S_{\text{odd}} = -4 and S even = 2 S_{\text{even}} = -2 for all positive integer n n .

Pi Han Goh - 5 years, 5 months ago

Log in to reply

I would like to know how to prove it.

Dev Sharma - 5 years, 5 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...