Question

Euclid's division Lemma states that for two positive integers a and b,
there exists unique integer q and r satisfying a = bą +r, and
(a) 0<r<b
(b) 0<r<b
(c) 0<r<b
(d) OSI3b​

Answer 1

Step-by-step explanation:

Euclid's division Lemma states that for any two positive integers 'a' and 'b' there exist two unique whole numbers 'q' and 'r' such that , a = bq + r, where 0≤ r < b. Here, a= Dividend, b= Divisor, q= quotient and r = Remainder. Hence, the values 'r' can take 0≤ r < b

hope it is helpful for you

pls follow me