Main menu

Number Theory Linear Algebra Polynomial Equation

Number theory

Primality test

Prime factorization

Greatest common divisor

Modular inverse

a·X≡b(modn)

Euler's totient function Φ(n)

Order of integer modn

Smallest primitive root

Legendre symbol

Jacobi symbol

Modular inverse

Let a,n two coprime integers. Modular (multiplicative) inverse of a is another integer b such that
(a·b)≡1(modn)

Calculator