Assume that p and q are distinct odd primes such that p − 1 | q − 1. If gcd(a, pq) = 1, show that aq−1 ≡ 1 (mod pq).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.