what is eculid division lemma?
Answers
Answered by
1
Euclid's Division Lemma: ... The basis of Euclidean divisionalgorithm is Euclid's division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we useEuclid's division algorithm. HCF is the largest number which exactly divides two or more positive integers.
Answered by
1
This is the defination
Attachments:

Similar questions
History,
9 months ago
Science,
9 months ago
India Languages,
9 months ago
Science,
1 year ago
Social Sciences,
1 year ago
English,
1 year ago
Biology,
1 year ago
Social Sciences,
1 year ago