1.1.3 Theorem (Division Algorithm). For any integers a and b, with b > 0, there exist unique integers q (the quotient) and r (the remainder) such that a=bq+r, with 0<r<b.