Modular arithmetic -

Modular arithmetic

In mathematics, modular arithmetic is a system of arithmetic for integers, where numbers "wrap around" when reaching a certain value, called the modulus. The modern approach to modular arithmetic was developed by Carl Friedrich Gauss in his book Disquisitiones Arithmeticae, published in 1801.

A familiar use of modular arithmetic is in the 12-hour clock, in which the day is divided into two 12-hour periods. If the time is 7:00 now, then 8 hours later it will be 3:00. Simple addition would result in 7 + 8 = 15, but clocks "wrap around" every 12 hours. Because the hour number starts over after it reaches 12, this is arithmetic modulo 12. In terms of the definition below, 15 is congruent to 3 modulo 12, so "15:00" on a 24-hour clock is displayed "3:00" on a 12-hour clock.



Given an integer n > 1, called a modulus, two integers are said to be congruent modulo n if n is a divisor of their difference, that is, if there is an integer k such that ab = kn.

Congruence modulo n is a congruence relation, meaning that it is an equivalence relation that is compatible with the operations of addition, subtraction, and multiplication. Congruence modulo n is denoted:

\({\displaystyle a\equiv b{\pmod {n}}.}\)

The parentheses mean that (mod n) applies to the entire equation, not just to the right-hand side (here b). This notation is not to be confused with the notation b mod n (without parentheses), which refers to the modulo operation: b mod n denotes the unique integer a such that 0 ≤ a < n and \({\displaystyle a\equiv b{\pmod {n}}.}\)

The congruence relation may be rewritten as

\({\displaystyle a=kn+b,}\)

explicitly showing its relationship with Euclidean division. However, b need not be the remainder of the division of a by n. More precisely, what the statement ab (mod n) asserts is that a and b have the same remainder when divided by n. That is,

\({\displaystyle a=pn+r,}\)
\({\displaystyle b=qn+r,}\)

where 0 ≤ r < n is the common remainder. Subtracting these two expressions, we recover the previous relation:

\({\displaystyle a-b=kn,}\)

by setting k = pq.


For example,

\({\displaystyle 38\equiv 14{\pmod {12}}}\)

because 38 − 14 = 24, which is a multiple of 12, or, equivalently, because both 38 and 14 have the same remainder 2 when divided by 12.

The definition of congruence also applies to negative values:

\({\displaystyle {\begin{aligned}-8&\equiv 7{\pmod {5}}\\2&\equiv -3{\pmod {5}}\\-3&\equiv -8{\pmod {5}}.\end{aligned}}}\)


The congruence relation satisfies all the conditions of an equivalence relation:

If a1b1 (mod n) and a2b2 (mod n), or if ab (mod n), then:

If ab (mod n), then it is false, in general, that kakb (mod n). However, one has:

For cancellation of common terms, we have the following rules:

The modular multiplicative inverse is defined by the following rules:

The multiplicative inverse xa–1 (mod n) may be efficiently computed by solving Bézout's equation \({\displaystyle ax+ny=1}\) for \({\displaystyle x,y}\) using the Extended Euclidean algorithm.

In particular, if p is a prime number, then a is coprime with p for every a such that 0 < a < p; thus a multiplicative inverse exists for all a not congruent to zero modulo p.

Some of the more advanced properties of congruence relations are the following:

\({\displaystyle a^{(p-1)/2}\equiv 1{\pmod {p}}.}\)

Congruence classes

Like any congruence relation, congruence modulo n is an equivalence relation, and the equivalence class of the integer a, denoted by an, is the set {… , a − 2n, an, a, a + n, a + 2n, …}. This set, consisting of the integers congruent to a modulo n, is called the congruence class or residue class or simply residue of the integer a, modulo n. When the modulus n is known from the context, that residue may also be denoted [a].

Residue systems

Each residue class modulo n may be represented by any one of its members, although we usually represent each residue class by the smallest nonnegative integer which belongs to that class (since this is the proper remainder which results from division). Any two members of different residue classes modulo n are incongruent modulo n. Furthermore, every integer belongs to one and only one residue class modulo n.[1]

The set of integers {0, 1, 2, …, n − 1} is called the least residue system modulo n. Any set of n integers, no two of which are congruent modulo n, is called a complete residue system modulo n.

The least residue system is a complete residue system, and a complete residue system is simply a set containing precisely one representative of each residue class modulo n.[2] The least residue system modulo 4 is {0, 1, 2, 3}. Some other complete residue systems modulo 4 are:

Some sets which are not complete residue systems modulo 4 are:

Reduced residue systems

Any set of φ(n) integers that are relatively prime to n and that are mutually incongruent modulo n, where φ(n) denotes Euler's totient function, is called a reduced residue system modulo n.[3] The example above, {5,15} is an example of a reduced residue system modulo 4.

Integers modulo n

The set of all congruence classes of the integers for a modulus n is called the ring of integers modulo n,[4] and is denoted \({\textstyle \mathbb {Z} /n\mathbb {Z} }\), \({\displaystyle \mathbb {Z} /n}\), or \({\displaystyle \mathbb {Z} _{n}}\). The notation \({\displaystyle \mathbb {Z} _{n}}\) is, however, not recommended because it can be confused with the set of n-adic integers. The ring \({\displaystyle \mathbb {Z} /n\mathbb {Z} }\) is fundamental to various branches of mathematics (see Applications below).

