Euclid’s Division Lemma method is significant to find the HCF of 2 numbers, consider 2 integers a and b where a > b.
We use Euclid’s Division Lemma to determine two integers q and r such that
If the remainder is equal to zero, the H.C.F is b, if not, we can use Euclid’s Division Lemma to b (divisor) and r (remainder) to obtain different pairs of quotient and remainder.
The divisor for this step is the H.C.F of the provided set of integers and the process is continued until the remainder of zero is attained.