MATA02H3 Lecture Notes - Lecture 3: Least Common Multiple, Euclidean Algorithm, Divisor

• School: UTSC
• Department: Mathematics
• Course: MATA02H3
• Professor: Sophie Chrysostomou

Document Summary

Definitions b if b is in the form. = remainder of the division; ex. a and b if c. R divides n is a common divisor of c cd (a, ) g b b cm (a, ) l b is the greatest common divisor of is the lowest common multiple of. You could calculate it as cm (a, ) = a b and a and a gcd (a,b) b l b to find the cml. 1 and divides both a and and it is the largest positive divisor of both b b. Theorem: if c combination of c n + m a b. For example, 3 divides the number 6. , then a a b divides and a c. ) or ( divides divides any multiple of a or n a. 3 is a factor of 6 and 9, and thus will divide any multiple of 6 or 9.