Here is a list of articles in the Modular arithmetic category of the Computing portal that unifies foundations of mathematics and computations using computers. In mathematics, modular arithmetic is a system of arithmetic for certain equivalence classes of integers, called congruence classes. Sometimes it is suggestively called 'clock arithmetic', where numbers 'wrap around' after they reach a certain value (the modulus). For example, when the modulus is 12, then any two numbers that leave the same remainder when divided by 12 are equivalent (or "congruent") to each other.
This category has only the following subcategory.
- ► Quadratic residue (7 P)
Pages in category "Modular arithmetic"
The following 62 pages are in this category, out of 62 total.
- Modular arithmetic (computing)
- Barrett reduction (computing)
- Canon arithmeticus (computing)
- Carmichael function (computing)
- Carmichael number (computing)
- Chinese remainder theorem (computing)
- Cipolla's algorithm (computing)
- Combined linear congruential generator (computing)
- Congruence of squares (computing)
- Congruence relation (computing)
- Cubic reciprocity (computing)
- Gauss's lemma (number theory) (computing)
- Hensel's lemma (computing)
- Method of successive substitution (computing)
- Mod n cryptanalysis (computing)
- Modular exponentiation (computing)
- Modular multiplicative inverse (computing)
- Modulo operation (computing)
- Montgomery modular multiplication (computing)
- Multiplicative group of integers modulo n (computing)
- Multiplicative order (computing)
- Solovay–Strassen primality test (computing)
- Wilson's theorem (computing)
- Zeller's congruence (computing)