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

The HCF of consecutive integers

#coprime#consecutive integers#gcd

Statement

Show that gcd⁡(n,n+1)=1\gcd(n,n+1)=1 and gcd⁡(2n+1,3n+2)=1\gcd(2n+1,3n+2)=1 for all n≥1n\ge1.

Hint

For the first, note that a common divisor divides (n+1)−n=1(n+1)-n=1. For the second, find a linear combination that gives 11.

Show solutionHide solution

Solution

First. If d∣nd\mid n and d∣n+1d\mid n+1, then d∣1d\mid1. So gcd⁡(n,n+1)=1\gcd(n,n+1)=1.

Second. Compute 3(2n+1)−2(3n+2)=6n+3−6n−4=−13(2n+1)-2(3n+2)=6n+3-6n-4=-1. So any common divisor divides 11.

Conclusion. Both pairs are coprime for all nn.