Question

by euclid algorithm to get h.c.f of 225 and 867

Answer 1

We have to find Highest Common Factor (HCF) of 225 and 867.

[Using Euclid's Division Algorithm]

Euclid's Division Algorithm =

a = bq+r

867 = 225×3 +192

225 = 192×1 + 33

192 = 33 × 5 +27

33 = 27 × 1 + 6

27 = 6 × 4 +3

6 = 3 × 2 + 0

The required Highest Common Factor (HCF) is 3.

Answer 2

Euclid division algorithm =>

a = bq+r [Where q is not equal to zero]

[We have to divide till r = 0]

867 = 225×3+192

225 = 192×1+33

192 = 33×5+27

33 = 27×1+6

27 = 6×4+3

6 = 3×2+0

Therefore HCF of 225 and 867 is 3 .

Euclid division algorithm => a = bq+r

Where ,

a = Dividend , b = Divisor , q = Quotient ,

r = remainder