Euclid's Division Lemma Class 10th | Real Numbers | Exercise 1.1 | NCERT

This video covers the basics of Euclid's Division Lemma which will be used to cover further Exercise questions.

Euclid's Division Lemma 

If we are having two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b.

For example if we will divide 35 by 6 then we will get 35 = 6*5 + 5 where 6 is multiplied by 5 to get 30 and other 5 remains as the remainder.



Euclid's Division Lemma could be used to calculate HCF of two positive integers. According to EDL on dividing the integers we will have a remainder zero and thus the last divisor will be the HCF which brings the remainder zero at final step.

To learn this topic through example, You can watch our video from the given link below:

Euclid's Division Lemma Class 10th

I Hope you liked the video, Do share it with the one who needs it. Thank You :)