Modulus Calculator
Use this tool to compute remainders and test modular congruence. Great for math homework, coding checks, and number theory practice.
1) Remainder Calculator (a mod b)
Tip: JavaScript uses the remainder operator (%). For negative numbers, a normalized positive modulus is also shown.
2) Congruence Checker (x ≡ y (mod m))
What Is Modulus?
In arithmetic, the modulus operation tells you the remainder after division.
If you compute a mod b, you are asking: “What is left over when a is divided by b?”
Example: 29 mod 6 = 5 because 6 × 4 = 24 and 29 - 24 = 5.
Why Modulus Matters
- Time calculations: A 12-hour clock cycles with modulo 12.
- Computer science: Hash tables and array indexing often use modulo to stay inside bounds.
- Cryptography: RSA and many encryption methods rely heavily on modular arithmetic.
- Scheduling: Repeating events (every 7 days, every 24 hours) naturally use modulus.
How to Compute Modulus by Hand
Step-by-step process
- Divide
abyb. - Take the integer part of the quotient.
- Multiply that integer quotient by
b. - Subtract from
a. The result is the remainder.
Formula: a = bq + r, where r is the remainder and usually satisfies 0 ≤ r < |b| in normalized form.
Example
For 83 mod 9:
83 ÷ 9 = 9remainder something9 × 9 = 8183 - 81 = 2
So, 83 mod 9 = 2.
Negative Numbers and Modulus
Negative inputs can be confusing because programming languages define remainder slightly differently.
In JavaScript, -13 % 5 returns -3, not 2.
For math courses, you often want the normalized positive modulus:
normalized = ((a % m) + m) % m
Using that rule, -13 mod 5 becomes 2, which fits the common range 0...m-1.
Modular Congruence
Two numbers are congruent modulo m if they leave the same remainder when divided by m.
We write this as x ≡ y (mod m).
Equivalent test: x - y must be divisible by m.
Example: 35 ≡ 11 (mod 12) because 35 - 11 = 24 and 24 is divisible by 12.
Common Mistakes to Avoid
- Using
mod 0(undefined operation). - Forgetting that language-specific
%behavior may differ for negatives. - Confusing quotient with remainder.
- Not normalizing results when your problem expects values in
[0, m-1].
Practical Coding Notes
In loops and index wrapping, modulus helps keep numbers bounded. For example, moving through a circular list:
nextIndex = (currentIndex + 1) % arrayLength;
This guarantees nextIndex stays in valid range.
Final Thoughts
Modulus calculations are simple, but they unlock powerful patterns in algebra, software, and security. If you understand remainders, normalized modulus, and congruence, you have a solid foundation for more advanced mathematics and programming.