Exercise 366Number theory › Divisibility and gcdHigh schoolAdded 2 Nov 2026
Common divisors and common multiples
#divisibility#lcm#structure
Statement
Show that every common divisor of and divides , and every common multiple of and is a multiple of .
Hint
Use the prime factorizations, or the Bézout identity for the first part.
Show solutionHide solution
Solution
Common divisors. Let and let be any common divisor of . Write (Bézout). Since and , we get .
Common multiples. Let and let be any common multiple. Write the Euclidean division with . Since and are both multiples of and , so is . But is the *smallest* positive common multiple, so . Hence .