what is euclids division lemma
Answers
Answered by
2
Euclid's Division Lemma: ... The basis of Euclidean division algorithm isEuclid'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.
jungli:
I am not understand
Euclid division lemma
a= bq+r ,where, 0<=r
ok
Answered by
1
a=bq+r
given positive integer a and b there exists unique integer q and r satisfying
a = bq+r
given positive integer a and b there exists unique integer q and r satisfying
a = bq+r
Similar questions