ガウス整数
If is a [[Euclidean domain]] in which euclidean division is given algorithmically (as is the case for instance when "R" = "F"["X"] where is a [[field (mathematics)|field]], or when is the ring of [[Gaussian integer]]s), then greatest common divisors can be computed using a form of the Euclidean algorithm based on the division procedure.