Euclidean Division

Given two integers a and b, with b not 0, there exist unique integers q and r such that a = bq + r and 0 < r < b, or r = 0. Just the usual division between integers, but with a remainder!