Euclidean Division

Euclidean division, or division with remainder, is the process of dividing one integer, the dividend, by another, the divisor, so as to produce an integer quotient and a natural number remainder that is strictly smaller than the absolute value of the divisor. A fundamental property is that, under the usual conditions, this quotient and remainder exist and are unique, so Euclidean division can be discussed as a fact about integers even before choosing an algorithm to compute it; the actual computation is carried out by integer division algorithms, the best known being long division. Euclidean division underlies many basic questions about integers, including finding the greatest common divisor of two numbers and working in modular arithmetic, where only the remainder, produced by the modulo operation, is considered. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/