(1)Show that addition and multiplication mod n are associative operations.
(2)Show that there are both an additive and a multiplicative identity.
(3)Show that multiplication distributes over addition modulo n.
(4)Show that for every integer a there is an additive inverse -a:
I know, for both above, they mean that,
(1) (a+b)+c ≡ a+(b+c) (mod n)
(ab)c ≡ ba (mod n)
(2) a+0 ≡ a (mod n) a*1 ≡ a (mod n)
(3) a(b+c) ≡ ab+ac (mod n)
(4) a+(-a) ≡ ab+ac (mod n)
Professor said not to worry about the proofs for these, but I'd rather know it for future courses.�� This seems easy to grasp, for the lack of a better word, but I do not know how I would prove this since class just started.
Here are the hints for those problems: