subject
Mathematics, 06.06.2021 01:00 samueltaye

(a) Let p be a prime. Prove that if the integers a, b satisfy a ≡ b mod p then a^p ≡ b^p mod p^2. [Hint: Look at the proof of the Little Fermat Theorem.]
(b) Let Give an example of an even positive integer n and an integer a such that
a^n does not ≡ a mod n. By the Little Fermat Theorem we must have n > 2.


(a) Let p be a prime. Prove that if the integers a, b satisfy a ≡ b

mod p then a^p ≡ b^p mod p^2.

ansver
Answers: 2

Another question on Mathematics

question
Mathematics, 21.06.2019 15:30
Abike shop sells you a bicycle for $63 and a helmet for $21. the total cost is 150% of what the shop spent originally. how much did the shop spend originally? how much profit did the bike shop earn by selling the bicycle and helmet to you ?
Answers: 1
question
Mathematics, 21.06.2019 17:00
(! ) three cylinders have a height of 8 cm. cylinder 1 has a radius of 1 cm. cylinder 2 has a radius of 2 cm. cylinder 3 has a radius of 3 cm. find the volume of each cylinder
Answers: 1
question
Mathematics, 21.06.2019 19:30
Factor the expression using gcf 9b+45
Answers: 2
question
Mathematics, 21.06.2019 20:30
Astore ordered 750 candles a total wholesale cost of $7910.20. the soy candles cosy $12.17 each and thespecialty candles cost $9.58each. how many of each were bought?
Answers: 1
You know the right answer?
(a) Let p be a prime. Prove that if the integers a, b satisfy a ≡ b mod p then a^p ≡ b^p mod p^2. [...
Questions
question
Physics, 11.05.2021 18:30
question
Chemistry, 11.05.2021 18:30
question
Mathematics, 11.05.2021 18:30
Questions on the website: 13722361