Modular Arithmetic

Modular exponentiation, modular inverse, gcd, lcm.

24

About this tool

Number-theory primitives used in RSA and competitive programming. Computes (base^exp) mod m, modular multiplicative inverse via extended Euclidean, gcd and lcm — all with BigInteger so huge numbers work.

An unhandled error has occurred. Reload ×