Is euclid's division lemma and euclid's division algorithm are same
Answers
Answered by
2
Answer:
no
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.
a = bq + r, where 0 ≤ r < b. a is the dividend. b is the divisor. q is the quotient and r is the remainder.this is algorithm
Similar questions