Let and . Applying polynomial long division gives the Euclidean algorithm
Thus their polynomial greatest common divisor is , up to a nonzero constant factor. Their unique common root of a polynomial is therefore