The set is defined for n > 0 as:

\({\displaystyle \mathbb {Z} /n\mathbb {Z} =\left\{{\overline {a}}_{n}\mid a\in \mathbb {Z} \right\}=\left\{{\overline {0}}_{n},{\overline {1}}_{n},{\overline {2}}_{n},\ldots ,{\overline {n{-}1}}_{n}\right\}.}\)

(When n = 0, \({\displaystyle \mathbb {Z} /n\mathbb {Z} }\) does not have zero elements; rather, it is isomorphic to \({\displaystyle \mathbb {Z} }\), since a0 = {a}.)

We define addition, subtraction, and multiplication on \({\displaystyle \mathbb {Z} /n\mathbb {Z} }\) by the following rules:

The verification that this is a proper definition uses the properties given before.

In this way, \({\displaystyle \mathbb {Z} /n\mathbb {Z} }\) becomes a commutative ring. For example, in the ring \({\displaystyle \mathbb {Z} /24\mathbb {Z} }\), we have

\({\displaystyle {\overline {12}}_{24}+{\overline {21}}_{24}={\overline {33}}_{24}={\overline {9}}_{24}}\)

as in the arithmetic for the 24-hour clock.

We use the notation \({\displaystyle \mathbb {Z} /n\mathbb {Z} }\) because this is the quotient ring of \({\displaystyle \mathbb {Z} }\) by the ideal \({\displaystyle n\mathbb {Z} }\) containing all integers divisible by n, where \({\displaystyle 0\mathbb {Z} }\) is the singleton set {0}. Thus \({\displaystyle \mathbb {Z} /n\mathbb {Z} }\) is a field when \({\displaystyle n\mathbb {Z} }\) is a maximal ideal, that is, when n is prime.

This can also be constructed from the group \({\displaystyle \mathbb {Z} }\) under the addition operation alone. The residue class an is the group coset of a in the quotient group \({\displaystyle \mathbb {Z} /n\mathbb {Z} }\), a cyclic group.[5]

Rather than excluding the special case n = 0, it is more useful to include \({\displaystyle \mathbb {Z} /0\mathbb {Z} }\) (which, as mentioned before, is isomorphic to the ring \({\displaystyle \mathbb {Z} }\) of integers), for example, when discussing the characteristic of a ring.

The ring of integers modulo n is a finite field if and only if n is prime. (this ensures every nonzero element has a multiplicative inverse). If \({\displaystyle n=p^{k}}\) is a prime power with k > 1, there exists a unique (up to isomorphism) finite field \({\displaystyle \mathrm {GF} (n)=\mathbb {F} _{n}}\) with n elements, but this is not \({\displaystyle \mathbb {Z} /n\mathbb {Z} }\), which fails to be a field because it has zero-divisors.

We denote the multiplicative subgroup of the modular integers by \({\displaystyle (\mathbb {Z} /n\mathbb {Z} )^{\times }}\). This consists of \({\displaystyle {\overline {a}}_{n}}\) for a coprime to n, which are precisely the classes possessing a multiplicative inverse. This forms a commutative group under multiplication, with order \({\displaystyle \varphi (n)}\).


In theoretical mathematics, modular arithmetic is one of the foundations of number theory, touching on almost every aspect of its study, and it is also used extensively in group theory, ring theory, knot theory, and abstract algebra. In applied mathematics, it is used in computer algebra, cryptography, computer science, chemistry and the visual and musical arts.

A very practical application is to calculate checksums within serial number identifiers. For example, International Standard Book Number (ISBN) uses modulo 11 (for 10 digit ISBN) or modulo 10 (for 13 digit ISBN) arithmetic for error detection. Likewise, International Bank Account Numbers (IBANs), for example, make use of modulo 97 arithmetic to spot user input errors in bank account numbers. In chemistry, the last digit of the CAS registry number (a unique identifying number for each chemical compound) is a check digit, which is calculated by taking the last digit of the first two parts of the CAS registry number times 1, the previous digit times 2, the previous digit times 3 etc., adding all these up and computing the sum modulo 10.

In cryptography, modular arithmetic directly underpins public key systems such as RSA and Diffie–Hellman, and provides finite fields which underlie elliptic curves, and is used in a variety of symmetric key algorithms including Advanced Encryption Standard (AES), International Data Encryption Algorithm (IDEA), and RC4. RSA and Diffie–Hellman use modular exponentiation.

In computer algebra, modular arithmetic is commonly used to limit the size of integer coefficients in intermediate calculations and data. It is used in polynomial factorization, a problem for which all known efficient algorithms use modular arithmetic. It is used by the most efficient implementations of polynomial greatest common divisor, exact linear algebra and Gröbner basis algorithms over the integers and the rational numbers.

In computer science, modular arithmetic is often applied in bitwise operations and other operations involving fixed-width, cyclic data structures. The modulo operation, as implemented in many programming languages and calculators, is an application of modular arithmetic that is often used in this context. The logical operator XOR sums 2 bits, modulo 2.

