Euclides division lemma state that fir any positive integers a and b there exits unique integer q and r such that a = bq+r where r must satisfy
Answers
Answered by
3
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. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid’s division algorithm. HCF is the largest number which exactly divides two or more positive integers. That means, on dividing both the integers a and b the remainder is zero.
Hope This Is Useful Explanation!
Similar questions