Question

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

Answer 1

HCF = 45

Explanation:

225 = (135 × p) + q

⇒ 225 = (135×1) + 90

⇒ 135 = (90 × 1) + 45

⇒ 90 = (45 × 2) + 0

HCF (135, 225) = 45

Answer 2

The answer is 45

Explanation:

135 and 225

Here, 225 > 135

225 = 135 × 1 + 90

Since remainder ≠ 0, we apply division Lemma to 135 and 90

135 = 90 × 1 + 45

Since remainder ≠ 0, we apply division Lemma to 90 and 45

90 = 45 × 2 + 0

Since remainder = 0, divisor 45 is the HCF

Thus, HCF (135, 225) = 45

-TheUnknownScientist 72