Question

Using Euclid's division algorithm to find the HCF of the following step by step 48 and 108​

Answer 1

Answer:

108=48*2+12

48=12*4+0

thus hcf is 12

pls mark me as brainliest i require two more

Answer 2

✪ By Using Euclid division algorithm,

108 > 48 [ a = bq + r , 0 ≤ r < b ]

★Step 1 :

2

48 ) 108

96

-----------

12

108 = 48 × 2 + 12

★Step 2 : As remainder is 12 which is not equal to zero. So,now will take 12 as divisor and 48 as dividend.

4

12 ) 48

48

--------

0

48 = 12 × 4 + 0

Finally,

We got remainder as 0.

Hence, HCF of ( 48, 108 ) is 12 Because last divisor in solving this problem is 12 .