Question

Use Euclid's Division Algorithm to find HCF of 616 and 32
​

Answer 1

Step-by-step explanation:

Since 616 > 32, we use Euclid's division lemma to find their HCF,

Now,

616 = 32 × 19 + 8

32   = 8   ×  4  + 0

So, we get H.C.F. as 8

or,

⇒ H.C.F. (616,32) = 8 

Answer 2

Answer:

616 = 2×2×19..

Step-by-step explanation:

32= 2×2×2×2×2 ( here is your answer plz mark me as brainliest its urgent plz hlep me)