state and prove division algorithm
Answers
Answered by
0
Answer:
Theorem [Division Algorithm].
Given any strictly positive integer d and any integer a, there exist unique integers q and r such that a = qd + r and 0 ≤ r<d. One thing to notice right away is that, like many important theorems in mathematics, this makes a statement about existence and also one about uniqueness.
Similar questions