Skip to main content.

Posts about greatest common divisor.

We will discuss Euclidean domains together with a constructive proof of the fact that every two elements have a greatest common divisor, which is essentially the Euclidean algorithm.