This document outlines several properties of modular arithmetic including: (1) x * y (mod m) is equal to (x (mod m)) * (y (mod m)) (mod m); (2) (x + y) (mod m) is equal to ((x (mod m)) + (y (mod m))) (mod m); and (3) (x - y) (mod m) is equal to ((x (mod m)) - (y (mod m))) (mod m). It also provides examples of computing various expressions modulo 187.
This document outlines several properties of modular arithmetic including: (1) x * y (mod m) is equal to (x (mod m)) * (y (mod m)) (mod m); (2) (x + y) (mod m) is equal to ((x (mod m)) + (y (mod m))) (mod m); and (3) (x - y) (mod m) is equal to ((x (mod m)) - (y (mod m))) (mod m). It also provides examples of computing various expressions modulo 187.
This document outlines several properties of modular arithmetic including: (1) x * y (mod m) is equal to (x (mod m)) * (y (mod m)) (mod m); (2) (x + y) (mod m) is equal to ((x (mod m)) + (y (mod m))) (mod m); and (3) (x - y) (mod m) is equal to ((x (mod m)) - (y (mod m))) (mod m). It also provides examples of computing various expressions modulo 187.
(x-y) mod m = ((x mod m)-(y mod m)) mod m X4 mod m = (x2 mod m) (x2 mod m) mod m Xijmodm = (xi mod m)j mod m 125 mod 187 = 125 (225 + 285) mod 187 = (225 mod 187) + (285 mod 187) = 38 + 98 =136 1252mod 187 = 15625 mod 187 = 104 1254mod 187 = (1252 mod 187)2mod 187 = 1042mod 187 = 10816 mod 187 = 157 1286 mod 187 = 1254+2mod 187 = (157x104)mod 187 = 59