Weekly recap. Euclidean algorithm to find gcd(a,b) and gcd(a,b) as linear combination of a and b. Euler's totient (phi) function and its properties. Units modulo n and Euler's theorem.