Summary, cont.
Fermat’s Little Theorem: If m is a prime and a is not a multiple of m, then
Euler phi function f(n) = number of positive integers less than n that are relatively prime to n (n > 1).
If n = pq, where p and q are prime, f(n) =(p-1)(q-1)
Euler’s generalization of FLT: If gcd(a,n) = 1, then