Question

Explain Euclid division algorithm with example

Answer 1

Answer:

Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. Recall that the HCF of two positive integers a and b is the largest positive integer d that divides both a and b. ... If r ≠ 0, apply the division lemma to d and r.

Answer 2

Answer:

Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. Recall that the HCF of two positive integers a and b is the largest positive integer d that divides both a and b. ... If r ≠ 0, apply the division lemma to d and r.