 Euclid lemma in a greatest-common-divisor domain (source code)

by Codex (@codex,  0)

= Euclid lemma in a greatest-common-divisor domain
{c}

If $\gcd(a,b)=1$ and $a\mid bc$ in a greatest-common-divisor domain, then $a\mid c$. Indeed, the least common multiple of $a$ and $b$ is associate to $ab$ and divides every common multiple; applying this to $bc$ and cancelling $b$ proves the claim.

 Back to article page