ガウス整数
As for any unique factorization domain, a "greatest common divisor (gcd)" of two Gaussian integers is a Gaussian integer that is a common divisor of and , which has all common divisors of and as divisor. That is (where denotes the divisibility relation),