Prove using only the definition of congruence modulo n that


1. Is [2]=[123] modulo 6? Explain.

2. Write an algorithm that counts to 18 by twos.

3. Prove, using only the definition of congruence modulo n, that if a ≡ b (mod n) and c ≡ d (mod n), then a+c ≡ b+d (mod n).

Request for Solution File

Ask an Expert for Answer!!
Mathematics: Prove using only the definition of congruence modulo n that
Reference No:- TGS01633931

Expected delivery within 24 Hours