what is uclids division lemma
Answers
Answered by
3
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.
Answered by
4
✔✔for any two given positive integers A and B there exist unique whole numbers q and R such that
a=bq +r, where 0 less than or equal to r <b
a=bq +r, where 0 less than or equal to r <b
Similar questions