what is the difference between Euclid division Lemma and Euclid division algorithm with examples.
Pls answer fast.......
Answers
Answered by
1
Mark as BRAINLIEST answer
Answer:
Definition of Euclid division Lemma: Euclid's Division Lemma states that, if two positive integers “a” and “b”, then there exists unique integers “q” and “r” such that which satisfies the condition a = bq + r where 0 ≤ r ≤ b.
Definition of Euclidean algorithm : A method of finding the greatest common divisor of two numbers by dividing the larger by the smaller, the smaller by the remainder, the first remainder by the second remainder, and so on until exact division is obtained whence the greatest common divisor is the exact divisor.
Similar questions