Maths WorkshopMaths problems with full solutions
Exercise 458Number theory › Divisibility and gcdHigh schoolAdded 3 Nov 2026

The least common multiple

#lcm#gcd#product relation

Statement

Let a,b∈N∗a,b\in\mathbb{N}^*. Show that gcd⁡(a,b)⋅lcm⁡(a,b)=ab\gcd(a,b)\cdot\operatorname{lcm}(a,b)=ab.

Hint

Write a=δa′a=\delta a', b=δb′b=\delta b' with gcd⁡(a′,b′)=1\gcd(a',b')=1, where δ=gcd⁡(a,b)\delta=\gcd(a,b).

Show solutionHide solution

Solution

Setup. a=δa′a=\delta a', b=δb′b=\delta b', gcd⁡(a′,b′)=1\gcd(a',b')=1.

LCM. Any common multiple MM satisfies M=αa=βbM=\alpha a=\beta b, so αa′=βb′\alpha a'=\beta b'. Since gcd⁡(a′,b′)=1\gcd(a',b')=1, a′∣βa'\mid\beta, say β=ka′\beta=ka'. Then M=kδa′b′M=k\delta a'b'. The smallest positive is k=1k=1, so lcm⁡=δa′b′=ab/δ\operatorname{lcm}=\delta a'b'=ab/\delta.

Conclusion. gcd⁡(a,b)⋅lcm⁡(a,b)=ab\gcd(a,b)\cdot\operatorname{lcm}(a,b)=ab.

Remark. In particular, if gcd⁡(a,b)=1\gcd(a,b)=1, then lcm⁡(a,b)=ab\operatorname{lcm}(a,b)=ab.