Advanced Search

Question: gcd for large degree polynomials

Question:gcd for large degree polynomials

michele 45 Maple
polynomial performance gcd
July 12 2024
1

I notice that the command gcd(a,b), if a and b are large degree polynomials, takes too much time and often crashes Windows (not only Maple).

As the euclidean algorithm is very efficient even for large numbers,why not for polynomials?

And how could I calculate the gcd between polynomials with a large degree?

Thanks Michele
Please Wait...