Please wait...
1800-212-7858 (Toll Free)
9:00am - 8:00pm IST all days
For Business Enquiry


Thanks, You will receive a call shortly.
Customer Support

You are very important to us

For any content/service related issues please contact on this toll free number


Mon to Sat - 11 AM to 8 PM

what is actually Euclid's Division Lemma & Algorithm?please explaine in detail.

Asked by 8th June 2008, 5:17 PM
Answered by Expert

Lemma is nothing but the division fact.Its written like a = d.q + r

It means when a number (a) is divided by divisor(d), you get quotient(q) and remainder(r).

The above lemma can be used in algorithm for finding HCF.

For given two numbers,we divide the larger by the smaller.Obviously, the remainder thus obtained will be lesser than the divisor.We put this in division fact or lemma form.

Now , we take the divisor and remainder from above division. Divide the previous divisor by that remainder and

put it in lemma form.

Continue writing the lemma with succesive divisor and remainders till you get zero as remainder. At this stage

the last divisor will be required HCF.

Answered by Expert 25th July 2008, 5:54 PM
Rate this answer
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7
  • 8
  • 9
  • 10

You have rated this answer /10

Your answer has been posted successfully!

Chat with us on WhatsApp