pgcd(): detect relatively prime polynomials properly...
authorAlexei Sheplyakov <alexei.sheplyakov@gmail.com>
Tue, 23 Feb 2010 10:01:23 +0000 (12:01 +0200)
committerJens Vollinga <jensv@nikhef.nl>
Wed, 24 Feb 2010 21:29:11 +0000 (22:29 +0100)
commit6afbb9793e359cf388462c471ea256a6662b0cd4
tree09f840d59804d74b379941e821eb3753da30fd30
parent25c7a8c09f7db73b48675777aa805e788f2308be
pgcd(): detect relatively prime polynomials properly...

... so pgcd() doesn't loop forever any more. Division test does not handle
relatively prime polynomials (because C = 1 divides any polynomial). So we
should stop interpolation (and return gcd of contents) if we got relatively
prime images (we should do that for efficiency reasons too).

Thanks to Jörg Arndt for a bug report.
check/Makefile.am
check/pgcd_relatively_prime_bug.cpp [new file with mode: 0644]
ginac/polynomial/pgcd.cpp