Algorithm to Compute Greatest Common Divisors in PID

40 Views Asked by At

In a PID, given two elements $a,b$ we can define their greatest common divisor, $d$, as the generator of the principal ideal $$(a,b) = (d)$$ Is there an algorithm to compute this GCD or would this mean we instead have a Euclidean Domain?