Question

Use Euclid's Division Algorithms to find the HCF. 1) 867 and 255 .2) 396 ,504 and 636 .3) 90 and 15 .4) 40 16 .​

Answer 1

Answer:

Since for b=51, we get the remainder r=0. Hence by Euclid's division algorithm, 51 is the HCF of 867 and 255.