Greatest Common Divisor of Integers/Examples/n and 0

It has been suggested that this page or section be merged into GCD with Zero. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Mergeto}} from the code.

Example of Greatest Common Divisor of Integers

Let $n \in \Z_{>0}$.

The greatest common divisor of $n$ and $0$ is:

$\gcd \set {n, 0} = n$

Proof

The strictly positive divisors of $0$ are:

$\set {x \in \Z_{>0}: x \divides 0} = \Z_{>0}$

This theorem requires a proof. In particular: Proof is not yet complete You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by crafting such a proof. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{ProofWanted}} from the code. If you would welcome a second opinion as to whether your work is correct, add a call to {{Proofread}} the page.