## Using complex numbers to evaluate series

Evaluate the following infinite series:

In this post, I will demonstrate how to evaluate series similar to the the Taylor series of a few common functions. Recall the following ordinary Taylor series:

One notices immediately that these Taylor series look very similar to the series problems that I have proposed, but they only use some of the terms. For example, the series is a special case of which is just the sum of every other term in the Taylor series of $e^x$. How might we eliminate half of the terms to obtain the desired result?

First, I will consider a more general series. Suppose the function $G$ can be expressed as the following series: where $a_k$ is some sequence. Then notice that which gives an alternating version of the same series. Thus, if we add $G(x)$ and $G(-x)$, every other term will cancel, and we will have or Similarly, if we subtract $G(x)$ and $G(-x)$, the even terms cancel and the odd terms remain, giving us Great, now we should be able to evaluate our first sum! If we let $G(x)=e^x$, then $a_k=\frac{1}{k!}$, telling us that and, consequently, To evaluate the second sum, we will have to use imaginary numbers and Euler's formula: Now, from Euler's formula, we may say that $e^i=\cos(1)+i\sin(1)$ and $e^{-i}=\cos(1)-i\sin(1)$: With the first two sums out of the way, things get a little bit trickier. We've figured out how to skip every other term of a series using its alternating form, but how can we eliminate two out of every three terms to be left with every third term?

To solve this problem, we must venture again into the realm of complex numbers - consider the complex numbers in the form These numbers have the interesting property that the quantity equals $n$ if $k$ is a multiple of $n$ and equals $0$ otherwise (the proof is easy, so I will omit it). This interesting property can be applied to help solve our problem. Let us define $G$ the same as before: Now consider the following quantity: I already noted that $\omega_n^k+\omega_n^{2k}+...+\omega_n^{nk}$ equals $n$ when $k$ is a multiple of $n$ and zero otherwise, meaning that all terms of the series except for those which are multiples of $n$ will be deleted. Thus, we have or We can use this to evaluate the third sum by letting $a_k=\frac{1}{k!}$, $x=1$, and $G(x)=e^x$. This gives us Now we may use to write and by Euler's formula, this is equal to ...which gives us a value for the third sum!

Now let us return to the trick we used before: This trick allows us to delete all of the terms other than the $a_{nk}x^{nk}$ terms of the sum, but what if we want the $a_{nk+1}x^{nk+1}$ or $a_{nk+2}x^{nk+2}$ terms instead? The key lies in noticing that which deletes all terms except those for which $k-m$ is a multiple of $n$, or the $nk+m$ terms. Thus we have or, since $\omega_n^{-1}=\overline{\omega_n}$, or, more compactly written, Now we may calculate the fourth sum by letting $a_k=\frac{1}{k!}$, $x=\frac{1}{2}$, $G(x)=e^x$, and $m=1$: Yuck!

To evaluate the final sum, we will recall the Taylor series for the natural logarithm: In this case, we will let $G(x)=-\ln(1-x)$, $x=-1$, $a_k=\frac{1}{k}$, $n=3$, and $m=1$. This gives us and

Before I end this post, I would like to quickly demonstrate another method that can be used to evaluate sums involving trigonometric functions by using Euler's formula. Again, suppose that we define a function $G$ as Then we have or, by Euler's formula, Implying that and This is easy to show, but can result in some interesting sums. For example, the following sum can be proven using the former of these two formulae:

That concludes this post!