 This implies that formula_118 is a common root of formula_123 and formula_124 Its is therefore a root of the greatest common divisor of these two polynomials.It follows that this greatest common divisor is a non constant factor of formula_124 Euclidean algorithm for polynomials allows computing this greatest common factor.For example, if one know or guess that