Exercise 1.1

Q1. Use Euclid's division algorithm to find the HCF of 135 and 225.

Solution:

Since 225 > 135, we apply Euclid's division lemma:

225 = 135 × 1 + 90

135 = 90 × 1 + 45

90 = 45 × 2 + 0

Since the remainder is now 0, the HCF = 45.