what is EUCLID'S DIVISION LEMMA and how can we use it to solve problems
Answers
Answered by
1
Answer:
According to Euclid's Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b. The basis of the Euclidean division algorithm is Euclid's division lemma.
geettri:
if a=bq+r then a-divident, b-divisor, q-quotient, r-remainder such that then remainder should always be less or more than 0 but less than divisor if it's higher than divisor then it can be divided to get 0 so it should be written 0≤r
0≤r
Similar questions