Question

Euclid's division lemmar state that for any positive Integer and b, there exist unique integers q and are such that a =bq+where r must safisfy

(A)1<r<b
(B)0<r≤b
(C)0≤r<b
(D)0<r<b​

Answer 1

Answer:

Euclid's Division Lemma states that, if two positive integers “a” and “b”, then there exists unique integers “q” and “r” such that which satisfies the condition a = bq + r where 0 ≤ r ≤ b. ... In this example, 9 is the divisor, 58 is the dividend, 6 is the quotient and 4 is the remainder.