Math, asked by DipGoswami, 1 year ago

Define Euclid's Division lemma.​

Answers

Answered by sudhamadhuri09
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