Let Fq be a finite field
with q elements. Its multiplicative group of nonzero elements is
Fq×=Fq∖{0},which is an abelian group
under multiplication.
Theorem (cyclicity of Fq×).
The group Fq× is cyclic of order q−1. Equivalently, there exists γ∈Fq× such that
Fq×={γk:0≤k≤q−2}.Such a generator is often called a primitive element of Fq; it is also a primitive $(q-1)$st root of unity
in the field.
This statement is sometimes recorded as the cyclicity of the finite-field multiplicative group
.
Examples
F5× is cyclic of order 4.
We have F5×={1,2,3,4}. The element 2 generates:
21=2,22=4,23=3,24=1(mod5),so F5×=⟨2⟩.
F7× is cyclic of order 6.
Here F7×={1,2,3,4,5,6} and 3 is a generator:
3,32=2,33=6,34=4,35=5,36=1(mod7),so every nonzero element is a power of 3.
F8× has prime order 7.
Since ∣F8×∣=8−1=7 is prime, every element of F8× other than 1 has order 7, hence is a generator. For instance, if F8≅F2[α]/(f(α)) for some irreducible cubic f over F2 (as in finite-field existence
), then α=1 and therefore F8×=⟨α⟩.