Number Theory Calculator
Compute GCD, LCM, modular arithmetic, modular inverse, Euler's totient, and Bezout coefficients.
Complete User Guide
GCD & LCM: enter multiple integers. Modular: compute a mod m, inverse, and φ(m). Bezout: find x, y such that ax+by = gcd(a,b).
The Mathematical Formula
Extended Euclidean: ax + by = gcd(a,b)
GCD: Euclidean algorithm. LCM: |ab|/gcd(a,b). Modular inverse exists iff gcd(a,m)=1. Euler totient φ(p) = p-1 for prime p.
Frequently Asked Questions
Related Tools
Calculate
Verified Precise
Secure 100% Free Precise