Maths WorkshopMaths problems with full solutions
Exercise 912Number theory › Divisibility and gcdL1Added 3 Nov 2026

Gauss's lemma

#Gauss lemma#divisibility#coprime

Statement

Let a,b,c∈Za,b,c\in\mathbb{Z} with gcd⁡(a,b)=1\gcd(a,b)=1. Show that if a∣bca\mid bc, then a∣ca\mid c.

Hint

Bézout: au+bv=1au+bv=1. Multiply by cc.

Show solutionHide solution

Solution

Bézout. au+bv=1au+bv=1.

Multiply by cc. acu+bcv=cacu+bcv=c.

Divisibility. a∣acua\mid acu trivially, and a∣bcva\mid bcv since a∣bca\mid bc. So a∣ca\mid c.

Conclusion. Gauss's lemma holds.

Application. If pp is prime and p∣bcp\mid bc, then p∣bp\mid b or p∣cp\mid c (Euclid's lemma).