Euclid's division algorithm for HCF(a, b), a > b
- Divide a by b Write a = bq + r, 0 ≤ r < b.
- Is r = 0? If yes, b is the HCF. Stop.
- If not, divide b by r The old divisor becomes the dividend, the remainder becomes the divisor.
- Repeat until the remainder is 0 The last non-zero divisor is the HCF.
Euclid's division lemma: a = bq + r, 0 ≤ r < |b|. Euclid's division algorithm: HCF(a, b) = HCF(b, r); repeat until r = 0, and the last divisor is the HCF.
Key takeaways: the remainder in a = bq + r is never negative and is less than |b|. Dividing by 2, 3 or 4 and listing the possible remainders proves statements about forms of integers. Euclid's algorithm finds an HCF by repeated division; for three numbers, apply it twice. Subtract the remainders first when a question gives remainders.