Mar 6, 2022 · Our next goal is to show that each prime number has a primitive root (see Theorem 10.6). The proof requires three lemmas and the existence of a primitive root of a prime is given, though a …

Now we generally know how many primitive roots are there modulo n and an interesting property about them but how do we actually find them? Well, you’ll learn how to find them in the exercises!

By Lemma 9.3 we see that in order to exhibit the primitive characters ex-plicitly it suffices to determine the primitive characters (mod pα). Suppose first that p is odd, and let g be a primitive root of pα.

A number g that generates this group is called a primitive root of p; i.e., g is such that every number between 1 and p 1 can be written as a power of g modulo p. Building on prior work in the ACL2 …

We now have the tools to prove our theorem. We will prove slightly more than the existence of primitive roots for primes, we will get a count of how many there are.

4) For each prime in the table, we can find nonzero integers a that are not primitive roots mod p. In each case, if k is the smallest positive integer with ak ≡ 1 (mod p), then k divides p−1.

In essence, the strategy is to prove the previous theorem without assuming that a primitive root exists. That is, we count all the terms in which have a particular order.