Question

euclids division lemma​

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.

Answer 2

Aravind Anna ❤❤❤

The basis of Euclidian division algorithm is Euclids Division Lemma. To calculate the Highest Common Factor ( HCF) of two positive integers a and b we use Euclids Division algorithm....