]> www.ginac.de Git - ginac.git/history - check/pgcd_relatively_prime_bug.cpp
pgcd(): avoid infinite loop if the first GCD candidate coincides with GCD
[ginac.git] / check / pgcd_relatively_prime_bug.cpp
2010-02-24 Alexei Sheplyakovpgcd(): detect relatively prime polynomials properly...