Question

Euclid's division Lemma is an algorithm to find HCF of 960 and 432

Answer 1

Euclid's division formula, a = bq + r
where a = larger number
b = smaller number
q = integer or quotient
r = remainder = a - bq

so, a = 960 and b = 432
960 = 432q + r
960 = 432 × 2 + (900 - 432 × 2)
960 = 864 + 96

since r is not equal to 0 repeat the step
now a = 432, b = 96

432 = 96 × 4 + 48

since r is not equal to 0 repeat the step
now a = 96, b = 48

96 = 48 × 2 + 0

r is equal to zero stop the process

so, 48 is the HCF of 960, 432 by using Euclid division Lemma method

Answer 2

Euclid's Division Lemma =

a = bq + r

Given Numbers = 960,432

Finding HCF (Highest Common Factor) :

960= 432 ×2 + 96

432 = 96 × 4 + 48

96 = 48×2 +0

The required HCF is = 48.