Simplifying fractions, RSA cryptography, Diophantine equations.

What is Euler's totient?

φ(n) counts integers 1..n coprime to n. Key in RSA: a^φ(n) ≡ 1 (mod n).

What is modular arithmetic?

17 mod 5 = 2 (remainder). Used in clocks, cryptography, checksums.

Compute GCD, LCM, modular arithmetic, modular inverse, Euler's totient, and Bezout coefficients.

Guia Completa de Usuario

GCD & LCM: enter multiple integers. Modular: compute a mod m, inverse, and φ(m). Bezout: find x, y such that ax+by = gcd(a,b).

La Formula Matematica

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.

Preguntas Frecuentes

Calcular

Precision Verificada

Seguro

100% Gratis

Preciso