MathLiveCongruence of integers
Two integers n and k are congruent modulo m exactly when their difference is divisible by m, meaning they leave the same remainder upon division by m. It is the basic relation of modular arithmetic used in number theory and cryptography.
n \equiv k \pmod{m} \Leftrightarrow m \mid (n - k)What the symbols mean
| first integer | |
| second integer | |
| modulus, a positive integer |
About this formula
- FieldMathematics
- TopicNumber theory
- LevelUniversity
- Also calledcongruence modulo, modular equality, modular congruence, integers congruent modulo m, n is congruent to k modulo m, modular arithmetic congruence
- SourceWikidata Q3773677
Write it in Obsidian
MathLive is a free visual math editor for Obsidian. Run Find a formula, type “congruence of integers”, and it goes into your note as editable LaTeX. You can also scan formulas from screenshots, PDFs and handwriting.