( x + x 1 ) 2 + ( x 2 + x 2 1 ) 2 + ( x 3 + x 3 1 ) 2 + ⋯ + ( x 2 0 1 6 + x 2 0 1 6 1 ) 2
If x 2 + x + 1 = 0 , evaluate the expression above.
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.
Sir how x 3 = 1 ??
Log in to reply
I have added an explanation.
Multiply both the sides by x-1.
Your solutions are really well explained with an uncommon and new approach sir...really love ur solutions. ..+1.
A totally novel approach...nice solution upvoted.
Clearly , We know by cube roots of unity,.....
That x= omega , (omega)^2,.......
Now, evaluating the sum of first 3 expansions (lets call it a triad!!), by using the rules of cube roots of unity,
We get →
1 + 1 + 4 = 6
Now this triad....keeps on repeating itself and hence appears 2016/3 =672 times ......therefore required sum→
672 × 6 = 4032...{ans.}
x 2 + x + 1 = 0 implies that x + x 1 = − 1 .
If θ = 3 2 π and x = cos θ + i sin θ , then x + x 1 = 2 cos θ = − 1 .
Now, x n + x n 1 = 2 cos n θ = 2 cos 3 2 n π = { ± 2 ± 1 if n = 3 k if n = 3 k . So ( x n + x n 1 ) 2 = { 4 1 if n = 3 k if n = 3 k .
Hence the desired answer is ( 1 + 1 + 4 ) × 3 2 0 1 6 = 4 0 3 2 .
Nice approach using De moivre's solution.
Take x = w(omega) So x+1/x = -1 But x^3n = 1 Therefore Answer( 1+1+4)*2016/3
L e t f ( n ) = X n + X n 1 . X 2 + X + 1 = 0 , ⟹ x + X 1 = − 1 , ⟹ f ( 1 ) = − 1 . . . . ∗ ∗ ∴ { f ( 1 ) } 2 = 1 f ( 2 ) + 2 = f ( 1 ) 2 , ⟹ f ( 2 ) = − 1 . ∴ { f ( 2 ) } 2 = 1 f ( 3 ) + 3 ∗ 1 ∗ f ( 1 ) = f ( 1 ) 3 = − 1 , ⟹ f ( 3 ) = 2 ∴ { f ( 3 ) } 2 = 4 { f ( 2 ) } 2 = f ( 4 ) + 2 = 1 , ⟹ f ( 4 ) = − 1 ∴ { f ( 4 ) } 2 = 1 f ( 2 ) ∗ f ( 3 ) = − 2 , b u t f ( 2 ) ∗ f ( 3 ) = f ( 5 ) − f ( 1 ) = f ( 5 ) − ( − 1 ) ∴ { f ( 5 ) } 2 = 1 f ( 3 ) 2 = f ( 6 ) + 2 , b u t f ( 3 ) 2 = 4 , ∴ { f ( 6 ) } 2 = 4 ∴ t h i s i s c y c l i c f u n c t i o n w i t h p e r i o d 3 . ∴ f ( n ≡ 1 o r 2 ( m o d 3 ) ) 2 = 1 , a n d f ( n ≡ 0 ( m o d 3 ) ) = 4 ⟹ e a c h c y c l e o f 3 a d d s 6 . 3 ∣ 2 0 1 6 , ∴ T o t a l = 2 ∗ 2 0 1 6 = 4 0 3 2
Just take x as a cube root of unity . Then its easy
Problem Loading...
Note Loading...
Set Loading...
x 2 + x + 1 x 3 + x 2 + x x 3 + x 2 + x + 1 x 3 + 0 ⟹ x 3 = 0 Multiply both sides by x = 0 Add 1 both sides = 0 + 1 = 1 = 1
Also we have:
x 2 + x + 1 x + 1 + x 1 x + x 1 x 2 + x 2 1 x 3 + x 3 1 = 0 = 0 = − 1 = ( x + x 1 ) 2 − 2 = − 1 = 1 + 1 = 2
Since x 3 = 1 ⟹ x n + x n 1 = { 2 − 1 if n ≡ 0 (mod 3) if n ≡ 0 (mod 3)
S = ( x + x 1 ) 2 + ( x 2 + x 2 1 ) 2 + ( x 3 + x 3 1 ) 2 + ⋯ + ( x 2 0 1 6 + x 2 0 1 6 1 ) 2 = 1 + 1 + 4 + 1 + 1 + 4 + ⋯ + 4 = 2 0 1 6 ( 1 ) + ( 4 − 1 ) ⌊ 3 2 0 1 6 ⌋ = 2 0 1 6 + 2 0 1 6 = 4 0 3 2