(a) If gcd(a, 35) = 1, show that a12 ≡ 1 (mod 35).
[Hint: From Fermat’s theorem a6 ≡ 1 (mod 7) and a4 ≡ 1 (mod 5).]
(b) If gcd(a, 42) = 1, show that 168 = 3 · 7 · 8 divides a6 − 1.
(c) If gcd(a, 133) = gcd(b, 133) = 1, show that 133 | a18 − b18.
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.