explain eculid division lemma
Answers
Answered by
1
The basis of euclidean division algorithm is eculid division lemma To calculate highest common factor of 2 positive integers a and b we use eculid division algorithm .HCF is the largest number Which exactly divides two or more positive integer. .
Answered by
3
Euclid's division lemma is defined as
for example - 5/2=2*2+1
by Euclid lemma we can exactly find the divident by multiplying the divisor and quotient and add the reminder
for example - 5/2=2*2+1
by Euclid lemma we can exactly find the divident by multiplying the divisor and quotient and add the reminder
tanu66:
hope it helps
Similar questions