Number Theory Algorithms

Number Theory Algorithms is a powerful Chrome extension for performing arithmetic and advanced number‑theory computations on very large integers. It includes a big integer calculator (add, subtract, multiply, divide, power, root, factorial), modular operations (mod, modular inverse, modular power), primality checks, Euler’s phi, next primes and twin primes, plus GCD and LCM.

The extension also implements classic algorithms and solvers: Euclidean and Extended Euclidean algorithms, linear Diophantine and congruence solvers, Tonelli‑Shanks for quadratic residues, simple quadratic form solving, modular factor search and a primes list. Ideal for students, researchers, developers and cryptography enthusiasts — performance depends on the device, but the tool provides fast, reliable computations for large-number experimentation and problem solving.