Euclid division lemma
If one integer a is divided by another positive integer b, we can write a = bq + r, where q is the quotient and r is the remainder, with 0 <= r < b.
Practice This ConceptLearn the concept
Student-friendly explanation
This lemma gives the exact form of division with remainder. It tells us that the remainder is not free to take any value; it must stay smaller than the divisor and cannot be negative. That strict form is useful in HCF methods and in proof-based questions.
How to write this in exams
- 1
Start with the exact idea
If one integer a is divided by another positive integer b, we can write a = bq + r, where q is the quotient and r is the remainder, with 0 <= r < b.
- 2
Then show how to use it
1. Divide a by b. 2. Write a = bq + r. 3. Check that r is not negative. 4. Check that r is smaller than b. 5. If both conditions hold, the form is correct.
- 3
Add one concrete example
When 157 is divided by 12, we can write 157 = 12 x 13 + 1, so the quotient is 13 and the remainder is 1.
- 4
Avoid this incomplete answer
Writing 157 = 12 x 12 + 13 is wrong because the remainder 13 is not smaller than the divisor 12.
Definition
Example
Rule to remember
Memory hook
Examples and method
Worked example
Method to apply
Diagram support
How CBSE asks it
Avoid common mistakes
Common confusion
Common wrong answer
Exam tip
Quick check
In the division of 157 by 12, what must be true about the remainder?
The remainder must be less than 12 and cannot be negative, so it can only lie between 0 and 11.
Answer writing and exam use
1-mark answer
2-mark answer
3-mark answer
Practice this concept with focused MCQs
Open the concept quiz intro first, review the test details, and then start a focused MCQ set from this concept only. Instant score and answer review are live now.
Help improve this page
Found something confusing, incorrect, or missing?