Question

using Euclid's division algorithm of HCF 48 and 72​

Answer 1

Answer:

HOPE THIS WILL HELP YOU

PLEASE MARK AS BRAINLIEST ONE.

Answer 2

By using Euclid's division algorithm (a = b × q + r)

Step 1 :

48) 72 ( 1

48

-----------

24

72 = 42 × 1 + 24

Step 2 : As remainder is 24 which is not zero. so, now will take 24 as divisor and 42 as dividend.

24) 42 ( 1

24

---------

1 8

42 = 24 × 1 + 18

Step 3 : As remainder 18 which is not zero. Hence, now will take 18 as divisor and 24 as dividend.

18 ) 24 ( 1

18

------------

6

24 = 18 × 1 + 6

Step 4 : Now ,we considthe divisor 18 as dividend and the remainder 6 as divisor.

6) 18 ( 3

18

-----------

0

Finally , We get a remainder as 0.

Hence, H.C.F of ( 48, 72 ) is 6.