Question

According to euclids division lemma, if the divisor is 6 then the possible values for remainder are?

Answer 1

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.

PLEASE MARK ME AS BRAINLIEST ANSWER