Two integers a and b are said to be congruent modulo n if a


Two integers a and b are said to be congruent modulo n if (a mod n) = (b mod n). We then proved that a (mod n) if n |(a - b). Using this latter definition as the starting point, prove that, if (a mod n) = (b mod n), then n divides (a - b).

Solution Preview :

Prepared by a verified Expert
Mathematics: Two integers a and b are said to be congruent modulo n if a
Reference No:- TGS02204106

Now Priced at $20 (50% Discount)

Recommended (94%)

Rated (4.6/5)