Answer to Question #247184 in Discrete Mathematics for Alina

Question #247184

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-10-06T14:47:08-0400

If nmn|m , then there is integer number kk such that m=knm=kn .

The following conditions are equivalent: abmod  ma\equiv b\mod m and m(ab)m|(a-b) .

If m(ab)m|(a-b) , then there is integer number ll such that ab=mla-b=ml .

So, ab=ml=knl=(kl)na-b=ml=kn\cdot l= (kl)\cdot n .

It means, that n(ab)n|(a-b) or it can be written as abmod  na\equiv 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!

Leave a comment