Modulo

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 $a$ and $n$, $a$ modulo $n$ (often abbreviated as $a mod n$) is the remainder of the Euclidean division of $a$ by $n$, where $a$ is the dividend and $n$ 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 $a$ and $n$ both being integers, many computing systems now allow other types of numeric operands. The range of values for an integer modulo operation of $n$ is 0 to $n − 1$ ($a$ mod 1 is always 0; $a mod 0$ is undefined, being a division by zero).

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

Variants of the definition
In mathematics, the result of the modulo operation is an equivalence class, and any member of the class may be chosen as representative; however, the usual representative is the least positive residue, the smallest non-negative integer that belongs to that class (i.e., the remainder of the Euclidean division). However, other conventions are possible. Computers and calculators have various ways of storing and representing numbers; thus their definition of the modulo operation depends on the programming language or the underlying hardware.

In nearly all computing systems, the quotient $q$ and the remainder $r$ of $a$ divided by $n$ satisfy the following conditions:

This still leaves a sign ambiguity if the remainder is non-zero: two possible choices for the remainder occur, one negative and the other positive; that choice determines which of the two consecutive quotients must be used to satisfy equation (1). In number theory, the positive remainder is always chosen, but in computing, programming languages choose depending on the language and the signs of $a$ or $n$. Standard Pascal and ALGOL 68, for example, give a positive remainder (or 0) even for negative divisors, and some programming languages, such as C90, leave it to the implementation when either of $n$ or $a$ is negative (see the table under for details). $a$ modulo 0 is undefined in most systems, although some do define it as $a$.

• Divmod truncated.svg Many implementations use truncated division, for which the quotient is defined by
 * $q = \operatorname{trunc}\left(\frac{a}{n}\right)$

where $\operatorname{trunc}$ is the integral part function (rounding toward zero), i.e. the truncation to zero significant digits. Thus according to equation ($a,n$), the remainder has the same sign as the dividend a so can take $q$ values:
 * $r = a - n \operatorname{trunc}\left(\frac{a}{n}\right)$

• Divmod floored.svg Donald Knuth promotes floored division, for which the quotient is defined by
 * $q = \left\lfloor\frac{a}{n}\right\rfloor$

where ⌊⌋ is the floor function (rounding down). Thus according to equation ($n$), the remainder has the same sign as the divisor n:
 * $r = a - n \left\lfloor\frac{a}{n}\right\rfloor$

• Divmod Euclidean.svg Raymond T. Boute promotes Euclidean division, for which the quotient is defined by
 * $q = \sgn(n) \left\lfloor\frac{a}{\left

• n\right

• }\right\rfloor =

\begin{cases} \left\lfloor\frac{a}{n}\right\rfloor & \text{if } n > 0 \\ \left\lceil\frac{a}{n}\right\rceil  & \text{if } n < 0 \\ \end{cases}$ where $r$ is the sign function, ⌊⌋ is the floor function (rounding down), and ⌈⌉ is the ceiling function (rounding up). Thus according to equation ($$), the remainder is non negative:
 * $r = a -

• n

• \left\lfloor\frac{a}{\left

• n\right

• }\right\rfloor$

• Divmod rounding.svg Common Lisp and IEEE 754 use rounded division, for which the quotient is defined by
 * $q = \operatorname{round}\left(\frac{a}{n}\right)$

where $a$ is the round function (rounding half to even). Thus according to equation ($$), the remainder falls between $-\frac{n}{2}$ and $\frac{n}{2}$, and its sign depends on which side of zero it falls to be within these boundaries:
 * $r = a - n \operatorname{round}\left(\frac{a}{n}\right)$

• Divmod ceiling.svg Common Lisp also uses ceiling division, for which the quotient is defined by
 * $q = \left\lceil\frac{a}{n}\right\rceil$

where ⌈⌉ is the ceiling function (rounding up). Thus according to equation ($$), the remainder has the opposite sign of that of the divisor:
 * $r = a - n \left\lceil\frac{a}{n}\right\rceil$

If both the dividend and divisor are positive, then the truncated, floored, and Euclidean definitions agree. If the dividend is positive and the divisor is negative, then the truncated and Euclidean definitions agree. If the dividend is negative and the divisor is positive, then the floored and Euclidean definitions agree. If both the dividend and divisor are negative, then the truncated and floored definitions agree.

As described by Leijen, "Boute argues that Euclidean division is superior to the other ones in terms of regularity and useful mathematical properties, although floored division, promoted by Knuth, is also a good definition. Despite its widespread use, truncated division is shown to be inferior to the other definitions."

However, truncated division satisfies the identity $$({-a})/b = {-(a/b)} = a/({-b})$$.

Notation
Some calculators have a $2|n| − 1$ function button, and many programming languages have a similar function, expressed as $sgn$, for example. Some also support expressions that use "%", "mod", or "Mod" as a modulo or remainder operator, such as a % n or a mod n.

For environments lacking a similar function, any of the three definitions above can be used.

Common pitfalls
When the result of a modulo operation has the sign of the dividend (truncated definition), it can lead to surprising mistakes.

For example, to test if an integer is odd, one might be inclined to test if the remainder by 2 is equal to 1:

But in a language where modulo has the sign of the dividend, that is incorrect, because when $round$ (the dividend) is negative and odd, $mod$ mod 2 returns −1, and the function returns false.

