Coprime

Two integer numbers are coprime or relatively primes when their greatest common divisor is 1 ($gcd(x,y)=1$). This does not mean that any of these numbers is prime.

Two random numbers are coprime with a probability over 60% (the exact number is $6/{\pi }^2$).

Three random numbers are coprime with a probability over 83%.

When two integers $m$ and $n$ are coprime, it is possible to define the modular inversion of $m(\mathrm{mod}n)$ and thus the modular division by $m(\mathrm{mod}n)$.

External links

• Wikipedia