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.
Nice and elegant solution.
We note that the powers of i k are cyclical such that i k = ⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ 1 i − 1 − i k mod 4 = 0 k mod 4 = 1 k mod 4 = 2 k mod 4 = 3
Similarly, the sum of i k is also cyclical as follows:
S 0 S 1 S 2 S 3 S 4 . . . ⟹ S k = i 0 = 1 = 1 + i = 1 + i − 1 = i = i − i = 0 = 1 = S 0 = . . . = ⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ 1 1 + i i 0 k mod 4 = 0 k mod 4 = 1 k mod 4 = 2 k mod 4 = 3
Since 2 0 0 9 mod 4 = 1 ⟹ S 2 0 0 9 = 1 + i
Thank you for the nice solution.
Problem Loading...
Note Loading...
Set Loading...
S n = i 0 + i 1 + ⋯ + i n − i ⋅ S n = − i 1 − i 2 − ⋯ − i n − i n + 1 Adding both equations S n ( 1 − i ) = 1 − i n + 1 2 S n = ( 1 + i ) ( 1 − i n + 1 ) S n = 2 1 ( 1 + i − i n + 1 + i n ) S 2 0 0 9 = 2 1 ( 1 + i + i − ( − 1 ) ) S 2 0 0 9 = 1 + i