Question

use Euclid's division algorithm to find the HCF of 867and 225​

Answer 1

Answer:

Step 1: First find which integer is larger.

867>255

Step 2: Then apply the Euclid's division algorithm to 867 and 255 to obtain

867=255×3+102

Repeat the above step until you will get remainder as zero.

Step 3: Now consider the divisor 225 and the remainder 102, and apply the division lemma to get

255=102×2+51

102=51×2=0

Since the remainder is zero, we cannot proceed further.

Step 4: Hence the divisor at the last process is 51.

So, the H.C.F. of 867 and 255 is 51.