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).

单词	DivisionAlgorithmForIntegers
释义	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).
随便看	Cantor function CantorNormalForm Cantor normal form CantorsDiagonalArgument CantorSet Cantor set CantorsIntersectionTheorem CantorSpace Cantor space CantorsParadox CantorsTheorem CantorZassenhausSplit Cantor-Zassenhaus split Cantor’s diagonal argument Cantor’s Intersection Theorem Cantor’s paradox Cantor’s theorem CapacityGeneratedByAMeasure capacity generated by a measure CapProduct cap product CaratheodorysExtensionTheorem CaratheodorysLemma CaratheodorysTheorem Carathéodory’s extension theorem