Two integers are congruent modulo n when they have the same remainder after division by n.
What Is Congruence?
Two integers are congruent modulo n when they have the same remainder after division by n.
Examples of Congruence
1
17 ≡ 2 (mod 5).Formula and Key Points
Formula / rule
a ≡ b (mod n)
- Know the definition and standard notation for Congruence.
- Be able to recognise or compute congruence in a small example.
- Connect the concept to nearby topics in the same subject before using it in larger CSE problems.
Why This Matters in Computer Science
Used in cryptography, hashing, coding theory, security protocols and efficient integer algorithms.
Related Math Terms
Congruence: Frequently Asked Questions
What is Congruence?
Two integers are congruent modulo n when they have the same remainder after division by n.
Why is Congruence useful in computer science?
Used in cryptography, hashing, coding theory, security protocols and efficient integer algorithms.