In: Advanced Math
(A) Prove division with remainder makes sense for integers as well as natural numbers. In other words prove the following.
Proposition: Let d be a nonzero integer. For any integer n, there exist unique integers q and r such that n = dq + r and 0 ≤ r < |d|.