Question

use euclids division algorithm to find HCF of 867 and 225

Answer 1

................ answer .......

Answer 2

$\huge\star{\red{\underline{\underline{\mathbb{EXPLANATION:}}}}}$

______________________________

$\star$We have to use euclids division algorithm to find HCF of 867 and 225.

As we know, 867 is greater than 225.

Let us apply now Euclid’s division algorithm on 867, to get,

$\mapsto$867 = 225 × 3 + 102

Remainder 102 ≠ 0, therefore taking 225 as divisor and applying the division lemma method, we get,

$\mapsto$225 = 102 × 2 + 51

Again, 51 ≠ 0. Now 102 is the new divisor, so repeating the same step we get,

$\mapsto$102 = 51 × 2 + 0

The remainder is now zero, so our procedure stops here.

Since, in the last step, the divisor is 51, therefore, HCF

$\mapsto$ (867,225) = HCF(225,102) = HCF(102,51) = 51.

Hence, the HCF of 867 and 225 is 51.