Statement
Let
be a prime number, then the group of units
is a cyclic group of order
.
Proof
Denote
as the Euler totient function.
Facts reliant on
- We know that
,
- It is a standard number theory result that
, so
.
- We know that if
that the order of
divides
by Lagrange's theorem.
Setup
Let
be the number of elements of order
in
of order
, then
What we want to show is that
(so there is an element of order
.
By contradiction
Suppose instead
. Then
We know
. If
then we must have
for some
.
Let
be some element of order
.
Consider the cyclic subgroup
that it generates. It is cyclic of order
so it has
elements of order
.
We know
so there must exist another element
of order
not contained in this subgroup.
But this is a contradiction because
are
distinct solutions to
in
.
But a result from number theory, (also called Lagrange's theorem but unrelated to the Lagrange's theorem of group theory), says otherwise.
Thus, the group is cyclic.
Related statements
Stronger statements
- Group of units modulo prime power is cyclic states that
is cyclic for
prime,
. This is the case
.
Other related statements