Residue Classes

From Congruence to Classes

Congruence modulo $n$ groups integers according to their remainders after division by $n$. If two integers have the same remainder, they are congruent modulo $n$.

For example,

because

and

The integers congruent to $2$ modulo $5$ form the set

This set is called a residue class modulo $5$.

Definition

Let $n\in\mathbb{N}$. For an integer $a$, the residue class of $a$ modulo $n$ is the set

Equivalently,

Thus a residue class contains all integers that differ from $a$ by a multiple of $n$.

For example,

Each element of this set leaves remainder $3$ when divided by $7$.

Representatives

Any integer belonging to a residue class may be used to name it. Such an integer is called a representative of the class.

For example,

These are not three different classes. They are three names for the same class.

The division algorithm gives a preferred set of representatives:

Every integer is congruent modulo $n$ to exactly one of these integers.

Thus modulo $7$, the complete list of residue classes is

Partition of the Integers

Residue classes modulo $n$ partition the integers. This means two things.

First, every integer lies in some residue class.

Second, two residue classes are either identical or disjoint.

For example, modulo $4$, the integers split into the four classes

Every integer appears in exactly one of these four sets.

Equality of Residue Classes

Two residue classes modulo $n$ are equal precisely when their representatives are congruent:

if and only if

Indeed, if $a\equiv b\pmod n$, then every integer congruent to $a$ is also congruent to $b$, so the classes are equal.

Conversely, if the classes are equal, then $a\in[a]_n=[b]_n$, so

Thus residue classes are determined by congruence, not by the particular representative chosen.

Arithmetic of Classes

Addition and multiplication of residue classes are defined by

and

These definitions are meaningful because congruence is compatible with addition and multiplication.

For example, modulo $5$,

Also,

The result depends only on the residue classes, not on the chosen representatives.

Well-Definedness

To say that class arithmetic is well defined means that choosing different representatives gives the same answer.

Suppose

and

Then

and

Therefore

and

This justifies arithmetic on residue classes.

The Ring of Residue Classes

The set of all residue classes modulo $n$ is denoted by

It consists of

With addition and multiplication defined by residue classes, this set forms a finite arithmetic system.

For example,

Inside this system,

and

The arithmetic “wraps around” after reaching the modulus.

Units Modulo $n$

A residue class $[a]_n$ is called a unit if it has a multiplicative inverse modulo $n$. That is, there exists a class $[b]_n$ such that

This is equivalent to

Such an inverse exists exactly when

For example, modulo $10$, the units are

The class $[2]_{10}$ is not a unit because

Role in Number Theory

Residue classes turn congruence into algebra. Instead of working with infinitely many integers, one works with finitely many classes modulo $n$.

This finite viewpoint is powerful. It underlies modular arithmetic, linear congruences, the Chinese remainder theorem, Euler’s theorem, Fermat’s little theorem, quadratic residues, and many cryptographic systems.

Residue classes show that arithmetic can be studied locally modulo a fixed integer, while still retaining information about the original integers.