You're likely familiar with finding the remainder of a division. For example, 17 divided by 12 leaves a remainder of 5. Modular arithmetic uses this idea but formalises it into a more powerful concept: congruence.

Two integers, $a$ and $b$, are said to be congruent modulo n if their difference, $(a - b)$, is an integer multiple of $n$. This means $n$ divides $(a-b)$ evenly, which we write as $n | (a - b)$. The relationship is expressed with a special notation:

Let's use our earlier example. We can say that $17 \equiv 5 \pmod{12}$ because their difference, $17 - 5 = 12$, is divisible by 12. Similarly, $29 \equiv 5 \pmod{12}$ because $29 - 5 = 24$, which is also divisible by 12. In essence, congruence tells us that two numbers share the same remainder when divided by the modulus.

This is slightly different from the modulo operator (%) you might see in programming languages. That operator is a function that returns a single value: the remainder. Congruence, on the other hand, describes a relationship between two numbers.

Congruence is useful because it groups all integers into a finite number of sets based on their remainder. Each of these sets is called a residue class or congruence class.

Every integer belongs to exactly one residue class for a given modulus $n$. For example, let's look at modulus 4. There are four possible remainders when you divide an integer by 4: 0, 1, 2, or 3. This gives us four residue classes.

The number 10 belongs to the class $[2]_4$ because $10 \div 4$ leaves a remainder of 2. The number -5 belongs to the class $[3]_4$ because $-5 = (4 \times -2) + 3$. Any number in a class can be used to represent the entire class. So, $[3]_4$ is the same set as $[-1]_4$ or $[7]_4$.

The complete set of all residue classes modulo $n$ is denoted as $\mathbb{Z}/n\mathbb{Z}$. So, for our example, $\mathbb{Z}/4\mathbb{Z} = \{ [0]_4, [1]_4, [2]_4, [3]_4 \}$. This finite set is the foundation for arithmetic in modular systems.

Congruence isn't just a casual relationship; it's a formal equivalence relation This means it has three specific properties that make it mathematically sound and consistent. These properties allow us to treat congruent numbers as interchangeable in many contexts.

These three rules ensure that the system of residue classes is well-behaved. They are the logical bedrock that allows us to perform algebra with congruences, substituting one number for another as long as they belong to the same residue class.

A great way to visualise modular arithmetic is with a number circle, much like the face of a clock. For a modulus $n$, we can arrange the integers $0, 1, 2, \dots, n-1$ in a circle. As we count upwards, we simply loop around the circle. This is why modular arithmetic is sometimes called clock arithmetic

On this circle for modulus 6, the number 8 lands on the same spot as 2, because $8 \equiv 2 \pmod{6}$. The number -1 would be one step counter-clockwise from 0, landing on 5, because $-1 \equiv 5 \pmod{6}$. Every integer has a unique place on this circle, corresponding to its residue class.

This simple, visual model captures the essence of congruence: it's a system where the number line wraps around itself, repeating in a predictable cycle. This cyclical nature is what makes it so useful in areas from cryptography to music theory.