Question

state the euclids division lemma

Answer 1

According to Euclid's Division Lemma if we have two positive integers a and b, then there exists unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b. The basis of Euclidean division algorithm is Euclid's division lemma.

Answer 2

Euclid’s division lemma, states that for any two positive integers ‘a’ and ‘b’ we can find two whole numbers ‘q’ and ‘r’ such that a = b × q + r where 0 ≤ r < b.
Euclid’s division lemma can be used to find the highest common factor of any two positive integers and to show the common properties of numbers.