f ( x ) = x 1 5 0 + x 1 4 9 + x 1 4 8 + ⋯ + x + 1
Let x 1 , x 2 … x 1 5 0 be the roots of the equation f ( x ) = 0 .
Then find the value of
1 ≤ i < j ≤ 1 5 0 ∑ ( 1 − x i ) ( 1 − x j ) 1
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.
Doesn't cyclotomic polynomials trivialize this problem?
Log in to reply
Can you elaborate on this?
Log in to reply
See here: http://en.wikipedia.org/wiki/Root of unity#cyclotomicpolynomials
Log in to reply
@Richard Ritz – can you show the working which trivialize the problem?
But how did you arrive at (x^151 - 1)/( x-1)= 0?
Log in to reply
Let S = x 1 5 0 + x 1 4 9 + ⋯ + x + 1 , then multiply by x : S x = x 1 5 1 + x 1 5 0 + ⋯ + x 2 + x . Subtract these two expressions, solve for S and you get the result. This is the sum of a geometric progression.
Log in to reply
Hey thanks! Yes- I had studied GP back in school but had completely forgotten about this! (Part of the reason I decided to join this online community) Thanks a ton, mate :)
Since x 1 , x 2 , x 3 … x 1 5 0 are the roots f ( x ) = 0 . It implies that f ( x ) = ( x − x 1 ) ( x − x 2 ) … ( x − x 1 5 0 ) .
It's easily observable that by differentiating f ( x ) twice w.r.t x . We get,
f ′ ′ ( x ) = 2 f ( x ) ( 1 ≤ i < j ≤ 1 5 0 ∑ ( x − x i ) ( x − x j ) 1 )
So, 1 ≤ i < j ≤ 1 5 0 ∑ ( 1 − x i ) ( 1 − x j ) 1 = 2 f ( 1 ) f ′ ′ ( 1 )
But, f ( 1 ) = 1 5 1 number of 1’s 1 + 1 + … + 1 = 1 5 1
And f ′ ′ ( x ) = 1 5 0 × 1 4 9 x 1 4 8 + 1 4 9 × 1 4 8 x 1 4 7 + … + 2 × 1 . So, f ′ ′ ( 1 ) = 1 5 0 × 1 4 9 + 1 4 9 × 1 4 8 … + 2 × 1 = 1 1 2 4 9 5 0
So, therefore
1 ≤ i < j ≤ 1 5 0 ∑ ( 1 − x i ) ( 1 − x j ) 1 = 2 × 1 5 1 1 1 2 4 9 5 0 = 3 7 2 5
Vieta is all you need.
Note that ∏ k = 1 1 5 0 ( 1 − x k ) = f ( 1 ) = 1 5 1 , so that the sum we seek is 1 5 1 1 ∑ i < j ∏ k = i , j ( 1 − x k ) . If we consider the polynomial g ( x ) = x 1 5 1 − 1 , with the additional root x 0 = 1 , then the sum we seek is 1 5 1 1 ∑ i < j < p ∏ k = i , j , p ( 1 − x k ) , a symmetric polynomial of degree 148 in the 151st roots of unity. The constant term of this polynomial is 1 5 1 1 ( 3 1 5 1 ) = 3 7 2 5 , and all the elementary symmetric polynomials of degree 1 through 150 vanish, by Viete.
the sum we want é S = 1 5 1 ( 1 4 8 1 5 0 ) + ( 1 4 7 1 4 9 ) + ⋯ + ( 0 2 )
or S = 1 5 1 ( 1 4 8 1 5 1 ) = 3 7 2 5 .
Problem Loading...
Note Loading...
Set Loading...
We are going to find a polynomial with roots t = 1 − x 1 , so solving for x :
x = t t − 1
The equation is x − 1 x 1 5 1 − 1 = 0 for x = 1 , so t = 0 :
t t − 1 − 1 ( t t − 1 ) 1 5 1 − 1 = 0
t 1 5 1 − ( t − 1 ) 1 5 1 = 0
If we expand it using the binomial theorem, we get:
( 1 1 5 1 ) t 1 5 0 − ( 2 1 5 1 ) t 1 4 9 + ( 3 1 5 1 ) t 1 4 8 + ⋯ = 0
By Vieta's formulas, the sum we want is coefficient of t 1 5 0 coefficient of t 1 4 8 :
( 1 1 5 1 ) ( 3 1 5 1 ) = 1 5 1 2 × 3 1 5 1 × 1 5 0 × 1 4 9
6 1 5 0 × 1 4 9 = 3 7 2 5
In general, for the equation x n + x n − 1 + ⋯ + x + 1 = 0 , the sum is 6 n ( n − 1 )