APPLICATION OF MODULAR ARITHMETIC
1. Introduction
Modular arithmetic is a branch of number theory dealing with remainders. For integers a, b and n:
a ≡ b (mod n) if n divides (a − b).
2. Properties
(a + b) mod n = [(a mod n) + (b mod n)] mod n
(ab) mod n = [(a mod n)(b mod n)] mod n
3. Theorems
Fermat’s Theorem: a^(p−1) ≡ 1 (mod p)
Euler’s Theorem: a^φ(n) ≡ 1 (mod n)
4. Applications
- Cryptography (RSA Algorithm)
- Computer Science (hashing, memory)
- Clock Arithmetic
- Calendar Calculations
- Error Detection (ISBN)
- Coding Theory
5. Examples
7^100 mod 6 = 1
2x ≡ 4 (mod 6) ⇒ x ≡ 2 (mod 3)
5^20 mod 13 = 1
6. Conclusion
Modular arithmetic is essential in mathematics and computing, simplifying calculations and enabling
secure systems.
References
- Elementary Number Theory
- Discrete Mathematics by Kenneth Rosen