Fix chinese_remainder() so modular GCD actually works.

[ginac.git] / ginac / polynomial / poly_cra.h

diff --git a/ginac/polynomial/poly_cra.h b/ginac/polynomial/poly_cra.h
index cbcff7b3945a203594d5d92816c23d99fe4b3c69..2f68034cbca53b0bdd803c9bf719918020b8ea3e 100644 (file)
--- a/ginac/polynomial/poly_cra.h
+++ b/ginac/polynomial/poly_cra.h
@@ -28,7 +28,7 @@ ex chinese_remainder(const ex& e1, const cln::cl_I& q1,
        ex v2 = (e2.smod(q2n) - v1.smod(q2n)).expand().smod(q2n);
        const numeric q1_1(recip(q1, q2)); // 1/q_1 mod q_2
        v2 = (v2*q1_1).smod(q2n);
-       ex ret = (v1 + v2*q1_1).expand();
+       ex ret = (v1 + v2*q1n).expand();
        return ret;
 }