In short
De Moivre's theorem states that for any integer n,
In other words, raising a point on the unit circle to the nth power multiplies the angle by n. Combined with the binomial expansion, this gives formulas for \cos(n\theta) and \sin(n\theta) in terms of \cos\theta and \sin\theta. The theorem is the reason complex numbers are so powerful for trigonometry: a single algebraic identity replaces pages of angle-addition algebra.
Try computing (\cos 10° + i\sin 10°)^{36} by hand. Multiplying 36 complex numbers together sounds brutal. But think about what each multiplication does on the unit circle: it adds 10° to the angle. After 36 multiplications the angle reaches 360°, which is a full revolution back to 1. So the answer is just 1. No calculation needed -- just one clean rule that turns exponentiation into angle multiplication.
That rule is De Moivre's theorem. It is short enough to fit on an index card, yet it single-handedly unlocks formulas for \cos(n\theta) and \sin(n\theta) that pages of trigonometric identities cannot reach easily.
The statement
Start with a complex number on the unit circle:
This has modulus 1 and argument \theta. What is z^2?
The moduli multiply: 1 \times 1 = 1. The arguments add: \theta + \theta = 2\theta. So:
What is z^3? Multiply z^2 by z again. Modulus: still 1. Argument: 2\theta + \theta = 3\theta. So:
The pattern is clear. Each multiplication by z adds another \theta to the argument, while the modulus stays at 1. After n multiplications:
De Moivre's Theorem
For any integer n (positive, negative, or zero) and any angle \theta,
In Euler's notation, the theorem is transparent: (e^{i\theta})^n = e^{in\theta}, which is just the law of exponents. The full statement in trigonometric form carries more weight because it connects the exponent n with the multiple angle n\theta — something that is not obvious from \cos and \sin alone.
Proof by mathematical induction (positive integers)
The argument-addition reasoning above is convincing, but a clean inductive proof makes the result airtight.
Base case. When n = 1:
Inductive step. Assume the theorem holds for some positive integer k:
Now compute the (k+1)th power:
Apply the inductive hypothesis to the first factor:
Expand the product:
The real part is \cos(k\theta + \theta) = \cos((k+1)\theta) by the angle-addition formula. The imaginary part is \sin(k\theta + \theta) = \sin((k+1)\theta).
By mathematical induction, the theorem holds for all positive integers n. \square
Extension to zero and negative integers
Case n = 0: (\cos\theta + i\sin\theta)^0 = 1 = \cos(0) + i\sin(0). The theorem holds.
Case n < 0: Write n = -m where m is a positive integer. Then:
Multiply numerator and denominator by the conjugate \cos(m\theta) - i\sin(m\theta):
since \cos^2 + \sin^2 = 1. Now use the identities \cos(-m\theta) = \cos(m\theta) and \sin(-m\theta) = -\sin(m\theta):
So De Moivre's theorem holds for all integers — positive, negative, and zero.
Application 1: Computing powers directly
The most immediate use of De Moivre's theorem is computing high powers of complex numbers. Without it, raising \cos\theta + i\sin\theta to the 10th power would require nine successive multiplications. With it, the answer is instant: \cos(10\theta) + i\sin(10\theta).
For a general complex number z = r(\cos\theta + i\sin\theta), the nth power is:
The modulus gets raised to the nth power; the argument gets multiplied by n.
Application 2: Expressing \cos(n\theta) and \sin(n\theta)
This is the deeper application. De Moivre's theorem, combined with the binomial theorem, lets you express \cos(n\theta) and \sin(n\theta) as polynomials in \cos\theta and \sin\theta.
The idea: expand (\cos\theta + i\sin\theta)^n using the binomial theorem, then separate real and imaginary parts. The real part equals \cos(n\theta) and the imaginary part equals \sin(n\theta).
Take n = 3 as an illustration. By De Moivre:
By the binomial theorem (with c = \cos\theta and s = \sin\theta for brevity):
Equate real and imaginary parts with \cos(3\theta) + i\sin(3\theta):
These are the triple-angle formulas. You can derive them by applying the angle-addition formula twice, but the De Moivre route gives both formulas simultaneously and generalises to any n with no extra work.
Using \sin^2\theta = 1 - \cos^2\theta, the cosine formula becomes:
This is the formula used in solving cubic equations and in Chebyshev polynomials — it expresses \cos(3\theta) purely in terms of \cos\theta.
Interactive: powers on the unit circle
Drag the red point on the unit circle below. The readouts show the angle \theta and the angles 2\theta and 3\theta (modulo 2\pi). Watch how the second and third powers jump ahead on the circle — each power multiplies the angle, wrapping around when it exceeds \pi.
Worked examples
Example 1: Compute $(1 + i)^8$
A power of a complex number with clean modulus and argument. De Moivre's theorem avoids expanding eight nested products.
Step 1. Convert to polar form.
So 1 + i = \sqrt{2}\left(\cos\frac{\pi}{4} + i\sin\frac{\pi}{4}\right).
Why: the point (1, 1) sits in the first quadrant, at 45° from the real axis and distance \sqrt{2} from the origin.
Step 2. Apply De Moivre's theorem with n = 8.
Why: the modulus gets raised to the 8th power and the argument gets multiplied by 8. This is the entire computation — two operations instead of seven multiplications.
Step 3. Simplify.
Why: after eight quarter-turns of \pi/4 each, the angle completes exactly two full rotations and returns to 0 (equivalently 2\pi). The number lands back on the positive real axis, and the modulus 16 tells you how far along it.
Result: (1 + i)^8 = 16.
The answer is a real number. That is no coincidence — eight quarter-turns make two full circles, so the imaginary part vanishes. Without De Moivre's theorem, you would need to expand (1+i)^8 by repeated squaring: (1+i)^2 = 2i, (2i)^2 = -4, (-4)^2 = 16. The theorem tells you the answer instantly and tells you why it is real.
Example 2: Express $\cos(4\theta)$ in terms of $\cos\theta$ alone
The De Moivre plus binomial method applied to derive a multiple-angle formula.
Step 1. Write De Moivre's theorem for n = 4.
Why: the left side will be expanded using the binomial theorem, then the real part gives \cos(4\theta).
Step 2. Expand the left side using the binomial theorem with c = \cos\theta, s = \sin\theta.
Why: recall i^2 = -1, i^3 = -i, i^4 = 1. Each power of i places the term in the real or imaginary group.
Step 3. Collect real and imaginary parts.
Real: c^4 - 6c^2 s^2 + s^4
Imaginary: 4c^3 s - 4cs^3 = 4cs(c^2 - s^2)
So \cos(4\theta) = \cos^4\theta - 6\cos^2\theta\sin^2\theta + \sin^4\theta.
Why: the real part of (\cos\theta + i\sin\theta)^4 equals \cos(4\theta) by De Moivre's theorem. Matching real parts is all that is needed.
Step 4. Replace \sin^2\theta with 1 - \cos^2\theta to express everything in terms of \cos\theta.
Let c = \cos\theta. Then s^2 = 1 - c^2.
Why: expressing the formula purely in \cos\theta is useful for solving equations like \cos(4\theta) = k, which become polynomial equations in \cos\theta.
Result: \cos(4\theta) = 8\cos^4\theta - 8\cos^2\theta + 1.
The bonus formula \sin(4\theta) = 4\cos^3\theta\sin\theta - 4\cos\theta\sin^3\theta comes from the imaginary part of the same expansion. De Moivre's theorem delivers both multiple-angle formulas simultaneously — a single computation replaces two separate derivations.
Common confusions
-
"De Moivre's theorem works for non-integer n too." For integers, the theorem is exact. For rational n = p/q, the formula (\cos\theta + i\sin\theta)^{p/q} = \cos(p\theta/q) + i\sin(p\theta/q) gives only one of the q possible values — the others are the qth roots of unity multiplied in. For irrational n, the expression (\cos\theta + i\sin\theta)^n is multi-valued and the theorem needs careful restatement.
-
"(r\operatorname{cis}\theta)^n = r\operatorname{cis}(n\theta)." Almost — the modulus must be raised to the nth power: (r\operatorname{cis}\theta)^n = r^n\operatorname{cis}(n\theta). Forgetting the r^n and writing just r is a common slip.
-
"I expand (\cos\theta + i\sin\theta)^n without De Moivre, using only the binomial theorem." You can, but the binomial expansion alone gives you a sum of terms with mixed powers of \cos\theta and \sin\theta. De Moivre tells you that this sum collapses to \cos(n\theta) + i\sin(n\theta). Without De Moivre, you have no shortcut — you have to add up all the terms manually.
-
"De Moivre's theorem is just a restatement of Euler's formula." They are closely related. In Euler's notation, (e^{i\theta})^n = e^{in\theta} is a law of exponents, and De Moivre's theorem follows. But in the trigonometric form, the theorem makes an independent statement about \cos and \sin that is valuable even if you never use exponentials.
-
"The n = -1 case gives \cos(-\theta) + i\sin(-\theta) = \cos\theta - i\sin\theta, so the reciprocal of \cos\theta + i\sin\theta is its conjugate." Correct — and this is worth remembering on its own. For any point on the unit circle, the reciprocal is the conjugate, because |z| = 1 implies 1/z = \bar{z}.
Going deeper
If you can state De Moivre's theorem, use it to compute powers, and derive multiple-angle formulas by separating real and imaginary parts of a binomial expansion, you have the core. The material below is for readers who want to see where the theorem leads.
Roots of unity
De Moivre's theorem runs in reverse to find roots. The equation z^n = 1 asks: which points on the unit circle, when raised to the nth power, land at 1? By De Moivre, if z = \cos\theta + i\sin\theta, then z^n = \cos(n\theta) + i\sin(n\theta) = 1 requires n\theta = 2k\pi for integer k, so \theta = 2k\pi/n. The n distinct roots are:
These n points are equally spaced around the unit circle, forming a regular n-gon. The nth Roots of Unity article covers this in full.
Chebyshev polynomials
The formula \cos(n\theta) = T_n(\cos\theta), where T_n is a polynomial of degree n, defines the Chebyshev polynomials of the first kind. De Moivre's theorem is the tool that proves T_n exists and gives a method to compute it for any n. The first few are: T_0(x) = 1, T_1(x) = x, T_2(x) = 2x^2 - 1, T_3(x) = 4x^3 - 3x, T_4(x) = 8x^4 - 8x^2 + 1 (which you just derived in Example 2). These polynomials appear throughout numerical analysis, approximation theory, and signal processing — they are the "best" polynomial approximations in a precise sense.
Connection to the binomial series
For non-integer exponents, the binomial theorem becomes an infinite series, and so does De Moivre's formula. The correct generalisation uses the principal value of the complex logarithm and requires analytic continuation — machinery from complex analysis that goes well beyond JEE. The integer case, which is what you need, is completely rigorous as proved above.
Where this leads next
De Moivre's theorem is the gateway to several deeper topics in complex numbers and trigonometry.
- Polar Form of Complex Numbers — the representation r(\cos\theta + i\sin\theta) that makes De Moivre's theorem possible.
- Argument of Complex Number — the angle \theta that De Moivre multiplies by n.
- nth Roots of Unity — the n equally spaced solutions of z^n = 1, found by running De Moivre's theorem in reverse.
- Trigonometric Identities — Sum and Difference — the angle-addition formulas that De Moivre's theorem generalises to all integers.
- Complex Numbers — Introduction — the foundation: the imaginary unit i and the Cartesian form a + bi.