Definition:Coprime/Integers

Definition

Let $a$ and $b$ be integers such that $b \ne 0$ and $a \ne 0$ (that is, they are both non-zero).

Let $\gcd \set {a, b}$ denote the greatest common divisor of $a$ and $b$.

Then $a$ and $b$ are coprime if and only if $\gcd \set {a, b} = 1$.

In the words of Euclid:

Numbers prime to one another are those which are measured by an unit alone as a common measure.

Relatively Composite

If $\gcd \left\{{a, b}\right\} > 1$, then $a$ and $b$ are relatively composite.

That is, two integers are relatively composite if they are not coprime.

In the words of Euclid:

Numbers composite to one another are those which are measured by some number as a common measure.

Also known as

The statement $a$ and $b$ are coprime can also be expressed as:

$a$ and $b$ are relatively prime
$a$ is prime to $b$, and at the same time that $b$ is prime to $a$.

Notation

Let $a$ and $b$ be coprime integers, that is, such that $\gcd \left\{{a, b}\right\} = 1$.

Then the notation $a \perp b$ is preferred on $\mathsf{Pr} \infty \mathsf{fWiki}$.

If $\gcd \left\{{a, b}\right\} \ne 1$, the notation $a \not \!\! \mathop{\perp} b$ can be used.

Examples

$2$ and $5$

$2$ and $5$ are coprime.

$7$ and $27$

$7$ and $27$ are coprime.

$-9$ and $16$

$-9$ and $16$ are coprime.

$-27$ and $-35$

$-27$ and $-35$ are coprime.

Also see

• Results about coprime integers can be found here.