About Lesson
Euclid’s Division AlgorithmWe apply Euclid’s Division Lemma to find two integers q and r such that a=b×q+r and 0≤r<b. If r = 0, the H.C.F is b; else, we apply Euclid’s division Lemma to b (the divisor) and r (the remainder) to get another pair of quotient and remainder.