🔢Modular Arithmetic Calculator
Modular arithmetic wraps numbers around after reaching a modulus. a mod m is the remainder when a is divided by m. Foundational in cryptography, checksums, and number theory.
- 1a mod m = remainder of a ÷ m
- 2(a+b) mod m = ((a mod m)+(b mod m)) mod m
- 3Modular exponentiation: fast algorithm for aⁿ mod m
17 mod 5=217 = 3×5 + 2
⭐
Fun Fact
RSA encryption (securing all HTTPS traffic) relies on modular exponentiation. Reversing the operation (discrete logarithm) is computationally infeasible for large numbers.
References
🔒
100% Gratis
Sin registro
✓
Preciso
Fórmulas verificadas
⚡
Instantáneo
Resultados al instante
📱
Compatible móvil
Todos los dispositivos