Question

Explain euclid division lemma

Answer 1

Answer:

Here is your answer frnd. Hope this will helps u.

Answer 2

Answer:

Euclid's Division Lemma: An Introduction. ... The basis of the Euclidean divisionalgorithm is Euclid's division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid's division algorithm. HCF is the largest number which exactly divides two or more positive integers.