Euclid division algorithm to find hcf of 176 and 38220
Answers
Answered by
53
Solution :
Euclid division algorithm to find hcf of 176 and 38220
Consider a = 38220 and b = 176
By Euclid division algorithm,
a = bq + r (as dividend = divisor * quotient + remainder)
38220 = 176 * 217 + 28 (r not equals to 0)
176 = 28 * 6 + 8 (r not equals to 0)
28 = 8 * 3 + 4 (r not equals to 0)
8 = 4 * 2 + 0 ( r is equal to 0)
Stop here.
Ans - HCF of 176 and 38220 is 4.
Euclid division algorithm to find hcf of 176 and 38220
Consider a = 38220 and b = 176
By Euclid division algorithm,
a = bq + r (as dividend = divisor * quotient + remainder)
38220 = 176 * 217 + 28 (r not equals to 0)
176 = 28 * 6 + 8 (r not equals to 0)
28 = 8 * 3 + 4 (r not equals to 0)
8 = 4 * 2 + 0 ( r is equal to 0)
Stop here.
Ans - HCF of 176 and 38220 is 4.
Answered by
17
Answer: Let a = 38220 and b = 176
By Euclid division algorithm,
a = bq + r (as dividend = divisor * quotient + remainder)
38220 = 176 * 217 + 28 (r not equals to 0)
176 = 28 * 6 + 8 (r not equals to 0)
28 = 8 * 3 + 4 (r not equals to 0)
8 = 4 * 2 + 0 ( r is equal to 0)
Therefore: HCF of 176 and 38220 is 4. (ans)
Explanation:
Similar questions