Polynomial GCD Derived through Monic Polynomial Subtractions

الملخص EN

A simple and efficient algorithm for finding the GCD of a pair of univariate polynomials is derived.

The process requires only successive subtraction of two monic polynomials.

Amazingly, this approach gives the desired GCD for a pair of test polynomials of very high degree, such as (x+1)∧1000 and its derivative.