Question

Euclid's division Lemma please ​

Answer 1

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. By exactly we mean that on dividing both the integers a and b the remainder is zero.

Answer 2

according to euclids division lemma, for any two given positive integers a and b there exists a unique integers q and r such that a=bq+r where 0<=r<=b. wHere a=dividend , b=divisor , q =quoitent and r=remainder.