next Roots of Unity
previous e^(j theta)
up Proof of Euler's Identity   Contents   Global Contents
global_index Global Index   Index   Search


Back to Mth Roots

As mentioned in §3.6, there are $ M$ different numbers $ r$ which satisfy $ r^M=a$. That is, the $ M$th root of $ a$, which is written as $ a^{1/M}$, is not unique--there are $ M$ of them. How do we find them all? The answer is to consider complex numbers in polar form. By Euler's Identity, which we just proved, any number, real or complex, can be written in polar form as

$\displaystyle z = r e^{j\theta}
$

where $ r\geq 0$ and $ \theta\in[-\pi,\pi)$ are real numbers. Since $ e^{j2k\pi}=1$ for every integer $ k$, we also have

$\displaystyle z = r e^{j\theta} e^{j2k\pi}.
$

Taking the $ M$th root (see §3.3) gives

$\displaystyle z^{\frac{1}{M}} =
\left(r e^{j\theta} e^{j2k\pi}\right)^{\frac{1...
...rac{k}{M}}
= r^{\frac{1}{M}} e^{j\frac{\theta+2\pi k}{M}}, \quad k\in {\bf Z}.
$

There are $ M$ different results obtainable using different values of $ k$, e.g., $ k=0,1,2,\dots,M-1$. When $ k=M$, we get the same thing as when $ k=0$. When $ k=M+1$, we get the same thing as when $ k=1$, and so on, so there are only $ M$ distinct cases. Thus, we may define the $ k$th $ M$th root of $ z=r e^{j\theta}$ as $ r^{\frac{1}{M}}
e^{j\frac{\theta+2\pi k}{M}}$, for $ k=0,1,2,\dots,M-1$.


next Roots of Unity
previous e^(j theta)
up Proof of Euler's Identity   Contents   Global Contents
global_index Global Index   Index   Search

``Mathematics of the Discrete Fourier Transform (DFT)'', by Julius O. Smith III, W3K Publishing, 2003, ISBN 0-9745607-0-7.

(Browser settings for best viewing results)
(How to cite this work)
(Order a printed hardcopy)

Copyright © 2003-10-09 by Julius O. Smith III
Center for Computer Research in Music and Acoustics (CCRMA),   Stanford University
CCRMA  (automatic links disclaimer)