Posts Tagged ‘greatest common divisor’
Euclidean Domains, and the Extended Euclidean Algorithm.
wednesday, november 18th, 2009We 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.
We will state several (more or less) useful properties of the Extended Euclidean Algorithm, in particular for the case of integers and univariate polynomials over a field.
