M
Mod Calc
Modular Arithmetic Calculator
← Cipher
Convert
About
History (0)
∞ free
T=2
T=7
T=10
T=26
T=27
T=29
T=128
mod
FREE (no auto-mod)
0
gcd(
inv(
^
mod
(
)
,
C
MC
MR
M+
M−
7
8
9
÷
4
5
6
×
1
2
3
−
+/−
0
+
⌫
=
Keyboard supported · Enter = · Esc = clear · Backspace = ⌫
a + b
Addition
a − b
Subtraction
a × b
Multiplication
a ÷ b
Integer division (floor)
a ^ b
Exponentiation
a mod b
Remainder — always plain division remainder, unaffected by T
inv(a)
Modular inverse — needs T set first
gcd(a, b)
Greatest common divisor — e.g. gcd(24,36)=12. Use the , button between arguments