2. Show that if and are both primes, then 4[ (mod
Use Wilson's theorem.
3. Let be an odd prime. Prove that if g is primitive root modulo and (mod is not
Use the binomial expansion
See attached file for full problem description.
There are three proofs here that use Fermat's theorem, Wilson's theorem, and binomial expansion.