\begin{definition}[Definition:Coprime/Integers]
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''' {{iff}} $\gcd \set {a, b} = 1$.
{{EuclidSaid}}
:''{{:Definition:Euclid's Definitions - Book VII/12 - Relatively Prime}}''
{{EuclidDefRefNocat|VII|12|Relatively Prime}}
\end{definition}