ΘρϵηΠατπ

Congruence Equivalence Classes Notation
With n1 then the relation aRb defined as a%n=b%n induces an equivalence relation therefore given any a we get an equivalence class [a], and we define a:=[a] to lighten the standard notation of equivalence classes
The Integers Modulo n
Suppose that n1, then we define n%:={0,1,2,,n1} and call this set the integers modulo n
Addition in n%
Suppose that a,b, then we define a+b=a+b
Multiplication in n%
Suppose that a,b, then we define ab=ab
choice of representative doesn't matter for addition
Suppose that a1,a2,b1,b2 and that a1=b1 and a2=b2, then a1+a2=b1+b2

Consider the set a1+a2 which is defined as {w:w%n=(a1+a2)%n}, we'd like to show that it is equal to {z:z%n=(b1+b2)%n}

representitive doens't matter for multiplication
Suppose that a1,a2,b1,b2 and that a1=b1 and a2=b2 then a1a2=b1b2
TODO