Question

Tina tries to find the highest common factor of a and b using Euclid's division algorithm In one of her steps, she divides 616 by 32 what is a and b?

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

Click to let others know, ho

I hope this may help you