In euclids division lemma equation a=bq+r …

CBSE, JEE, NEET, CUET
Question Bank, Mock Tests, Exam Papers
NCERT Solutions, Sample Papers, Notes, Videos
Posted by Birendra Mishra 5 years, 6 months ago
- 1 answers
Related Questions
Posted by Hari Anand 5 months, 2 weeks ago
- 0 answers
Posted by Parinith Gowda Ms 2 months, 3 weeks ago
- 1 answers
Posted by Vanshika Bhatnagar 1 year, 3 months ago
- 2 answers
Posted by Parinith Gowda Ms 2 months, 3 weeks ago
- 0 answers
Posted by Kanika . 1 week ago
- 1 answers
Posted by Sahil Sahil 1 year, 3 months ago
- 2 answers

myCBSEguide
Trusted by 1 Crore+ Students

Test Generator
Create papers online. It's FREE.

CUET Mock Tests
75,000+ questions to practice only on myCBSEguide app
myCBSEguide
Gaurav Seth 5 years, 6 months ago
It tells us about the divisibility of integers. It states that any positive integer ‘a’ can be divided by any other positive integer ‘ b’ in such a way that it leaves a remainder ‘r’.
Euclid's division Lemma states that for any two positive integers ‘a’ and ‘b’ there exist two unique whole numbers ‘q’ and ‘r’ such that , a = bq + r, where 0≤r<b.
Here, a= Dividend, b= Divisor, q= quotient and r = Remainder.
Hence, the values 'r’ can take 0≤r<b.
1Thank You