what is Euclid's division lemma?? explain it through an example.
Answers
Answered by
0
Answer:
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.
,
gurpritjai:
example?
I am not able to understand this question
answer**
Similar questions