Question

2.1. State Euclid's division lemma.​

Answer 1

Answer:

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.

Step-by-step explanation:

hope it helps.....follow me for the more....

Answer 2

Answer:

Q=qd+r

Step-by-step explanation:

Q= original number

r = remainder