# Category:Modular arithmetic

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.

## Pages in category "Modular arithmetic"

The following 62 pages are in this category, out of 62 total.

- Modular arithmetic
*(computing)*

### A

- Additive polynomial
*(computing)* - Automorphic number
*(computing)*

### B

- Barrett reduction
*(computing)*

### C

- 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)*

### D

- Discrete logarithm
*(computing)* - Discrete logarithm records
*(computing)*

### E

- Euler's criterion
*(computing)* - Euler's theorem
*(computing)* - Euler's totient function
*(computing)*

### F

- Fermat primality test
*(computing)* - Fermat's little theorem
*(computing)* - Proofs of Fermat's little theorem
*(computing)*

### G

- Gauss's lemma (number theory)
*(computing)*

### H

- Hensel's lemma
*(computing)*

### J

- Jacobi symbol
*(computing)* - Jordan's totient function
*(computing)*

### K

- Kochanski multiplication
*(computing)* - Kronecker symbol
*(computing)* - Kronecker's congruence
*(computing)* - Kummer's congruence
*(computing)*

### L

- Legendre symbol
*(computing)* - Lehmer random number generator
*(computing)* - Linear congruential generator
*(computing)* - Luhn algorithm
*(computing)* - Luhn mod N algorithm
*(computing)*

### M

- 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)*

### P

- Permuted congruential generator
*(computing)* - Pocklington's algorithm
*(computing)* - Polydivisible number
*(computing)* - Primitive root modulo n
*(computing)*

### Q

- Quadratic reciprocity
*(computing)* - Quadratic residue
*(computing)* - Quartic reciprocity
*(computing)*

### R

- Reduced residue system
*(computing)* - Residue number system
*(computing)* - Root of unity modulo n
*(computing)*

### S

- Solovay–Strassen primality test
*(computing)*

### T

- Table of congruences
*(computing)* - Thue's lemma
*(computing)* - Tonelli–Shanks algorithm
*(computing)* - Totative
*(computing)*

### V

- Vantieghems theorem
*(computing)* - Vedic square
*(computing)* - Verhoeff algorithm
*(computing)*

### W

- Wilson's theorem
*(computing)*

### Z

- Zeller's congruence
*(computing)*