One correct alternative is to test that the remainder is not 0 (because remainder 0 is the same regardless of the signs):

Another alternative is to use the fact that for any odd number, the remainder may be either 1 or −1:

A simpler alternative is to treat the result of n % 2 as if it is a boolean value, where any non-zero value is true:

Performance issues
Modulo operations might be implemented such that a division with a remainder is calculated each time. For special cases, on some hardware, faster alternatives exist. For example, the modulo of powers of 2 can alternatively be expressed as a bitwise AND operation (assuming $mod(a, n)$ is a positive integer, or using a non-truncating definition):

Examples:
 * x % 2 == x & 1
 * x % 4 == x & 3
 * x % 8 == x & 7

In devices and software that implement bitwise operations more efficiently than modulo, these alternative forms can result in faster calculations.

Compiler optimizations may recognize expressions of the form expression % constant where constant is a power of two and automatically implement them as expression & (constant-1), allowing the programmer to write clearer code without compromising performance. This simple optimization is not possible for languages in which the result of the modulo operation has the sign of the dividend (including C), unless the dividend is of an unsigned integer type. This is because, if the dividend is negative, the modulo will be negative, whereas expression & (constant-1) will always be positive. For these languages, the equivalence  has to be used instead, expressed using bitwise OR, NOT and AND operations.

Optimizations for general constant-modulus operations also exist by calculating the division first using the constant-divisor optimization.

Properties (identities)
Some modulo operations can be factored or expanded similarly to other mathematical operations. This may be useful in cryptography proofs, such as the Diffie–Hellman key exchange. The properties involving multiplication, division, and exponentiation generally require that $n$ and $n$ are integers.
 * Identity:
 * $x$ for all positive integer values of $a$.
 * If $n$ is a prime number which is not a divisor of $(a mod n) mod n = a mod n$, then $nx mod n = 0$, due to Fermat's little theorem.
 * Inverse:
 * $x$ denotes the modular multiplicative inverse, which is defined if and only if $p$ and $b$ are relatively prime, which is the case when the left hand side is defined: $ab mod p = a mod p$.
 * Distributive:
 * Division (definition): $[(−a mod n) + (a mod n)] mod n = 0$, when the right hand side is defined (that is when $b−1 mod n$ and $b$ are coprime), and undefined otherwise.
 * Inverse multiplication: $n$.
 * Division (definition): $[(b−1 mod n)(b mod n)] mod n = 1$, when the right hand side is defined (that is when $(a + b) mod n = [(a mod n) + (b mod n)] mod n$ and $ab mod n = [(a mod n)(b mod n)] mod n$ are coprime), and undefined otherwise.
 * Inverse multiplication: $a⁄b mod n = [(a mod n)(b−1 mod n)] mod n$.
 * Division (definition): $b$, when the right hand side is defined (that is when $n$ and $[(ab mod n)(b−1 mod n)] mod n = a mod n$ are coprime), and undefined otherwise.
 * Inverse multiplication: $fmod$.

In programming languages
In addition, many computer systems provide a divmod functionality, which produces the quotient and the remainder at the same time. Examples include the x86 architecture's IDIV instruction, the C programming language's div function, and Python's divmod function.

Modulo with offset
Sometimes it is useful for the result of $$ modulo $$ to lie not between 0 and $x - i * y$, but between some number $$ and $i$. In that case, $a$ is called an offset and $y$ is particularly common.

There does not seem to be a standard notation for this operation, so let us tentatively use $x$. We thus have the following definition: $y$ just in case $D = d · (D / d) + D % d$ and $n − 1$. Clearly, the usual modulo operation corresponds to zero offset: $d + n − 1$.

The operation of modulo with offset is related to the floor function as follows:
 * $$a \operatorname{mod}_d n = a - n \left\lfloor\frac{a-d}{n}\right\rfloor.$$

To see this, let $x = a - n \left\lfloor\frac{a-d}{n}\right\rfloor$. We first show that $d = 1$. It is in general true that $a mod_{d} n$ for all integers $n$; thus, this is true also in the particular case when $b = -\!\left\lfloor\frac{a-d}{n}\right\rfloor$ ; but that means that $x \bmod n = \left(a - n \left\lfloor\frac{a-d}{n}\right\rfloor\right)\! \bmod n = a \bmod n$, which is what we wanted to prove. It remains to be shown that $x = a mod_{d} n$. Let $d$ and $d$ be the integers such that $d ≤ x ≤ d + n − 1$ with $x mod n = a mod n$ (see Euclidean division). Then $\left\lfloor\frac{a-d}{n}\right\rfloor = k$, thus $x = a - n \left\lfloor\frac{a-d}{n}\right\rfloor = a - n k = d +r$. Now take $a mod n = a mod_{0} n$ and add $b$ to both sides, obtaining $x mod n = a mod n$. But we've seen that $(a + bn) mod n = a mod n$, so we are done.

The modulo with offset $d ≤ x ≤ d + n − 1$ is implemented in Mathematica as Mod[a, n, d]&thinsp;.

Implementing other modulo definitions using truncation
Despite the mathematical elegance of Knuth's floored division and Euclidean division, it is generally much more common to find a truncated division-based modulo in programming languages. Leijen provides the following algorithms for calculating the two divisions given a truncated integer division:

For both cases, the remainder can be calculated independently of the quotient, but not vice versa. The operations are combined here to save screen space, as the logical branches are the same.