Fermat's Theorem is a special case of Euler's theorem. The purpose of this question is to demonstrate that Euler's Theorem is not that much stronger...

Fermat's Theorem is a special case of Euler's theorem. The purpose of this question is to demonstrate that Euler's Theorem is not that much stronger than Fermat's Theorem.

Given that p and q are two distinct prime numbers, and a is a positive integer relatively prime to pq, use Fermat's Theorem to prove Euler's Theorem in the case m = pq.