The Structure of
This section is about the structure of the group
of
units modulo a prime number
.
The main result is that this group is always cyclic.
We will use this result later in Chapter 4
in our proof of quadratic reciprocity.
Definition 2.5 (Primitive root)
A
primitive root modulo an integer
is an element of
of order
.
We will prove that there is a primitive root modulo every
prime
. Since the unit group
has order
, this implies that
is a cyclic group, a fact this will be extremely useful,
since it completely determines the structure of
as a
group.
If
is an odd prime power, then there is a primitive root
modulo
(see Exercise 2.28), but there is no primitive root
modulo the prime power
, and hence none mod
for
(see Exercise 2.27).
Section 2.5.1 is the key input to our proof that
is cyclic; here we show that for every divisor
of
there are exactly
elements of
whose order divides
.
We then use this result in Section 2.5.2 to produce an
element of
of order
when
is a prime power that
exactly divides
(i.e.,
divides
, but
does not
divide
), and multiply together these elements to obtain an element
of
of order
.
SAGE Example 2.5
In SAGE use the primitive_root command to compute the
smallest positive integer that is a primitive root modulo
.
For example, below we compute primitive roots modulo
for
each prime
.
sage: for p in primes(20):
... print p, primitive_root(p)
2 1
3 2
5 2
7 3
11 2
13 2
17 3
19 2
Subsections
William
2007-06-01