Given any two integers where , there exists a unique pair of integers such that and . is called the quotient of and , and is the remainder.

The division algorithm is not an algorithm at all but rather a theorem. Its name probably derives from the fact that it was first proved by showing that an algorithm to calculate the quotient of two integers yields this result.

There are similar forms of the division algorithm that apply to other rings (for example, polynomials).