 The greatest common divisor polynomial of two polynomials and is defined as the product of their shared irreducible polynomials, which can be identified using the Euclidean algorithm.The basic procedure is similar to that for integers.At each step , a quotient polynomial and a remainder polynomial are identified to satisfy the recursive equation

where and .