Intuition What this page is for
The parent note gave you the machinery: z n = 1 has n solutions z k = e i 2 π k / n , they sit on
the unit circle as a regular n -gon, they sum to zero, and multiplying by ω = e i 2 π / n
rotates by one step. Here we stress-test that machinery against every kind of question an exam
(or reality) can throw: different n , right-hand sides that aren't 1 , negative and complex
targets, degenerate cases, and one word problem. Guess before you read the steps.
Prerequisites we lean on: Polar Form of Complex Numbers , De Moivre's Theorem ,
Argand Diagram , and the parent Roots of Unity topic note .
Definition Notation used on this page: modulus
r and argument θ
For a complex number z = x + y i we write its modulus (distance from the origin on the
Argand Diagram ) as r = ∣ z ∣ = x 2 + y 2 — a non-negative real number — and its
argument (the angle its arrow makes with the positive real axis) as θ = arg ( z ) . Then
z = r ( cos θ + i sin θ ) = r e i θ (see Polar Form of Complex Numbers ). Every
time you read "r n = ∣ a ∣ " below, r is just this length of the unknown root , and ∣ a ∣ is the
length of the target . Keeping length and angle separate is the whole trick.
Every question about roots of unity (or its cousin z n = a ) falls into one of these cells. The
worked examples below each carry a tag like [Cell 3] so you can see the coverage is complete.
#
Case class
What makes it different
Example
1
Plain z n = 1 , small n
just plug k = 0 … n − 1
(A)
2
z n = a , a > 0 real
scale roots by r = a 1/ n
(B)
3
z n = a , a < 0 real
target angle is π , not 0
(C)
4
z n = a , a complex (incl. non-QI)
target has a non-trivial angle; quadrant care
(D)
5
Algebra with ω (identities)
reduce exponents mod n , use 1 + ω + ω 2 = 0
(E)
6
Sum / product of roots
geometric series, Vieta
(F)
7
Degenerate targets : n = 1 , 2 and a = 0
polygon collapses to a point / segment / origin
(G)
8
Primitive vs non-primitive (g cd )
which roots regenerate all others
(H)
9
Word problem (real-world)
translate physics into z n = a
(I)
10
Exam twist (nested / limiting)
( 1 − ω ) ( 1 − ω 2 ) ⋯ type
(J)
5th roots of unity and confirm they form a regular pentagon.
Forecast: how many points? What angle separates neighbours? (Guess: 5 points, 7 2 ∘ apart.)
Write the formula z k = e i 2 π k /5 for k = 0 , 1 , 2 , 3 , 4 .
Why this step? z 5 = 1 means modulus r = 1 and argument 5 θ = 2 π k , so θ = 2 π k /5 .
Convert each angle to degrees: 0 ∘ , 7 2 ∘ , 14 4 ∘ , 21 6 ∘ , 28 8 ∘ .
Why this step? Degrees make the spacing visible — each step is 36 0 ∘ /5 = 7 2 ∘ .
Plot them on the Argand Diagram (see figure). Consecutive points are equal chords apart, so they are the vertices of a regular pentagon (a regular polygon ).
Why this step? Equal angular spacing on a circle ⇒ equal chord lengths ⇒ regular polygon.
Figure A — Five pink dots at 0 ∘ , 7 2 ∘ , 14 4 ∘ , 21 6 ∘ , 28 8 ∘ on the unit circle, joined by blue edges into a regular pentagon; yellow spokes from the origin show each is a unit-length vector. Read off that neighbours differ by exactly 7 2 ∘ .
Verify: The five angles sum-check via symmetry: their vector sum should be 0 . Numerically
∑ k cos ( 72 k ∘ ) = 0 and ∑ k sin ( 72 k ∘ ) = 0 . ✓
z 4 = 16 .
Forecast: the answers to z 4 = 1 are 1 , i , − 1 , − i (a unit square). What changes when the target is 16 ? (Guess: same square, but radius 1 6 1/4 = 2 .)
Write 16 = 16 e i ⋅ 0 in polar form. Why this step? Powers are trivial in polar form (De Moivre).
Match modulus: r 4 = 16 ⇒ r = 1 6 1/4 = 2 . Why this step? r ≥ 0 real, so take the real 4th root.
Match argument: 4 θ = 2 π k ⇒ θ = 2 π k , k = 0 , 1 , 2 , 3 . Why this step? Same angle set as the 4th roots of unity — the target's angle is 0 .
Assemble: z k = 2 e iπ k /2 = 2 , 2 i , − 2 , − 2 i . Why this step? Root of z n = a = (real radius) × (n th root of unity).
Verify: 2 4 = 16 , ( 2 i ) 4 = 16 i 4 = 16 , ( − 2 ) 4 = 16 , ( − 2 i ) 4 = 16 . ✓ Sum = 0 (symmetric square). ✓
z 3 = − 1 .
Forecast: Is z = − 1 a solution? Yes — but there must be three . Where are the other two? (Guess: a triangle, one vertex at − 1 , rotated so its "start angle" is π /3 .)
Write − 1 = 1 ⋅ e iπ . Why this step? A negative real number sits at angle π (pointing left), not 0 — this is the whole point of Cell 3.
Modulus: r 3 = 1 ⇒ r = 1 . Why this step? ∣ − 1∣ = 1 , so all roots are on the unit circle.
Argument: 3 θ = π + 2 π k ⇒ θ = 3 π + 3 2 π k , k = 0 , 1 , 2 . Why this step? The target angle π carries into the numerator — this shifts every root by π /3 compared with z 3 = 1 .
Evaluate:
k = 0 : θ = 3 π = 6 0 ∘ ⇒ 2 1 + 2 3 i .
k = 1 : θ = π = 18 0 ∘ ⇒ − 1 .
k = 2 : θ = 3 5 π = 30 0 ∘ ⇒ 2 1 − 2 3 i .
Why this step? Convert each polar form back to cos θ + i sin θ .
Figure C — Solid blue triangle: the three roots of z 3 = − 1 at 6 0 ∘ , 18 0 ∘ , 30 0 ∘ (pink dots, yellow spokes). Dashed white triangle: the roots of z 3 = 1 at 0 ∘ , 12 0 ∘ , 24 0 ∘ . The solid triangle is the dashed one rotated by 6 0 ∘ — that is what the target angle π does.
Verify: ( 2 1 + 2 3 i ) 3 = − 1 (check below), ( − 1 ) 3 = − 1 . ✓ The triangle for z 3 = − 1 is the z 3 = 1 triangle rotated by 6 0 ∘ . ✓
Definition Getting the target angle right (quadrant care)
When a = p + q i , its argument is not blindly arctan ( q / p ) : the plain arctan only ever
returns angles in ( − 9 0 ∘ , 9 0 ∘ ) , so it silently assumes a lies in the right half-plane.
The safe rule is the two-argument angle atan2 ( q , p ) , which looks at the signs of
both p and q to place a in the correct quadrant (e.g. a = − 3 − 4 i sits in QIII near
− 12 7 ∘ , not the arctan answer of 5 3 ∘ ). You must check the quadrant every time.
Worked example (D1, QI target) Solve
z 2 = 3 + 4 i .
Forecast: Two answers, negatives of each other. Modulus of each is ∣3 + 4 i ∣ = 5 . (Guess before finding the angle.)
Modulus of target: ∣3 + 4 i ∣ = 3 2 + 4 2 = 25 = 5 . Why this step? We must know the length before we can halve the angle and root the length.
Root the modulus: r 2 = 5 ⇒ r = 5 . Why this step? ∣ z ∣ 2 = ∣ z 2 ∣ , so ∣ z ∣ = 5 .
Argument via atan2 : since 3 + 4 i is in QI (both parts positive), θ target = atan2 ( 4 , 3 ) ≈ 53.1 3 ∘ ; solutions have ϕ = 2 θ + 18 0 ∘ k , k = 0 , 1 . Why this step? Squaring doubles the angle, so halving undoes it — and adding 18 0 ∘ gives the second root. Using atan2 (not bare arctan ) guarantees the quadrant is right.
Instead of trig, guess z = c + d i with c 2 − d 2 = 3 , 2 c d = 4 . Solving: c = 2 , d = 1 . So z = ± ( 2 + i ) . Why this step? For n = 2 the "component" method is faster and exact — and dodges all angle-quadrant worries.
Verify: ( 2 + i ) 2 = 4 + 4 i + i 2 = 4 + 4 i − 1 = 3 + 4 i . ✓ And ( − 2 − i ) 2 = ( 2 + i ) 2 = 3 + 4 i . ✓
Worked example (D2, non-QI target — why
atan2 matters) Solve z 2 = − 3 − 4 i .
Forecast: the target lies in QIII (both parts negative). If you blindly used arctan ( − 3 − 4 ) = arctan 3 4 ≈ 5 3 ∘ , you'd place the target in QI and get the wrong roots. Where should it really point? (Guess: near − 12 7 ∘ , i.e. down-left.)
Modulus of target: ∣ − 3 − 4 i ∣ = ( − 3 ) 2 + ( − 4 ) 2 = 25 = 5 . Why this step? Length ignores sign, so it's the same 5 as in D1 — only the direction differs.
Root the modulus: r 2 = 5 ⇒ r = 5 . Why this step? ∣ z ∣ = ∣ z 2 ∣ = 5 , same as before.
Correct argument: atan2 ( − 4 , − 3 ) ≈ − 126.8 7 ∘ (QIII), not the bare-arctan value 5 3 ∘ . Halving: ϕ ≈ − 63. 4 ∘ or ϕ + 18 0 ∘ ≈ 116. 6 ∘ . Why this step? This is the whole reason atan2 exists — bare arctan cannot tell − 3 − 4 i (QIII) from 3 + 4 i (QI), yet their square roots are completely different arrows.
Component method as a clean check: guess z = c + d i with c 2 − d 2 = − 3 , 2 c d = − 4 . Solving gives c = 1 , d = − 2 (and its negative). So z = ± ( 1 − 2 i ) . Why this step? Exact integers confirm the trig without rounding.
Verify: ( 1 − 2 i ) 2 = 1 − 4 i + 4 i 2 = 1 − 4 i − 4 = − 3 − 4 i . ✓ And ( − 1 + 2 i ) 2 = − 3 − 4 i . ✓ Note arg ( − 3 − 4 i ) is in QIII, so bare arctan would have failed. ✓
Definition "Primitive" cube root, previewed (full treatment in Cell H)
Below, ω means a cube root of unity other than 1 — that is, one of
− 2 1 ± 2 3 i . Such a root is called primitive because its powers
ω 0 , ω 1 , ω 2 sweep out all three cube roots before repeating. All we actually
need here are the identities it satisfies: ω 3 = 1 and 1 + ω + ω 2 = 0 . (The general
rule for what makes a root primitive is unpacked properly in Cell H below.)
ω a primitive cube root of unity, simplify ( 1 − ω ) ( 1 − ω 2 ) .
Forecast: answers to these are almost always small integers. Guess: 3 ? (We'll confirm, and Cell J proves the general rule ∏ k = 1 n − 1 ( 1 − ω k ) = n .)
Expand: ( 1 − ω ) ( 1 − ω 2 ) = 1 − ω − ω 2 + ω 3 . Why this step? Just multiply out; then we can hit each term with a known identity.
Use ω 3 = 1 : the last term becomes 1 . Why this step? Reduce exponents mod 3 — ω 3 is a full loop back to 1 .
Use 1 + ω + ω 2 = 0 ⇒ − ω − ω 2 = 1 . Why this step? The defining cube-root identity collapses the middle two terms.
Combine: 1 + ( − ω − ω 2 ) + 1 = 1 + 1 + 1 = 3 . Why this step? Add the three cleaned-up pieces.
Verify: Substitute ω = − 2 1 + 2 3 i numerically — the product is 3 , matching the general rule ∏ k = 1 n − 1 ( 1 − ω k ) = n with n = 3 (proved in Cell J). ✓
6th roots of unity, compute (i) their sum, (ii) their product.
Forecast: sum of any n roots (n ≥ 2 ) is 0 . Product of the 6 roots — is it + 1 or − 1 ?
Sum: by the Geometric Series argument, ∑ k = 0 5 ω k = ω − 1 ω 6 − 1 = ω − 1 0 = 0 . Why this step? ω 6 = 1 kills the numerator; ω = 1 keeps the denominator alive.
Product via Vieta on z 6 − 1 = 0 : write the polynomial as z 6 + 0 z 5 + ⋯ + 0 z + c 0 , where c 0 is the constant term (here c 0 = − 1 ) and the leading coefficient is 1 . Vieta's rule says the product of all n roots of a monic degree-n polynomial equals ( − 1 ) n c 0 . So product = ( − 1 ) 6 ⋅ ( − 1 ) = − 1 . Why this step? Multiplying out ∏ ( z − z k ) shows the constant term is ( − 1 ) n ∏ z k ; matching it to c 0 gives the product directly, no need for any off-page formula.
Geometric check: the six roots pair into { 1 , − 1 } , { e iπ /3 , e − iπ /3 } , { e i 2 π /3 , e − i 2 π /3 } . The pair 1 ⋅ ( − 1 ) = − 1 ; each conjugate pair multiplies to ∣ z ∣ 2 = 1 . Total − 1 . Why this step? Cross-checks Vieta geometrically without leaving this page.
Verify: Numerically ∏ k = 0 5 e i 2 π k /6 = − 1 and the sum is 0 . ✓ (For odd n , c 0 = − 1 still but ( − 1 ) n = − 1 gives product + 1 ; e.g. n = 3 : 1 ⋅ ω ⋅ ω 2 = ω 3 = 1 .) ✓
Worked example Handle the degenerate cases: (i)
z 1 = 1 , (ii) z 2 = 1 , (iii) z n = 0 .
Forecast: for n = 1 one root; for n = 2 two roots; for target 0 , one root repeated. No polygon in the usual sense.
n = 1 : z 1 = 1 ⇒ z = 1 . Just { 1 } . Why this step? Only k = 0 is allowed (k = 0 … n − 1 = 0 ). The polygon collapses to a single point.
n = 2 : z k = e iπ k , k = 0 , 1 ⇒ z = 1 , − 1 . Why this step? Two points 18 0 ∘ apart — the "2-gon" is a diameter (line segment), not an area.
Target a = 0 : z n = 0 ⇒ z = 0 only, a single root of multiplicity n . Why this step? ∣ z ∣ n = 0 ⇒ r = 0 , so there's no circle to spread points around — all n roots pile up at the origin. The angle is undefined, which is fine because there is nothing to point.
Sum check: for n = 1 , the sum is 1 (the "sum = 0 " rule needs n ≥ 2 ); for n = 2 , 1 + ( − 1 ) = 0 ; for z n = 0 , the sum of roots (all 0 ) is 0 too. Why this step? Reminds you the sum-is-zero identity has a boundary case: it fails only for n = 1 .
Verify: 1 1 = 1 ; 1 2 = 1 , ( − 1 ) 2 = 1 ; 0 n = 0 ; and 1 + ( − 1 ) = 0 but the n = 1 sum is 1 = 0 . ✓
Definition Primitive root of unity
A root ω k is primitive when its own powers ( ω k ) 0 , ( ω k ) 1 , ( ω k ) 2 , …
run through all n roots before repeating — i.e. it is a generator of the whole set (the full
cyclic group of rotations by 2 π / n ). This happens exactly when g cd( k , n ) = 1 : only then does
stepping by k positions each time visit every one of the n dots before returning home.
6th roots ω 0 , … , ω 5 (where ω = e i 2 π /6 ), which are primitive ?
Forecast: primitivity happens iff g cd( k , 6 ) = 1 . Which k in { 0 , 1 , 2 , 3 , 4 , 5 } satisfy that?
Compute g cd( k , 6 ) for each k : g cd( 0 , 6 ) = 6 , g cd( 1 , 6 ) = 1 , g cd( 2 , 6 ) = 2 , g cd( 3 , 6 ) = 3 , g cd( 4 , 6 ) = 2 , g cd( 5 , 6 ) = 1 . Why this step? By the definition above, a root regenerates all n exactly when k and n share no common factor.
Primitive ones: k = 1 and k = 5 . Why this step? Only those have g cd= 1 .
Sanity: powers of ω 1 step by 6 0 ∘ each time — hitting all 6 dots. Powers of ω 2 step by 12 0 ∘ — hitting only { k = 0 , 2 , 4 } (a triangle), so it does not regenerate all six. Why this step? Confirms geometrically why g cd matters: the step size must not close up early.
Verify: The number of primitive 6th roots is φ ( 6 ) = 2 (Euler's totient), matching { k = 1 , 5 } . ✓
Worked example A wheel of radius
1 m has 8 evenly spaced reflectors, one at the 3-o'clock position. Model their positions as complex numbers and find the reflector closest to straight up ( 0 , 1 ) .
Forecast: 8 reflectors = 8th roots of unity. "Straight up" is angle 9 0 ∘ . Is there a reflector exactly there? (Guess: 9 0 ∘ is a multiple of 4 5 ∘ .)
Positions: z k = e i 2 π k /8 = e iπ k /4 , k = 0 , … , 7 — angles 0 ∘ , 4 5 ∘ , 9 0 ∘ , … , 31 5 ∘ . Why this step? 8 equal spacings of 36 0 ∘ /8 = 4 5 ∘ = 8th roots of unity, radius 1 m .
"Straight up" = 9 0 ∘ , which is k = 2 : z 2 = e iπ /2 = i , i.e. the point ( 0 , 1 ) . Why this step? 9 0 ∘ = 2 × 4 5 ∘ , so a reflector sits exactly there.
Answer with units: the reflector at ( 0 m , 1 m ) — exactly at the top. Why this step? Convert the complex number i back to physical coordinates in metres.
Verify: z 2 = e iπ /2 = i = 0 + 1 i , matching ( 0 , 1 ) . ✓ There are 8 reflectors and ∑ z k = 0 (the wheel is balanced). ✓
Worked example Prove that
( 1 − ω ) ( 1 − ω 2 ) ( 1 − ω 3 ) ( 1 − ω 4 ) = 5 , where ω = e i 2 π /5 is a primitive 5th root of unity.
Forecast: a product of "1 minus each non-trivial root" of z 5 − 1 . Guess: it equals n = 5 . (This is the famous identity Cell E promised.)
Factor z 5 − 1 = ( z − 1 ) ( z − ω ) ( z − ω 2 ) ( z − ω 3 ) ( z − ω 4 ) . Why this step? Fundamental Theorem of Algebra : the roots are exactly the 5th roots of unity.
Divide by ( z − 1 ) : z − 1 z 5 − 1 = 1 + z + z 2 + z 3 + z 4 = ( z − ω ) ( z − ω 2 ) ( z − ω 3 ) ( z − ω 4 ) . Why this step? The Geometric Series sum removes the trivial root z = 1 , leaving only the non-trivial factors.
Set z = 1 : left side = 1 + 1 + 1 + 1 + 1 = 5 ; right side = ( 1 − ω ) ( 1 − ω 2 ) ( 1 − ω 3 ) ( 1 − ω 4 ) . Why this step? Evaluating the identity at z = 1 turns each factor into exactly the product we want.
Therefore the product = 5 . In general this trick gives ∏ k = 1 n − 1 ( 1 − ω k ) = n — which is exactly what verified Cell E (n = 3 ⇒ 3 ). Why this step? The same argument works for any n : a reusable exam weapon.
Verify: Numerically ∏ k = 1 4 ( 1 − e i 2 π k /5 ) = 5 , and the same rule at n = 3 gives 3 . ✓
Recall Coverage self-check (cover the answers)
Which cell handles a negative real target? ::: Cell 3 — target angle is π , roots shift by π / n .
Why must you use atan2 not arctan for a complex target? ::: arctan only returns QI/QIV angles; atan2 reads both signs to fix the quadrant (see D2, a QIII target).
Why does the sum-is-zero rule need n ≥ 2 ? ::: For n = 1 the only root is 1 , and ω − 1 = 0 breaks the geometric-series step.
What are the roots of z n = 0 ? ::: A single root 0 with multiplicity n (all pile at the origin).
How do you know which powers of ω are primitive? ::: g cd( k , n ) = 1 — the generators of the full set (Cell 8).
The trick for ∏ ( 1 − ω k ) ? ::: Factor z − 1 z n − 1 and set z = 1 to get n (Cell 10).
Mnemonic One line to rule them all
"Scale the length, shift the angle, spin n times." Radius from a 1/ n , start-angle from
arg ( a ) / n (use atan2 !), then step by 2 π / n — that solves every z n = a .