Question

define euclid's division Lemma​

Answer 1

Euclid's Division Lemma:

• The basis of Euclidean division algorithm 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.

mark my answer as brainliest and follow me for clarifying more doubts.

Answer 2

Answer:

Euclidean division algorithm 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.

Step-by-step explanation:

I hope it will satisfy you