Greatest common divisor in an integral domain
Summary
A greatest common divisor of two elements of an integral domain is a common divisor that every common divisor divides. It is unique up to associates when it exists. The definition of a greatest common divisor gives the conditions.
What this node needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a node is. They do not measure its truth.
Sources
- Web https://en.wikipedia.org/wiki/GCD_domain, lead section