EUCLID’S DIVISION LEMMA

EUCLID’S DIVISION LEMMA


Euclid’s Division Lemma : Given two positive integers say ‘a’ and ‘b’ , where a > b, there exist two unique integers ‘q’ and ‘r’ satisfying the equation 

a = bq + r  where  0 ≤ r < b 

Example : Let consider two positive integers 5 and 37 . Now divide 37 by 5 

37 ÷ 5 

We get 7 as quotient and 2 as remainder.

We can state this statement in an equation as - 

37 = 5 × 7 + 2

This is called Euclid’s Division Lemma.



We can find the HCF of integers by Euclid’s Division Lemma. To explore click here : Euclid’s Division Algorithm


Further readings :

👉 Acids, Bases and Salts (59 Second Video)

👉 Metals and Non Metals : Reactivity Series Easy Trick

👉 Euclid’s Division Algorithm Question

👉 Euclid’s Division Lemma 

👉 Relationship between zeroes and coefficients of a linear polynomial

👉 Motivational Story in Hindi (प्रेरणादायक कहानी) 

👉 About Us 

External Links :  (From Our YouTube Channel)

👉 FunTime : Find the letter "n"

👉 FunTime : MatheMagics Math Trick

👉 FunTime : Don’t waste your time 

👉 FunTime : How to create thumbnail 

👉 Study Time : Acids, Bases and Salts 

Comments

Popular posts from this blog

Euclid’s Division Lemma/Algorithm Type Question

Mathematics : Relation between zeroes and coefficient of a polynomial.

Science : Acids, Bases and Salts