In music, arithmetic modulo 12 is used in the consideration of the system of twelve-tone equal temperament, where octave and enharmonic equivalency occurs (that is, pitches in a 1∶2 or 2∶1 ratio are equivalent, and C-sharp is considered the same as D-flat).

The method of casting out nines offers a quick check of decimal arithmetic computations performed by hand. It is based on modular arithmetic modulo 9, and specifically on the crucial property that 10 ≡ 1 (mod 9).

Arithmetic modulo 7 is used in algorithms that determine the day of the week for a given date. In particular, Zeller's congruence and the Doomsday algorithm make heavy use of modulo-7 arithmetic.

More generally, modular arithmetic also has application in disciplines such as law (see for example, apportionment), economics, (see for example, game theory) and other areas of the social sciences, where proportional division and allocation of resources plays a central part of the analysis.

Computational complexity

Since modular arithmetic has such a wide range of applications, it is important to know how hard it is to solve a system of congruences. A linear system of congruences can be solved in polynomial time with a form of Gaussian elimination, for details see linear congruence theorem. Algorithms, such as Montgomery reduction, also exist to allow simple arithmetic operations, such as multiplication and exponentiation modulo n, to be performed efficiently on large numbers.

Some operations, like finding a discrete logarithm or a quadratic congruence appear to be as hard as integer factorization and thus are a starting point for cryptographic algorithms and encryption. These problems might be NP-intermediate.

Solving a system of non-linear modular arithmetic equations is NP-complete.[6]

Example implementations

Below are three reasonably fast C functions, two for performing modular multiplication and one for modular exponentiation on unsigned integers not larger than 63 bits, without overflow of the transient operations.

An algorithmic way to compute \({\displaystyle a\cdot b{\pmod {m}}}\):[clarification needed]

uint64_t mul_mod(uint64_t a, uint64_t b, uint64_t m)
   if (!((a | b) & (0xFFFFFFFFULL << 32)))
       return a * b % m;   uint64_t d = 0, mp2 = m >> 1;
   int i;
   if (a >= m) a %= m;
   if (b >= m) b %= m;
   for (i = 0; i < 64; ++i)
       d = (d > mp2) ? (d << 1) - m : d << 1;
       if (a & 0x8000000000000000ULL)
           d += b;
       if (d >= m) d -= m;
       a <<= 1;
   return d;

On computer architectures where an extended precision format with at least 64 bits of mantissa is available (such as the long double type of most x86 C compilers), the following routine is[clarification needed], by employing the trick that, by hardware, floating-point multiplication results in the most significant bits of the product kept, while integer multiplication results in the least significant bits kept:[citation needed]

uint64_t mul_mod(uint64_t a, uint64_t b, uint64_t m)
   long double x;
   uint64_t c;
   int64_t r;
   if (a >= m) a %= m;
   if (b >= m) b %= m;
   x = a;
   c = x * b / m;
   r = (int64_t)(a * b - c * m) % (int64_t)m;
   return r < 0 ? r + m : r;

Below is a C function for performing modular exponentiation, that uses the mul_mod function implemented above.

An algorithmic way to compute \({\displaystyle a^{b}{\pmod {m}}}\):

uint64_t pow_mod(uint64_t a, uint64_t b, uint64_t m)
    uint64_t r = m==1?0:1;
    while (b > 0) {
        if (b & 1)
            r = mul_mod(r, a, m);
        b = b >> 1;
        a = mul_mod(a, a, m);
    return r;

However, for all above routines to work, m must not exceed 63 bits.

See also


  1. ^ Pettofrezzo & Byrkit (1970, p. 90)
  2. ^ Long (1972, p. 78)
  3. ^ Long (1972, p. 85)
  4. ^ It is a ring, as shown below.
  5. ^ Sengadir T., Discrete Mathematics and Combinatorics , p. 293, at Google Books
  6. ^ Garey, M. R.; Johnson, D. S. (1979). Computers and Intractability, a Guide to the Theory of NP-Completeness . W. H. Freeman. ISBN 0716710447.


External links

Categories: Modular arithmetic | Finite rings | Group theory

Information as of: 08.06.2020 10:58:23 CEST

Source: Wikipedia (Authors [History])    License : CC-by-sa-3.0

Changes: All pictures and most design elements which are related to those, were removed. Some Icons were replaced by FontAwesome-Icons. Some templates were removed (like “article needs expansion) or assigned (like “hatnotes”). CSS classes were either removed or harmonized.
Wikipedia specific links which do not lead to an article or category (like “Redlinks”, “links to the edit page”, “links to portals”) were removed. Every external link has an additional FontAwesome-Icon. Beside some small changes of design, media-container, maps, navigation-boxes, spoken versions and Geo-microformats were removed.

Please note: Because the given content is automatically taken from Wikipedia at the given point of time, a manual verification was and is not possible. Therefore does not guarantee the accuracy and actuality of the acquired content. If there is an Information which is wrong at the moment or has an inaccurate display please feel free to contact us: email.
See also: Legal Notice & Privacy policy.