Home › UP Board Class 10 › Mathematics › Real Numbers › Euclid's division lemma states that for positive…
Euclid's division lemma states that for positive integers a and b, there exist unique q and r such that:
Aa = bq, with no remainder
Ba = bq + r, where 0 ≤ r < b
Ca = bq + r, where r > b
Da = b + qr
Answer & Solution
Correct answer: B. a = bq + r, where 0 ≤ r < b
Euclid's division lemma: a = bq + r with 0 ≤ r < b, and q, r unique.
Related questions
The largest number that divides both 60 and 96 exactly (their HCF) isThe decimal expansion of an irrational number isThe sum of a rational number and an irrational number is alwaysThe product of the HCF and LCM of the numbers 8 and 20 isA rational number $\dfrac{p}{q}$ (in lowest terms) has a terminating decimal expansion if The prime factorisation of 140 isUsing Euclid's algorithm, the HCF of 96 and 404 isIf the HCF of two numbers is 9 and their LCM is 90, and one number is 18, the other number