Modulo

)''|the ''(mod )'' notation|Modular arithmetic|other uses}}

In computing, the modulo operation returns the remainder or signed remainder of a division, after one number is divided by another, called the ''modulus'' of the operation.

Given two positive numbers and , modulo (often abbreviated as ) is the remainder of the Euclidean division of by , where is the dividend and is the divisor.

For example, the expression "5 mod 2" evaluates to 1, because 5 divided by 2 has a quotient of 2 and a remainder of 1, while "9 mod 3" would evaluate to 0, because 9 divided by 3 has a quotient of 3 and a remainder of 0.

Although typically performed with and both being integers, many computing systems now allow other types of numeric operands. The range of values for an integer modulo operation of is 0 to ( mod 1 is always 0; is undefined, being a division by zero).

When exactly one of or is negative, the basic definition breaks down, and programming languages differ in how these values are defined. Provided by Wikipedia