Question

Use Euclid's algorithm to find HCF(196, 38220).​

Answer 1

Answer:

5795578

Step-by-step explanation:

Mark as brainleist and follow me

Answer 2

Answer:

196 and 38220

We have 38220 > 196,

So, we apply the division lemma to 38220 and 196 to obtain

38220 = 196 × 195 + 0

Since we get the remainder as zero, the process stops.

The divisor at this stage is 196,

Therefore, HCF of 196 and 38220 is 196.

Step-by-step explanation:

Hope this helps you ✌️