Question

1. Euclid's division lemma states that for two positive integers a and b, there exist unique integers q anc
r such that a = bq + r, what should 'r' must be satisfied for this equation ? ​

Answer 1

Answer:

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.

Answer 2

Step-by-step explanation:

Answer:

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.