Request a call back

what is actually Euclid's Division Lemma & Algorithm?please explaine in detail.
Asked by | 08 Jun, 2008, 05:17: PM Expert Answer

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 | 25 Jul, 2008, 05:54: PM
CBSE 10 - Maths
Asked by KONDA VENKATA KHEERTHANA | 04 May, 2018, 10:29: AM ANSWERED BY EXPERT
CBSE 10 - Maths
Asked by suryap2 | 26 May, 2010, 04:16: PM ANSWERED BY EXPERT
CBSE 10 - Maths
Asked by surazz | 23 May, 2010, 12:31: PM ANSWERED BY EXPERT
CBSE 10 - Maths
Asked by sahil.95rana | 23 May, 2010, 06:53: AM ANSWERED BY EXPERT
CBSE 10 - Maths
Asked by surazz | 09 May, 2010, 10:06: AM ANSWERED BY EXPERT
CBSE 10 - Maths
Asked by pranavjain | 01 May, 2010, 05:11: PM ANSWERED BY EXPERT
CBSE 10 - Maths
Asked by sumandeesinghrana | 30 Apr, 2010, 08:15: PM ANSWERED BY EXPERT
CBSE 10 - Maths
Asked by ayushikas | 30 Apr, 2010, 08:42: AM ANSWERED BY EXPERT
CBSE 10 - Maths
Asked by saraza | 27 Apr, 2010, 08:55: PM ANSWERED BY EXPERT
CBSE 10 - Maths
Asked by kanz_daruler1 | 26 Apr, 2010, 09:52: PM ANSWERED BY EXPERT