Question

find hcf using Euclid division algorithm 4848,55.

Answer 1

Answer:

Here we are given to find HCF of 4848, 55

4848>55

So let 4848 be 'a'

Then by using Euclid division algorithm(i.e a=bq+r  , where 0≤ r < b )

4848=55 x 88 +8

   55=8 x 6 +7

     8=7 x 1 +1

     7=1 x 7 +0

Therefore HCF=  1