 However, if is a unique factorization domain, then any two elements have a gcd, and more generally this is true in gcd domains.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, or when is the ring of Gaussian integers), then greatest common divisors can be computed using a form of the Euclidean algorithm based on the division procedure.The following is an example of an integral domain with two elements that do not have a gcd