what is actually Euclid's Division Lemma & Algorithm?please explaine in detail.
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.
You have rated this answer /10
- CBSE Sample Papers for Class 10 Mathematics
- R S Aggarwal and V Aggarwal Textbook Solutions for Class 10 Mathematics
- RD Sharma Textbook Solutions for Class 10 Mathematics
- NCERT Textbook Solutions for Class 10 Mathematics
- CBSE Syllabus for Class 10 Mathematics
- CBSE Previous year papers with Solutions Class 10 Mathematics