Modulus

For the term relating to complex numbers, see Complex number.

Aside from its unrelated use in complex numbers, the term modulus refers to the remainder, that is, the remainder of integer division. For example, in 11 / 3 the remainder is 2. This could be stated as $mod(11,3)=2\,$, though mathematicians much more commonly express it as "11 is congruent to 2 modulo 3" and write it symbolically as "$11\equiv 2\mod 3$".

The notion of congruence is actually more general than the remainder function. We could also say "2 is congruent to 11 modulo 3", or "$2\equiv 11\mod 3$".

"$x\equiv y\mod k$" means that Failed to parse (MathML with SVG or PNG fallback (recommended for modern browsers and accessibility tools): Invalid response ("Math extension cannot connect to Restbase.") from server "https://wikimedia.org/api/rest_v1/":): {\displaystyle x - y\,} is an integer multiple of $k\,$.

The remainder operation is also important in computer programming, and the term "modulus" is used to refer to this operation. In C-like languages it is denoted with a percent sign:

x = 11 % 3; // x is now 2

In complex numbers, the modulus is the analogue of the absolute value, given by $|a+bi|={\sqrt {a^{2}+b^{2}}}$.