Question

Difference b/w euclid division algorithms and euclid division lemma

Answer 1

Euclid's division lemma: For given any positive integers a and b there exist unique integers q and r satisfying a = bq + r, 0 ≤ r < b.

Euclid's division algorithm is used for finding the Highest Common Factor of two numbers where in we apply the statement of Euclid's division lemma.