Prove that if ? ≡ ? (mod n) and ? ≡ ? (mod n), then ? ≡ ? (mod n). This proves that congruence mod n is transitive.
and
: Prove that if ? ≡ ? (mod n) and ? ≡ ? (mod n), then
a) ? + ? ≡ ? + ? (mod n)
b) ?? ≡ ?? (mod n)
Get Answers For Free
Most questions answered within 1 hours.