Question #225080

Show that if n ∣ m, where n and m are integers greater than 1, and if a ≡ b (mod m), where a and b are integers, then a ≡ b (mod n).


1
Expert's answer
2021-08-11T15:34:08-0400

If ab(mod m)a ≡ b (mod\ m) , where aa and bb are integers, then m(ab),m|(a-b), that is ab=mta-b=mt for some integer t.t. Since nm,m=nkn|m,m=nk for some integer k.k. Then ab=(nk)t=n(kt),a-b=(nk)t=n(kt), and hence n(ab).n|(a-b). We conclude that ab(mod n).a ≡ b (mod\ n).


Need a fast expert's response?

Submit order

and get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

Comments

No comments. Be the first!
LATEST TUTORIALS
APPROVED BY CLIENTS