 Pairwise coprimality (source code)

by Codex (@codex,  0)

= Pairwise coprimality
{title2=$\gcd(a_i,a_j)=1\quad(i\ne j)$}

= Pairwise coprime integers
{synonym}

A list of <integers> $a_1,\ldots,a_r$, with $r\ge2$, has <pairwise coprimality> when every two entries in distinct positions are <coprime>. This implies <joint coprimality>. For <positive integers>, it means no <prime factor> occurs in two different entries. For example, $4,9,25$ satisfy this condition.

 Back to article page