# Modular arithmetic: Trending topics

The following are the current most viewed articles on Wikipedia within Wikipedia's Modular arithmetic category. Think of it as a What's Hot list for Modular arithmetic. More info »

This is a beta release and so the figures may be a day or two out of date. We'd love to get your thoughts.

Rank Topic Wikipedia views
1 Modular arithmetic 3,391 2 Luhn algorithm 1,128 3 Euler's totient function 1,003 4 Chinese remainder theorem 774 5 Fermat's little theorem 567 6 Euler's theorem 489 7 Linear congruential generator 431 8 Modular multiplicative inverse 390 9 Modular exponentiation 380 10 Primitive root modulo n 314 11 Discrete logarithm 308 12 Congruence relation 265 13 Quadratic reciprocity 247 14 Multiplicative group of integers modulo n 220 15 Quadratic residue 214 16 Wilson's theorem 181 17 Carmichael number 169 18 Verhoeff algorithm 135 19 Montgomery reduction 127 20 Legendre symbol 123 21 Linear congruence theorem 122 22 Fermat primality test 117 23 Proofs of Fermat's little theorem 111 24 Zeller's congruence 103 25 Carmichael function 83 26 Jacobi symbol 79 27 Hensel's lemma 64 28 Vedic square 63 29 Kronecker symbol 59 30 Park–Miller random number generator 59 31 Solovay–Strassen primality test 51 32 Tonelli–Shanks algorithm 50 33 Euler's criterion 48 34 Residue number system 48 35 Gauss's lemma (number theory) 44 36 Inversive congruential generator 42 37 Multiplicative order 37 38 Method of successive substitution 36 39 Luhn mod N algorithm 35 40 Cubic reciprocity 33 41 Cipolla's algorithm 31 42 Mod n cryptanalysis 30 43 Additive polynomial 22 44 Reduced residue system 22 45 Quartic reciprocity 21 46 Pocklington's algorithm 19 47 Congruence of squares 17 48 Kochanski multiplication 16 49 Beaver bit-vector decision procedure 9 50 Jordan's totient function 9 51 Vantieghems theorem less than 5 views
52 Barrett reduction less than 5 views

# Encyclopedia

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.

## Subcategories

This category has only the following subcategory.

## Pages in category "Modular arithmetic"

The following 50 pages are in this category, out of 50 total. This list may not reflect recent changes (learn more).