Question
Use Euclid’s Division Algorithm to find the Highest Common Factor (H.C.F) of 867 and 255

Answer

To find the H.C.F. of 867 and 255, Using Euclid’s division algorithm.
867 = 255 × 3 + 102
The remainder 102 ≠ 0.
Again using Euclid’s division algorithm
255 = 102 × 2 + 51
The remainder 51 ≠ 0.
Again using Euclid’s division algorithm
102 = 51 × 2 + 0
The remainder is zero.
Therefore = 51
Therefore the H.C.F. of 867 and 255 is 51.

Need a full question paper?

Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.

Start Generating Free