Euclidean division, division with remainder

In arithmetic, Euclidean division — or division with the remainder — is the process of dividing one integer (the dividend) by another (the divisor), in such a way that produces a quotient and a remainder smaller than the divisor.^[1] 

Its main 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.