Euclidean division

This article is about division of integers. For polynomials, see Euclidean division of polynomials. For other domains, see Euclidean domain.
17 is divided into 3 groups of 5, with 2 as leftover. Here, the dividend is 17, the divisor is 3, the quotient is 5, and the remainder is 2 (which is strictly smaller than the divisor 3), or more symbolically, 17 = (3 × 5) + 2.

In arithmetic, Euclidean division – or division with remainder – is the process of dividing one integer (the dividend) by another (the divisor), in a way that produces an integer quotient and a natural number remainder strictly smaller than the absolute value of the divisor. A fundamental property is that the quotient and the remainder exist and are unique, under some conditions. Because of this uniqueness, Euclidean division is often considered without referring to any method of computation, and without explicitly computing the quotient and the remainder. The methods of computation are called integer division algorithms, the best known of which being long division.

Euclidean division, and algorithms to compute it, are fundamental for many questions concerning integers, such as the Euclidean algorithm for finding the greatest common divisor of two integers,[1] and modular arithmetic, for which only remainders are considered.[2] The operation consisting of computing only the remainder is called the modulo operation,[3] and is used often in both mathematics and computer science.

The pie has 9 slices, so each of the 4 people receives 2 slices and 1 is left over.
  1. ^ "Division and Euclidean algorithms". www-groups.mcs.st-andrews.ac.uk. Archived from the original on 2021-05-06. Retrieved 2019-11-15.
  2. ^ "What is modular arithmetic?". Khan Academy. Retrieved 2019-11-15.
  3. ^ "Fun With Modular Arithmetic – BetterExplained". betterexplained.com. Retrieved 2019-11-15.