Define Euclid's Division lemma.
Answers
Answered by
5
For a given positive integers a and b there exists unique pair of integers q and r satisfying a=bq+r
Jstationat3am:
Euclid's Division Lemma: An Introduction. ... The basis of the 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.
Similar questions
Computer Science,
8 months ago
Science,
8 months ago
English,
8 months ago
Accountancy,
1 year ago
Social Sciences,
1 year ago
Science,
1 year ago