Skip to content
ENExplore Calculators

Coprime Checker Calculator

Work out coprime checker instantly with clear inputs, formula shown and shareable results.

About Coprime Checker Calculator

Two numbers are coprime when their greatest common divisor is 1, meaning they share no prime factor. Euclid's algorithm computes the gcd by repeated remainder, and coprimality is exactly the condition for a modular inverse to exist.

Formulas

Coprimality

gcd(a, b) = 1

Product identity

gcd(a, b) × lcm(a, b) = a × b

Worked example

With the default values below, Coprime Checker Calculator returns Result of 35 and 64 are coprime. Change any input above and every figure here is recalculated in your browser.

Inputs used

First numberminimum 1
35
Second numberminimum 1
64

Results

Result
35 and 64 are coprime
Greatest common divisor
1
Lowest common multiple
2,240
Inverse of the first modulo the second (0 if none)
11

Step by step

  1. 1Values used
  2. 2Coprimality
  3. 3Product identity
  4. 4Result= 35 and 64 are coprime
  5. 5Greatest common divisor= 1
  6. 6Lowest common multiple= 2,240
  7. 7Inverse of the first modulo the second (0 if none)= 11

Assumptions and limits

  • The result is derived only from the 2 inputs listed above. Anything not among them is not part of the calculation.
  • In particular, this calculator does not take inflation, tax, fees or charges or compounding frequency into account.
  • Figures are rounded for display to whole numbers, so totals built from several rounded parts can differ slightly from the unrounded arithmetic.

How these calculators are built and tested is described on the Methodology page. If a figure looks wrong, please report it.

Frequently Asked Questions

Are 35 and 64 coprime?

Yes. 35 = 5 × 7 and 64 = 2⁶ share nothing, so the gcd is 1 and the lcm is 2240.

Must coprime numbers be prime?

No. 8 and 9 are both composite yet coprime.

Related Calculators

Coprime Checker Calculator | Calcrivo