Question

Euclid division lemma a=bq+r where remainder r must satisfy

Answer 1

Answer:

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.

Answer 2

Answer:

Euclid division lemma a=bq+r where remainder r must satisfy by 0≤r<b