How to prove this using modular arithmetics?

49 Views Asked by At

We know that p, q - odd primes such that $$(q - 1) | (p - 1)$$ and a is an integer such that $$ (a, pq) = 1 $$ How do we prove that $$ a^{p-1} \equiv 1 \mod pq $$