## You are here

Homedivision algorithm for integers

## Primary tabs

# division algorithm for integers

Given any two integers $a,b$ where $b>0$, there exists a unique pair of integers $q,r$ such that $a=qb+r$ and $0\leq r<b$. $q$ is called the *quotient* of $a$ and $b$, and $r$ 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).

Related:

ExistenceAndUniquenessOfTheGcdOfTwoIntegers

Synonym:

division algorithm

Type of Math Object:

Theorem

Major Section:

Reference

## Mathematics Subject Classification

11A51*no label found*

- Forums
- Planetary Bugs
- HS/Secondary
- University/Tertiary
- Graduate/Advanced
- Industry/Practice
- Research Topics
- LaTeX help
- Math Comptetitions
- Math History
- Math Humor
- PlanetMath Comments
- PlanetMath System Updates and News
- PlanetMath help
- PlanetMath.ORG
- Strategic Communications Development
- The Math Pub
- Testing messages (ignore)

- Other useful stuff
- Corrections