a is congruent to b modulo m
m divides b-a
congruence class [a]
coset of the ideal mZ
weak cancellation law
ka=kb mode iff a=b mod(m/d)
Euler’s theorem
if gcd(a,m)=1 then a^(φ(m))=1 modm
Fermat’s Little Theorem
if p prime, a^p=a mod p
Chinese Remainder Theorem
m,n coprime then the pair of congruences has a unique solution