Coprime

Two integer numbers are coprime or relatively primes when their greatest common divisor is 1 ([math]\displaystyle{ \gcd{(x,y)} = 1 }[/math]). 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 [math]\displaystyle{ 6/\pi^2 }[/math]).

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

When two integers [math]\displaystyle{ m }[/math] and [math]\displaystyle{ n }[/math] are coprime, it is possible to define the modular inversion of [math]\displaystyle{ m \pmod{n} }[/math] and thus the modular division by [math]\displaystyle{ m \pmod{n} }[/math].

External links

• Wikipedia