Lesson Review:

• Common divisor
• GCD (Greatest Common Divisor) or GCF (Greatest Common Factor)
• Relatively prime or coprime
• Common multiple
• LCM (Least Common Multiple)
• gcd(m,n)
• lcm[m,n]
• The Division Theorem: a = bq + r (0≤r<b) a:dividend, b:divisor, q: quotient, r: remainder
• Euclidean algorithm: gcd(m,n) = gcd (m-n,n)
• The extended Euclidean algorithm: gcd(m,n) = gcd (m-n,n) = gcd (m-kn,n) = gcd (r,n)

Homework:

• Page 40: Ex 3.2.5
• Page 43: Ex 3.3.2
• Page 45: Ex 3.4.1 (d) (g)
• Page 50: Ex 3.5.3
• Page 53: 3.6.1, 3.6.6
• Page 59: 3.7.1 (b)
• Page 61: 3.24 (d), 3.32, 3.33, 3.34

Other Resources:

• https://www.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/the-euclidean-algorithm
• https://www.khanacademy.org/math/pre-algebra/pre-algebra-factors-multiples/pre-algebra-greatest-common-divisor/v/greatest-common-divisor

Take care, and wish everyone to stay safe and healthy!