Applications to Divisibility Tests
You'll learn how modular arithmetic elegantly proves why those divisibility tricks you memorized actually work.
The Core Idea
Remember testing if a number is divisible by 3 by adding its digits? Or the alternating sum trick for divisibility by 11? These aren't magic—they're direct consequences of modular arithmetic. By working modulo n, we can transform complicated divisibility questions into simple arithmetic on small numbers.
The secret lies in recognizing that our decimal system writes numbers as sums of powers of 10. Since 10 has different remainders modulo different divisors, we can exploit these patterns.
How It Works
Divisibility by 3 and 9: Notice that 10 ≡ 1 (mod 3) and 10 ≡ 1 (mod 9). This means 10² ≡ 1, 10³ ≡ 1, and so on.
For a number like 4,725 = 4·10³ + 7·10² + 2·10 + 5:
- Modulo 3: 4·1 + 7·1 + 2·1 + 5 ≡ 4+7+2+5 = 18 ≡ 0 (mod 3) ✓
The digit sum has the same remainder as the original number! So 4,725 is divisible by 3 (and by 9, since 18 ≡ 0 mod 9).
Divisibility by 11: Here 10 ≡ -1 (mod 11), so 10² ≡ 1, 10³ ≡ -1, alternating forever.
For 4,725: 4·(-1) + 7·1 + 2·(-1) + 5 = -4+7-2+5 = 6 (mod 11)
Since 6 ≢ 0 (mod 11), the number 4,725 is not divisible by 11. The alternating digit sum reveals divisibility!
Other divisors: For divisibility by 2, 5, or 10, we only need the last digit because 10 ≡ 0 modulo these values.
Key Takeaway: Divisibility tests emerge naturally from analyzing 10^k modulo n—modular arithmetic transforms intuitive shortcuts into rigorous mathematics.