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.

Articles in category "Modular arithmetic"

There are 30 articles in this category.

Advanced modular arithmetic theory C Carmichael function Carmichael number Carmichael's theorem Chinese remainder theorem Congruence of squares Congruence relation D Discrete logarithm E Euler's criterion Euler's theorem

E cont. Euler's totient function F Fermat primality test Fermat's little theorem G Gauss lemma H Hensel's lemma J Jacobi symbol L Legendre symbol Linear congruence theorem Luhn algorithm M Method of successive substitution Modular arithmetic

M cont. Multiplicative order P Primitive root modulo n Proofs of Fermat's little theorem Q Quadratic reciprocity Quadratic residue R Residue number system S Solovay-Strassen primality test W Wilson's theorem Z Zeller's congruence