a. Let p is a prime. By using Wilson's Theorem, prove that, (p−2)!≡1(modp). [6 marks] b. Let p,q be distinct primes. Pro
Posted: Thu Jul 14, 2022 3:56 pm
- A Let P Is A Prime By Using Wilson S Theorem Prove That P 2 1 Modp 6 Marks B Let P Q Be Distinct Primes Pro 1 (28.82 KiB) Viewed 27 times
a. Let p is a prime. By using Wilson's Theorem, prove that, (p−2)!≡1(modp). [6 marks] b. Let p,q be distinct primes. Prove that, pq∣(apq−ap−aq+a). [Hint: Use Corollary 1 (Fermat/ Wilson/ Euler Theorem) and Corollary 3 (Divisibility)]