We have seen that if we take an element of a of Z∗n and begin computing powers of a, then we will eventually cycle back to a. In some cases, we will obtain every element of Z∗n as a power of a. When this happens, a is called a primitive root modulo n. Primitive roots have both theoretical and applied importance. In this chapter, we will determine the values of n for which a primitive root exists.