Home
Class 10
MATHS
Euclid's Division Lemma...

Euclid's Division Lemma

Text Solution

Verified by Experts

Euclid's division lemma states that for any two positive integers, say 'a' and 'b', the condition 'a = bq +r', where 0 ≤ r < b always holds true.
Mathematically, we can express this as 'Dividend = (Divisor × Quotient) + Remainder').
Doubtnut Promotions Banner Mobile Dark
|

Topper's Solved these Questions

  • QUADRATIC EQUATIONS

    RD SHARMA|Exercise All Questions|390 Videos
  • SOME APPLICATIONS OF TRIGONOMETRY

    RD SHARMA|Exercise All Questions|154 Videos

Similar Questions

Explore conceptually related problems

Use Euclids division Lemma to show that the cube of any positive integer is either of the form 9m,9m+1 or,9m+8 for some integer m .

Real Numbers-Euclid'S Divison Lemma|Real Numbers-Euclid'S Divison Algorithm|Ncert Questions|Omr

What do you mean by Euclid's divison lemma ?

Euclid Division lemma

Proof of Euclid division lemma

Find the HCF of the following using Euclid division lemma 135 And 225

Find the HCF (210, 55) by Euclid's Division algorithm

Find the HCF of 180, 252 and 324 by Euclid's Division algorithm.

Find the HCF of numbers 134791, 6341 and 6339 by Euclid's division algorithm.

Find the HCF of 867 and 255, using Euclid's division algorithm.