Solution Found!
Show that if a. b, k. and m are integers such that k ? 1,
Chapter 4, Problem 41E(choose chapter or problem)
QUESTION:
Problem 41E
Show that if a. b, k. and m are integers such that k ≥ 1, m ≥ 2, and a ≡ b (mod m), then ak ≡ bk(mod m).
Questions & Answers
QUESTION:
Problem 41E
Show that if a. b, k. and m are integers such that k ≥ 1, m ≥ 2, and a ≡ b (mod m), then ak ≡ bk(mod m).
ANSWER:
Solution:
Step 1
In this problem we have to show that if a. b, k. and m are integers such that
k ≥ 1, m ≥ 2, and a ≡ b (mod m),
then ak ≡ bk(mod m).