Multiplicative group of a finite prime field is cyclic

From Groupprops

Statement

In the language of modular arithmetic

Let p be a prime number. Then, the multiplicative group modulo p is a cyclic group of order p1. In other words, it is isomorphic to the group of integers modulo p1.

A generator for this multiplicative group is termed a primitive root modulo p. While the theorem states that primitive roots exist, there is no procedure or formula known for obtaining a primitive root.

In the language of fields

The multiplicative group of a prime field is a cyclic group.

Related facts

For fields

For commutative rings

Noncommutative analogues

Examples

The prime 2

The multiplicative group modulo 2 is the trivial group, so this is not an interesting case.

The prime 3

The multiplicative group modulo 3 is of order two, and the element 2 is a primitive root in this case.

The prime 5

The multiplicative group modulo 5 is of order four. The element 2 is a primitive root. The powers of 2 include all elements: 20=1,21=2,22=4,23=3.

3 is also a primitive root. Its powers are 30=1,31=3,32=4,33=2.

The prime 7

The multiplicative group modulo 7 is of order six. 2 is not a primitive root: it has order 3, and its powers only include 1,2,4. On the other hand, 3 is a primitive root, with 30=1,31=3,32=2,33=6,34=4,35=5.

Facts used

  1. Multiplicative group of a field implies every finite subgroup is cyclic

Proof

The proof follows directly from fact (1).