Discover

'De Moivre's formula', named after Abraham de Moivre, states that for any complex number (and, in particular, for any real number) ''x'' and any integer ''n'' it holds that
:$left(cos\; x+isin\; x$
ight)^n=cosleft(nx
ight)+isinleft(nx
ight).,
The formula is important because it connects complex numbers (''i'' stands for the imaginary unit) and trigonometry. The expression "cos ''x'' + ''i'' sin ''x''" is sometimes abbreviated to "cis ''x''".
By expanding the left hand side and then comparing the real and imaginary parts, it is possible to derive useful expressions for cos(''nx'') and sin(''nx'') in terms of cos(''x'') and sin(''x''). Furthermore, one can use this formula to find explicit expressions for the ''n''-th roots of unity, that is, complex numbers ''z'' such that ''zⁿ'' = 1.

Contents

Derivation

Proof by induction

Generalization

Applications

See also

Derivation

Although historically proved earlier, de Moivre's formula can easily be derived from Euler's formula
:$e^\{ix\}\; =\; cos\; x\; +\; isin\; x,$
and the exponential law
:$left(\; e^\{ix\}$
ight)^n = e^{inx} .,
Then, by Euler's formula,
:$e^\{i(nx)\}\; =\; cos(nx)\; +\; isin(nx),$.

Proof by induction

We consider three cases.
For ''n'' > 0, we proceed by mathematical induction. When ''n'' = 1, the result is clearly true. For our hypothesis, we assume the result is true for some positive integer ''k''. That is, we assume
:$left(cos\; x\; +\; i\; sin\; x$
ight)^k = cosleft(kx
ight) + i sinleft(kx
ight). ,
Now, considering the case ''n'' = ''k'' + 1:
:$$
egin{alignat}{2}
left(cos x+isin x
ight)^{k+1} & = left(cos x+isin x
ight)^{k} left(cos x+isin x
ight)\
& = left[cosleft(kx
ight) + isinleft(kx
ight)
ight] left(cos x+isin x
ight) qquad mbox{by the induction hypothesis}\
& = cos left(kx
ight) cos x - sin left(kx
ight) sin x + i left[cos left(kx
ight) sin x + sin left(kx
ight) cos x
ight]\
& = cos left[ left(k+1
ight) x
ight] + isin left[ left(k+1
ight) x
ight] qquad mbox{by the trigonometric identities}
end{alignat}

We deduce that the result is true for ''n'' = ''k'' + 1 when it is true for ''n'' = ''k''. By the principle of mathematical induction it follows that the result is true for all positive integers ''n''≥1.
When ''n'' = 0 the formula is true since $cos\; (0x)\; +\; isin\; (0x)\; =\; 1\; +\; i0\; =\; 1$, and (by convention) $z^0\; =\; 1$.
When ''n'' < 0, we consider a positive integer ''m'' such that ''n'' = −''m''. So
:$$
egin{alignat}{2}
left(cos x + isin x
ight)^{n} & = left(cos x + isin x
ight)^{-m}\
& = rac{1}{left(cos x + isin x
ight)^{m}}\
& = rac{1}{left(cos mx + isin mx
ight)}\
& = cosleft(mx
ight) - isinleft(mx
ight)\
& = cosleft(-mx
ight) + isinleft(-mx
ight)\
& = cosleft(nx
ight) + isinleft(nx
ight).
end{alignat}

Hence, the theorem is true for all integer values of ''n''.

Generalization

The formula is actually true in a more general setting than stated above: if ''z'' and ''w'' are complex numbers, then
:$left(cos\; z\; +\; isin\; z$
ight)^w
is a multivalued function while
:$cos\; (wz)\; +\; i\; sin\; (wz),$
is not. Therefore one can state that
:$cos\; (wz)\; +\; i\; sin\; (wz)\; ,$     is one value of     $left(cos\; z\; +\; isin\; z$
ight)^w,.

Applications

This formula can be used to find the $n^\{th\}$ roots of a complex number. If $z$ is a complex number, written in polar form as
: $z=rleft(cos\; x+isin\; x$
ight),,
then
: $$
z^{1/n} = left[ rleft( cos x+isin x
ight)
ight]^{1/n} = r^{1/n} left[ cos left( rac{x+2kpi}{n}
ight) + isin left( rac{x+2kpi}{n}
ight)
ight]

where $k$ is an integer, to get the $n$ different roots of $z$ one only needs to consider values of $k$ from $0$ to $n-1$.

See also

★ Euler's formula

★ Root of unity