Introduction to Congruence Notation
What You'll Learn
You'll learn how to read and interpret the notation a ≡ b (mod n), which expresses a fundamental relationship between integers based on their remainders.
The Core Idea
When two integers leave the same remainder after division by some number n, we say they are congruent modulo n. This relationship gets special notation:
a ≡ b (mod n)
This reads as "a is congruent to b modulo n."
What does it actually mean? It means that n divides the difference (a - b). In other words:
n | (a - b)
Or equivalently: (a - b) = kn for some integer k.
Why This Matters
Think of a clock: 15 hours and 3 hours point to the same position on a 12-hour clock because 15 - 3 = 12, and 12 divides evenly into itself. We'd write:
15 ≡ 3 (mod 12)
The modulus (12) captures the "wrap-around" behavior.
Examples
- 17 ≡ 5 (mod 6) because 17 - 5 = 12, and 6 divides 12
- -2 ≡ 8 (mod 5) because -2 - 8 = -10, and 5 divides -10
- 100 ≡ 0 (mod 10) because 100 - 0 = 100, and 10 divides 100
Testing Congruence
To check if a ≡ b (mod n):
- Calculate (a - b)
- Check if n divides this difference evenly
- If yes, they're congruent!
Key Takeaway: The notation a ≡ b (mod n) means that n divides (a - b), capturing when two integers have the same remainder upon division by n.