What is Euclids division lemma/ algorithm??
Answers
Answered by
17
Step-by-step explanation:
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.
Answered by
7
Answer:
it is a division of two statements some physical and understand the local number of MLA in Legislative Assembly east in India
Similar questions