Your teacher writes 7 \equiv 3 \pmod 4 on the board, then a minute later writes 7 = 3 \pmod 4, and treats the two as interchangeable. Your classmate nods along. You squint — those are different symbols, and different symbols usually mean different things. Are they actually the same here?
No. The sloppy version is tolerated in school, but = and \equiv mean genuinely different things. Once you are doing anything beyond "find the remainder," the distinction starts to matter, and the places where it matters are exactly the places where students make their classic modular-arithmetic mistakes. Here is the clean version.
Equals: same number
The symbol = claims two expressions denote the exact same number.
means "2 + 3" and "5" are two different names for one and the same object: the integer five. You can substitute either for the other anywhere in any formula, ever, and nothing changes. This is the strictest equivalence mathematics has.
is false. Seven and three are different integers. No context makes this statement true, because = ignores context. It only cares whether the two sides are the same number.
Congruence: same residue class
The symbol \equiv (with a \pmod n tag) claims two numbers live in the same remainder class modulo n.
means: 7 and 3 give the same remainder when you divide by 4. Both leave remainder 3. Equivalently, 4 divides 7 - 3 = 4. They are not the same integer — 7 \neq 3 — but modulo 4, they are treated as the same.
The \pmod 4 tag is essential. Drop it and the statement is nonsense: "7 \equiv 3" alone does not assert anything. Congruence is always relative to a modulus.
The side-by-side picture
Two concrete examples
Example 1. Where \equiv holds but = does not.
Seven and three are not the same integer, so the equals-sign statement is flat wrong. But they share a remainder class mod 4 — both leave remainder 3 — so the congruence is true. This is the case that makes the two symbols feel different. An experiment your teacher can't wriggle out of: ask them whether 7 = 3. They will say no. Now ask whether 7 \equiv 3 \pmod 4. They will say yes. Those two answers can only be consistent if the symbols mean different things.
Example 2. Where both hold.
If two numbers are literally equal, they automatically share every residue class. So = always implies \equiv (for any modulus). This is why the sloppy version rarely causes trouble in routine computation — when both sides are the same number, both symbols agree. The problem starts when the sides are different numbers that happen to be in the same class.
When you can treat \equiv like =
Congruence mimics equality very well in most algebraic moves. If a \equiv b \pmod n and c \equiv d \pmod n, then:
- Addition: a + c \equiv b + d \pmod n.
- Subtraction: a - c \equiv b - d \pmod n.
- Multiplication: a \cdot c \equiv b \cdot d \pmod n.
- Integer powers: a^k \equiv b^k \pmod n for any fixed non-negative integer k.
These four operations preserve congruence. That is why modular arithmetic feels like ordinary arithmetic: you can rearrange both sides of a congruence, substitute equal-mod-n things for each other, and expand powers, all the usual way. Your teacher's sloppy habit works precisely because these are the operations you do in school all day.
When you cannot
Three moves that work fine with = but break with \equiv.
1. Division. From 6 = 10 - 4 you can freely divide both sides by 2 to get 3 = 5 - 2. From 6 \equiv 10 \pmod 4 you cannot blindly divide both sides by 2: that would give 3 \equiv 5 \pmod 4, which is false (3 leaves remainder 3, 5 leaves remainder 1). The rule is that you can only divide both sides of a congruence when the divisor is coprime to the modulus.
2. Variable exponents. a \equiv b \pmod n does not imply a^k \equiv b^k when k is itself a variable being reduced modulo something else. If a \equiv b \pmod n and k \equiv \ell \pmod m, it is almost never true that a^k \equiv a^\ell \pmod n unless m matches a specific order condition related to Euler's theorem. For ordinary equality, a = b and k = \ell make a^k = b^\ell trivially. For congruence, the base reduces mod n but the exponent does not reduce mod n — it reduces mod \phi(n) when \gcd(a, n) = 1, a completely different modulus.
3. Substituting across different moduli. With equals, a = b is context-free — you can use it anywhere. With congruence, a \equiv b \pmod n is only valid in statements about mod n. You cannot carry it into a mod m context unless m divides n.
The underlying reason
An equality a = b is one fact — the two sides are the same number, period. A congruence a \equiv b \pmod n is really an equality of something else: the equality of their residue classes. When you write 7 \equiv 3 \pmod 4, you are saying "the class of 7 equals the class of 3" in the quotient structure \mathbb{Z}/4\mathbb{Z}. That is still an equality — just at a different level of object. The symbol \equiv is a flag telling you which notion of "same" is in play.
The reason \equiv behaves mostly like = is that addition and multiplication are well-defined on classes. The reason it sometimes does not behave like = is that the new world \mathbb{Z}/n\mathbb{Z} has its own structure: zero divisors, non-invertible elements, and orders that do not match the integers.
The pattern to remember
- a = b: a and b are the same number.
- a \equiv b \pmod n: a and b have the same remainder when divided by n.
- = always implies \equiv, for every modulus. The converse is almost never true.
- Addition, subtraction, multiplication, and fixed-integer powers transport cleanly from = to \equiv. Division, variable exponents, and cross-modulus moves do not.
Your teacher's sloppiness is forgivable for in-class computation — most school problems stay inside the "safe" operations. But once you hit a problem where division or a variable exponent appears, treating \equiv as = will give you the wrong answer. The cleanest habit: always use \equiv with a modulus tag, and reserve = for statements you would bet your lunch money on.
Related: Modular Arithmetic · "mod" as an Operator vs "mod" as a Congruence Relation · What Does a ≡ b (mod n) Actually Mean — Isn't It Just a = b? · Why You Can't Divide Congruences Like Equations · Is Modular Arithmetic Its Own Number System?