= Problem 3. Let n > 2 be an integer. Write the prime factorization (n) = 9...qt. Let g Z with gcd (g, n) = 1. Prove that g is a primitive root modulo n if and only if (n) gk #1 (mod n) for k = 1,..., t. Problem 4. Use the previous problem above to find the least primitive root modulo 191 by hand. Hint: I recommend using fast modular exponentiation to compute g95 mod 191 and so forth. You can do it!