Question

1. Use Euclid's division algorithm to find the HCF of: (ii) 196 and 38220​

Answer 1

Answer:

Step-by-step explanation:

The finding of HCF of 196 and 38220 is solved in the below attachment. The quotient for by dividing 38220 by 196 is 195. It has been exactly divisible by providing the remainder as 0. 196 is the Highest Common Factor of the numbers 196 and 38220 by using Euclid's algorithm

PLEASE MARK ME AS BRAINLIEST

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 ✌️