Question

find hcf by Euclid division algorithms 196 and 38220​

Answer 1

Answer:

hi

your answer is here !

Step-by-step explanation:

196 is the HCF of 196 and 38220.

Solution:

38220 is higher than the 196, such that the smallest number is taken as divisor and the largest number is taken as dividend.

Then by using the Euclid’s algorithm,

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.

$follow \: \me$

Answer 2

$\huge{\purple{\overbrace{\underbrace{\pink{\mathfrak{Bonjour}}}}}}$

38220 is higher than the 196, such that the smallest number is taken as divisor and the largest number is taken as dividend. Then by using the Euclid's algorithm, The finding of HCF of 196 and 38220 is solved in the below attachment. The quotient for by dividing 38220 by 196 is 195.