Ring theory MOC

GCD

Let 𝑅 be an integral domain and 𝑎,𝑏 ∈𝑅. An element 𝑑 ∈𝑅 is a greatest common divisor or GCD of 𝑎 and 𝑏 iff #m/def/ring

and ⟨𝑎,𝑏⟩ ⊴⟨𝑑′⟩ ⊴⟨𝑑⟩ implies ⟨𝑑′⟩ =⟨𝑑⟩.¹ The GCD is unique up to associate elements, leading to the abuse of notation

Properties

1. GCDs exist for nonzero elements in a UFD

#state/develop | #lang/en | #SemBr