# Primitive root of unity in finite fields

To find a primitive $n$-th root of unity in a field $F_q$ of size $q$, one takes the smallest positive integer $m$ such that $q^m \equiv 1 \bmod n$ and finds a primitive $n$-th root of unity in $\mathbb{F}_{q^m}$ by the formula $$\beta = \alpha^{\frac{q^m-1}{n}},$$ where $\alpha$ is a primitive element of $\mathbb{F}_{q^m}$.

But what is the reasoning behind this formula?

• It's just group theory: if $G$ is a cyclic group of order $N$, with generator $g$, and $d|N$, the power $g^{N/d}$ has order $d$ in $G$. For you, $G = F_{q^m}^\times$. – KCd Jan 2 '15 at 17:29
• Read this question, its answers and the comments on the question and answers. – Dilip Sarwate Jan 2 '15 at 17:33
• ok, thank you, I think i get it – Isostorm Jan 2 '15 at 18:26

Hint: in any group, $$\text{ord}(\alpha^k) = \frac{\text{ord}(\alpha)}{\text{gcd}(\text{ord}(\alpha), k)}.$$
• Why not just: $\text{ord}(\alpha^k) = \frac{\text{ord}(\alpha)}{ k}$. – Isostorm Jan 2 '15 at 18:28
• The expression on the right doesn't always make sense. Let's see, mod 5 the number 2 has order 4, so is the order of $2^3 \bmod 5$ equal to $4/3$? – KCd Jan 2 '15 at 18:45