what is Euclid division lemma ? can you define that
Answers
Answered by
1
Euclid's Division Lemma: ... The basis of Euclidean division algorithm 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.
Aakash1000chauhan1:
from where you cheated from internet
Answered by
0
Euclids division lemma states that : given a positive integer a and b there exists uniqie integer q and r such that a=bq+r where. 0 less thanx equal to r < b
It's used to find hcf
It's used to find hcf
Similar questions