Find all nth roots of a complex number, roots of unity, plot on unit circle, with rectangular and polar forms.
Every nonzero complex number has exactly n distinct nth roots, equally spaced around a circle in the complex plane. The nth roots of z = r·e^(iθ) are given by w_k = r^(1/n) · e^(i(θ + 2πk)/n) for k = 0, 1, ..., n−1. These roots form a regular n-gon centered at the origin, a beautiful geometric result of De Moivre's theorem.
The special case where z = 1 gives the "roots of unity," which are fundamental in algebra, number theory, signal processing (the Discrete Fourier Transform), and many other fields. The nth roots of unity are the complex numbers e^(2πik/n), whose sum is always zero and whose product is 1 (or −1 for even n roots of −1).
This calculator computes all nth roots for any complex number, entered in either rectangular (a + bi) or polar (r ∠ θ) form. It displays every root in both forms, shows the modulus and argument of each root, identifies the principal root (k=0), and calculates the angular spacing between consecutive roots.
The complex plane visualization plots all roots on a dashed circle, with each root color-coded. The roots table provides full numerical details, and the formula reference covers the essential theory.
Presets include classic examples: cube roots of 1, square root of i, 4th roots of 1, cube roots of 8, 5th roots of −1, and 6th roots of 64. These cover the most common textbook and competition problems.
Whether you are studying abstract algebra, preparing for competitions, or working with Fourier analysis, this tool makes finding and visualizing complex roots straightforward.
Finding the nth roots of a complex number requires converting to polar form, dividing the argument by n, and then generating n evenly-spaced roots around a circle — a multi-step process where angle arithmetic mistakes produce entirely wrong roots. This calculator accepts input in either rectangular (a + bi) or polar (r, θ) form, computes all n roots of any complex number, and displays each root in both rectangular and polar notation. It also plots the roots on the complex plane, showing the symmetric polygon they form, which is invaluable for understanding root-of-unity structure in algebra and signal processing.
w_k = r^(1/n) · [cos((θ + 2πk)/n) + i·sin((θ + 2πk)/n)], k = 0, 1, ..., n−1
Result: w₀ = 1, w₁ = −0.5 + 0.866i, w₂ = −0.5 − 0.866i
The three cube roots of 1 are spaced 120° apart. The principal root is 1 itself, and the other two are the primitive cube roots of unity.
De Moivre's theorem states (r e^{iθ})^n = r^n e^{inθ}. To find the nth root, invert the process: the n roots of z = r e^{iθ} are r^{1/n} e^{i(θ+2πk)/n} for k = 0, 1, …, n−1. These roots are equally spaced on a circle of radius r^{1/n} in the complex plane, separated by 2π/n radians. The principal root (k = 0) has the smallest positive argument, and the rest follow at uniform angular intervals. This geometric regularity is why roots of unity form the vertices of a regular polygon inscribed in the unit circle.
The nth roots of unity — the n solutions to z^n = 1 — are ω^k = e^{2πik/n}. They are the foundation of the Discrete Fourier Transform (DFT), where the DFT matrix is built from powers of ω = e^{-2πi/n}. The Fast Fourier Transform (FFT) exploits the algebraic properties of these roots (specifically, ω^{n/2} = −1 and the halving property) to reduce computation from O(n²) to O(n log n). Roots of unity also underpin number-theoretic transforms used in big-integer multiplication and polynomial multiplication algorithms.
In control engineering, the roots of a system's characteristic polynomial determine stability. Poles inside the unit circle (for discrete systems) or in the left half-plane (for continuous systems) indicate stability. Butterworth filter design places poles at equally-spaced positions on a semicircle, which are roots of a specific polynomial. Bessel and Chebyshev filters modify these positions. Understanding how complex roots distribute on circles and how to extract them is therefore essential for designing stable, well-behaved control systems and digital filters.
The nth roots of unity are the n complex numbers z such that z^n = 1. They are equally spaced on the unit circle at angles 2πk/n.
The principal nth root corresponds to k=0 in the formula, giving the root with the smallest non-negative argument. Use this as a practical reminder before finalizing the result.
Each successive root adds 2π/n to the argument, so they are evenly distributed around a circle of radius r^(1/n). Keep this note short and outcome-focused for reuse.
De Moivre's theorem states (cos θ + i sin θ)^n = cos(nθ) + i sin(nθ), which directly yields the formula for nth roots. Understanding this concept helps you apply the calculator correctly and interpret the results with confidence.
Yes. Any nonzero complex number has exactly n distinct nth roots for any positive integer n.
The sum of all nth roots of unity is always zero, because they form a balanced regular polygon centered at the origin. Apply this check where your workflow is most sensitive.