Maths WorkshopMaths problems with full solutions
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 aa and bb divides \divisibility(a,b)\divisibility(a,b), and every common multiple of aa and bb is a multiple of lcm⁡(a,b)\operatorname{lcm}(a,b).

Hint

Use the prime factorizations, or the Bézout identity for the first part.

Show solutionHide solution

Solution

Common divisors. Let d=\divisibility(a,b)d=\divisibility(a,b) and let cc be any common divisor of a,ba,b. Write d=au+bvd=au+bv (Bézout). Since c∣ac\mid a and c∣bc\mid b, we get c∣au+bv=dc\mid au+bv=d.

Common multiples. Let M=lcm⁡(a,b)M=\operatorname{lcm}(a,b) and let NN be any common multiple. Write the Euclidean division N=Mq+rN=Mq+r with 0≤r<M0\le r<M. Since NN and MM are both multiples of aa and bb, so is r=N−Mqr=N-Mq. But MM is the *smallest* positive common multiple, so r=0r=0. Hence M∣NM\mid N.