Category:Integers Divided by GCD are Coprime

From ProofWiki
Jump to navigation Jump to search

This category contains pages concerning Integers Divided by GCD are Coprime:

Let $a, b \in \Z$ be integers which are not both zero.

Let $d$ be a common divisor of $a$ and $b$, that is:

$\dfrac a d, \dfrac b d \in \Z$


$\gcd \set {a, b} = d$

if and only if:

$\gcd \set {\dfrac a d, \dfrac b d} = 1$

that is:

$\dfrac a {\gcd \set {a, b} } \perp \dfrac b {\gcd \set {a, b} }$


$\gcd$ denotes greatest common divisor
$\perp$ denotes coprimality.

Pages in category "Integers Divided by GCD are Coprime"

The following 4 pages are in this category, out of 4 total.