Class 10 Mathematics · Real Numbers
Euclid's Division Lemma
For any two positive integers a and b there exist unique integers q and r with a = bq + r, 0 ≤ r < b. We use it to find the HCF of two numbers efficiently.
Learning objectives
- State Euclid's division lemma and identify dividend, divisor, quotient and remainder
- Apply Euclid's division algorithm to find the HCF of two positive integers
- Use the lemma to prove simple properties of integers
Video lectures
Lectures coming soon
Video lessons for this topic are being prepared. Explore related topics in the meantime.