Question

State Euclid's division lemma.​

Answer 1

Answer:

a = bq + r where 0 ≤ r < b

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.

Hope it will help

thank u for your time