Find the HCF of 616 and 1300, using Euclid's Division Algorithm.

  • -1

1300= 616 x 2 + 68

616 = 68 x 9 + 4

68 = 4 x 17 + 0

hence the remainder becomes 0

when the remainder becomes 0 the divisor( here it is 4) becomes the HCF

therefore , HCF of 1300 616 is 4

  • 2

1300 = 616 x 2 + 68

616 = 68 x 9 + 4

68 = 4 x 17 + 0

when the remainder becomes 0 then the divisor ( here it is 4) becomes the HCF of the given 2 no.

therefore , HCF of 1300 616 is 4

  • 0

1300=616*2+68

616=68*9+4

68=4*17+0

HCF(1300,616)=4

  • -1
What are you looking for?