Modular arithmetic
| Table of contents |
|
2 The ring of congruence classes 3 Applications 4 History 5 See also 6 External link |
The congruence relation
Two integers a, b are said to be congruent modulo n if their difference is divisible by n; that is to say, if they leave the same remainder when divided by n. In this case, we write
- a ≡ b (mod n).
- 26 ≡ 14 (mod 12).
- a1 ≡ b1 (mod n)
- a2 ≡ b2 (mod n)
- a1 + a2 ≡ b1 + b2 (mod n)
- a1a2 ≡ b1b2 (mod n).
The ring of congruence classes
One can then define formally an addition and multiplication on the set
- Z/nZ = { [0]n, [1]n, [2]n, ..., [n−1]n }
- [a]n + [b]n = [a + b]n
- [a]n × [b]n = [ab]n
- [8]12 + [6]12 = [2]12.
The set Z/nZ has a number of important mathematical properties that make it the foundation of many different branches of mathematics. These are further developed in the article on modular arithmetic theory.
Applications
Modular arithmetic is applied in number theory, abstract algebra, cryptography, and visual and musical art.
In music, because of octave and enharmonic equivalency (that is, pitches in a 1/2 or 2/1 ratio are equivalent, and C# is the same as Db), modular arithmetic is used in the consideration of the twelve tone equally tempered scale, especially in twelve tone music. In visual art modular arithmetic can be used to create artistic patterns based on the multiplication and addition tables modulo n (see link below).
History
Modular arithmetic was introduced into mathematics in the book Disquisitiones Arithmeticae by Carl Friedrich Gauss in 1801.
See also
For more information on the group theory behind modular arithmetic, see
Some important theorems about modular arithmetic: For more advanced properties of modular arithmetic: Modular arithmetic is often used as a tool for primality tests and integer factorization.External link
- In this modular art article, one can learn more about applications of modular arithmetic in music.