Divisible 874, divisor 100, quotient 82 so what is the remainder?
Answers
Answered by
2
Answer:
- 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.
Similar questions