Foundations — Modular arithmetic — definition, addition, multiplication, congruence

Before you can read a single line of the parent note, you need to own every symbol it throws at you. This page builds them one at a time, in an order where each new piece leans only on pieces already standing. Nothing is assumed — not even what a remainder is.

1. The number line and the integers

The picture: a straight line with evenly spaced dots, $0$ in the middle, positives marching right, negatives marching left.

Why the topic needs it: modular arithmetic only talks about integers. When the parent writes $a-b=kn$, all of $a$, $b$, $k$, $n$ are integers — points on this line. Fractions never appear (that is exactly why "division" is the dangerous operation later).

2. Divides, quotient, and remainder — the Division Algorithm

Everything in this topic rests on one everyday act: splitting a pile into equal groups and seeing what's left over.

The rule that this pair always exists and is unique is the Division Algorithm — the true foundation stone of the whole chapter.

The picture: lay $a$ dots along the line, then chop the line into blocks of width $n$. The number of complete blocks is $q$; the short stub past the last complete block is $r$.

Why the topic needs it: the parent's second definition of congruence — "same remainder when divided by $n$" — is meaningless until you know that "the remainder" is a single, well-defined number. The Division Algorithm guarantees it.

3. The symbol $\mid$ — "divides"

The picture: on the number line, $m$ lands exactly on one of the tick marks you'd hit by counting in steps of $n$.

Why the topic needs it: the first definition of congruence says $a-b=kn$ — that is exactly "$n$ divides $a-b$," or $n\mid (a-b)$. So "divides" and "same remainder" are two costumes on the same idea, which we now have the tools to prove.

4. The letters $a,b,n,k,q,r$ — what each stands for

Why the topic needs it: every rule in the parent ("$a\equiv b$", "$a-b=kn$") is stated with these letters so it holds for all integers simultaneously. Reading modular arithmetic is largely reading these letters correctly.

5. Wrapping the line into a circle — the picture of "mod"

Now the key mental move. Take the number line from Section 1 and roll it up so that $0,n,2n,3n,\dots$ all stack on the same spot.

Every integer, positive or negative, lives at exactly one of the $n$ marks. That mark is its remainder.

6. The congruence symbol $\equiv$ and the tag $(\mathrm{mod}n)$

Notice the symbol is $\equiv$ (three bars), not $=$ (two bars). Two things being equal means identical numbers; being congruent means only "same clock position." $23$ and $8$ are not equal, but $23\equiv 8(\mathrm{mod}5)$ because both point at the $3$ mark.

7. Equivalence classes — the "buckets"

The picture: each mark on the circle is the mouth of a bucket; all integers funnelling into that mark live inside it.

Why the topic needs it: the parent's phrase "they're in the same bucket" and the claim that congruence is an equivalence relation (reflexive, symmetric, transitive) are exactly statements about these buckets. Reflexive = every number is in its own bucket; symmetric = bucket-sharing goes both ways; transitive = if $a,b$ share a bucket and $b,c$ share a bucket, then $a,c$ do too.

8. $\gcd$ and coprime — the gate that guards division

The picture: list the tick-spacings that hit both numbers exactly; the biggest such spacing is the gcd. (See GCD and LCM for the full machinery.)

Why the topic needs it: the parent's "can't cancel $6$ in $6x\equiv 9(\mathrm{mod}15)$" fails precisely because $\gcd (6,15)=3\ne 1$. Division mod $n$ is legal only when the divisor is coprime to $n$ — the doorway into Modular Inverses and Linear Congruences.

Prerequisite map

Equipment checklist

Give a numeral or one-line answer, then reveal.