Originally Posted by

**Ideasman** Thanks for the proof, TPH, but I have to prove

"Suppose that m is an int. and has primitive roots; then, we know that the product of the pos. integers less than m and also relatively prime to m is congruent to -1 (mod m). (Notice that if m were prime, this would just be Wilson’s Theorem)."

That part.

The professor, then, suggests to prove that by using the following:

"This idea then leads to this next theorem which you may want to use in your proof: Theorem: If m (composite or prime) has a primitive root r,

then r^(phi(m)/2) = -1 (mod m)"

So using THAT, you prove the first theorem that I need to find a proof for.