AoPSWiki

Want to learn how to tackle those tough AMC/AIME/Olympiad counting and probability problems? Check out Art of Problem Solving's Intermediate Counting & Probability by David Patrick.

Personal tools

Log in

Search

Toolbox

De Moivre's Theorem

From AoPSWiki

DeMoivre's Theorem is a very useful theorem in the mathematical fields of complex numbers. It allows complex numbers in polar form to be easily raised to certain powers. It states that for $x\in\mathbb{R}$ and $n\in\mathbb{Z}$ , $\left(\cos x+i\sin x\right)^n=\cos(nx)+i\sin(nx)$ .

Proof

This is one proof of De Moivre's theorem by induction.

If $n>0$ , for $n=1$ , the case is obviously true.

Assume true for the case $n=k$ . Now, the case of $n=k+1$ :

Image:DeMoivreInductionP1.gif

Therefore, the result is true for all positive integers $n$ .

If $n=0$ , the formula holds true because $\cos(0x)+i\sin (0x)=1+i0=1$ . Since $z^0=1$ , the equation holds true.

If $n<0$ , one must consider $n=-m$ when $m$ is a positive integer.

Image:DeMoivreInductionP2.gif

And thus, the formula proves true for all integral values of $n$ . $\Box$

Note that from the functional equation $f(x)^n = f(nx)$ where $f(x) = \cos x + i\sin x$ , we see that $f(x)$ behaves like an exponential function. Indeed, Euler's formula states that $e^{ix} = \cos x+i\sin x\right$ . This extends De Moivre's theorem to all $n\in \mathbb{R}$ .

Retrieved from "http://www.artofproblemsolving.com/Wiki/index.php/De_Moivre%27s_Theorem"

Categories: Theorems | Complex numbers

Art of Problem Solving celebrates the many
accomplishments of its students and community members.

© Copyright 2008 AoPS Incorporated. All Rights Reserved. • Foundation • Privacy • Contact Us