Coprime Calculator

Enter two integers to calculate the GCF and determine whether their only positive common factor is 1.

First integer

Second integer

—Two integers are coprime exactly when their GCF is 1.

—GCF

—Coprime?

—|a|

—|b|

Uses the Euclidean algorithm with exact integers.

Euclidean algorithm, Bézout identity & LCM evidence

Verify whether two integers are coprime, expose every Euclidean remainder step, and return Bézout coefficients that certify the GCD.

Integer AInteger B

—GCD

—Coprime?

—LCM

—Bézout identity

Ready.

Step	Dividend	Divisor	Quotient	Remainder

Represent → compare → factor → verify

Equivalent fraction forms should preserve the same rational value, and number-theory relationships should agree across factors, remainders, GCF, multiples, and prime structure. Use the connected tools to verify rather than relying on an isolated answer.