Material Insights · Understanding the Material World

Number theory and modular arithmetic: The idea

In plain words

The idea explained without jargon

Number theory studies the whole numbers: which are prime, how numbers divide, and what is left over when they do not. Modular arithmetic is arithmetic that wraps round, like a clock that goes back to zero [3]. On a 12-hour clock, ten hours after 5 o'clock is 3 o'clock, because only the remainder after dividing by 12 matters. Gauss gave the idea its first full account in 1801 and a short notation to go with it [2][3]. The surprise is that some tasks are easy one way and very hard the other. Multiplying two large primes is quick, but recovering them from the product is hard. The RSA public-key method, written up in 1977, builds on that gap, and its security rests in part on the difficulty of factoring [5][6].

as of 2026-11-12

Key equation

The equation that sums it up, and what each symbol means

Equation
a ≡ b (mod n)
Symbols
{"a":"any whole number","b":"another whole number that leaves the same remainder as a","n":"the modulus, the number at which the count wraps round (12 on a clock face)","≡":"the congruence sign, 'has the same remainder as'"}
Note
Britannica credits Gauss with this notation in 1801 [3]. It says that a and b differ by a whole number of laps of size n. The 1977 public-key method applies the same idea to very large numbers: a message is turned into a number, raised to a published power, and only the remainder after dividing by a published product of two large primes is kept [5].

as of 2026-11-12

An analogy

A picture from everyday life that makes the idea easier to hold

A clock face is a number line bent into a circle. Keep adding hours and the hand goes round and starts again, so only where it points matters, not how many laps it has made. Number theory uses the same idea with any wrap-around size, not only the hours of a clock. The picture stops being true for the hard part: a clock gives no hint of why finding the prime factors of a huge number is so difficult.

as of 2026-11-12

Sources

  1. Disquisitiones Arithmeticae Encyclopaedia Britannica
  2. Modular arithmetic Encyclopaedia Britannica (article by John L. Berggren)
  3. A Method for Obtaining Digital Signatures and Public-key Cryptosystems MIT Libraries, DSpace@MIT (technical memo MIT-LCS-TM-082), 1977
  4. A method for obtaining digital signatures and public-key cryptosystems (bibliographic record with abstract) Ronald L. Rivest, MIT CSAIL (record of the Communications of the ACM 21(2) paper, February 1978), 1978