Question

(a) Let p be a prime. Prove that if the integers a, b satisfy a ≡ b mod p then a^p ≡ b^p mod p2. (b) Let Give an example of an even positive integer n and an integer a such that a^n!≡ a mod n. By the Little Fermat Theorem we must have n > 2.

Name: a let p be a prime prove that if the integers a b satisfy a b mod p then ap bp mod p2 b let give an example of an even positive integer n and an integer a such that an a mod n by the little 37548
Uploaded: 2023-07-18T11:36:34-08:00
Duration: 1 min 18 s
Channel: Adi S
Description: a let p be a prime prove that if the integers a b satisfy a b mod p then ap bp mod p2 b let give an example of an even positive integer n and an integer a such that an a mod n by the little 37548

          (a) Let p be a prime. Prove that if the integers a, b
satisfy a ≡ b mod p then a^p ≡ b^p mod p2. 
(b) Let Give an example of an even positive integer n
and an integer a such that a^n!≡ a mod n. By the Little Fermat
Theorem we must have n > 2.

Added by Toni M.

Calculus: Early Transcendentals

James Stewart 8th Edition

Instant Answer

Solved by Expert Adi S

07/18/2023

Step 1

(a) Show more…

Show all steps

Thanks for your feedback!

(a) Let p be a prime. Prove that if the integers a, b satisfy a ≡ b mod p then a^p ≡ b^p mod p2. (b) Let Give an example of an even positive integer n and an integer a such that a^n!≡ a mod n. By the Little Fermat Theorem we must have n > 2.