Recommended resources
The freely available resources this lesson will direct you to.
Hello! Last lesson, you found every solution of and saw that the solutions share a radius and are equally spaced. Now we will examine the case . These roots of unity do more than make a regular polygon: their positions let you recognise powers, sums and distances without calculating every root from scratch.
The goal is to move fluently between the diagram and the algebra. That is particularly useful when an exam question gives you a root but does not tell you to draw a diagram.
The polygon determined by
The previous lesson’s formula applies with modulus and argument . For a positive integer , the th roots of unity are
They lie on the unit circle, starting at , with an angle of between consecutive points. For , they are the vertices of a regular -gon centred at the origin. For , they are the opposite points and .
Watch the roots-of-unity portion of Roots of Complex Numbers | HSC Extension 2 Mathematics from mcgrathematics. It begins with the fourth roots, then connects their diagram to factorising .
Roots of Complex Numbers | HSC Extension 2 Mathematics
Watch the roots-of-unity segment to see how a known root and equal angular spacing can replace a lengthy calculation.
In fourth roots, focus on why 1 is guaranteed and how the other vertices are located. Continue through the factorisation; we will use that algebraic pattern shortly.
The image below depicts eight equally spaced points, so its particular polygon has angular spacing . The formula gives the spacing for other values of .
The picture includes and because eight is divisible by four; they are not present among the roots for every . Likewise, is a root exactly when is even: it sits halfway through the list of vertices, at angle .
For a concise written derivation of the general result, read the end of “Roots of Unity” and Theorem A.3, “th Roots of Unity,” in 12.A: Complex Numbers from Mathematics LibreTexts. The text uses where we have been writing ; here they denote the same point on the unit circle.
12.A: Complex Numbers - Mathematics LibreTexts
Read the derivation and theorem to connect the diagram with the claim that the list contains every root.
Under “Roots of Unity,” begin just after the expression for z^n=1, where the author says “Comparing absolute values and arguments yields.” Read through Theorem A.3 and its geometric description. Focus on why k=0,\ldots,n-1 gives distinct points and why further values repeat them.
One rotation generates every vertex
For , give the first root after a name:
Multiplying by rotates a point anticlockwise by without changing its distance from the origin. Thus the complete set of roots is
After such rotations, . Powers therefore repeat every steps; for example, . On the diagram, the exponent tells you how many vertex positions to move from , counting anticlockwise.
There is an important qualification in exam wording. Not every root of unity other than generates all roots. The choice does, because its first powers occupy distinct vertices. By contrast, is a sixth root of unity, but its powers alternate between only and . If a question says merely that , do not assume its powers list all roots unless it also identifies as a primitive th root, or gives equivalent information.
The polygon also makes conjugates easy to locate. Reflection in the real axis takes the vertex at angle to the vertex at angle . Hence, for ,
Because every vertex has modulus , its conjugate is also its reciprocal:
These identities are useful checks. If your list of roots of contains a non-real point but omits its reflection, the list is incomplete.
Symmetry becomes an algebraic shortcut
Picture the position vectors from the origin to all the vertices. When , their symmetry suggests that their total is zero. We can prove it without relying on a picture, using the chosen .
Let
Multiplying by shifts every term one place around the polygon. Subtracting the two expressions gives
Since , our chosen , so
This is both a geometric result and the finite geometric-series identity. It also explains why you must check the condition before dividing by .
For the sixth roots, the full sum is zero, but there is more structure. The vertices with even exponents,
are apart: they form the cube roots of unity. Consequently,
The three vertices with odd exponents are the same triangle rotated by . Their sum is therefore also zero:
This is a general problem-solving move: before expanding a sum of powers, ask whether the selected vertices themselves form a smaller regular polygon.
Using the structure in an unfamiliar question
Suppose , so its powers are the six sixth roots of unity. Which of them solve ?
First, any solution of satisfies , so it must appear somewhere in our six-vertex list. Also,
We therefore want the odd exponents. The complete answer is
On the Argand diagram these are alternate vertices of the hexagon. In Cartesian form they are
Notice what made the argument complete: showing that every candidate is a sixth root of unity, then selecting exactly the vertices whose cubes equal . Merely spotting three plausible points on a diagram would not establish that none were missed.
The same diagram can answer a distance question. What is the distance from to ? The points have arguments and , so their position vectors form an isosceles triangle with two sides of length . Equivalently, use their coordinates:
The expression is a chord length on the unit circle, not the length of an arc. For any two roots, the modulus of their difference measures the straight-line distance between their vertices. This gives you a geometric interpretation before you choose whether coordinates or trigonometry will be quicker.
Key takeaways
The th roots of unity are the points for : equally spaced points on the unit circle, beginning at . Choosing lets its powers name the vertices in order. The diagram then reveals conjugate pairs, smaller polygons within the full set, and distances; identities such as and the zero sum turn those observations into concise proofs.
Next, you will use moduli of complex expressions to describe geometric loci. The chord distance is a first glimpse of that idea: a modulus can specify a distance between two points on an Argand diagram.