mod_gcd: naive hack to chose a 'good' prime (to speed up gcd computation).

[ginac.git] / ginac / polynomial / remainder.tcc

diff --git a/ginac/polynomial/remainder.tcc b/ginac/polynomial/remainder.tcc
index 4db2843bfd66f083fdaf41fb35dd0eb63433db7c..60767dc07be37d33905c1db62803d2ef88375c6d 100644 (file)
--- a/ginac/polynomial/remainder.tcc
+++ b/ginac/polynomial/remainder.tcc
@@ -90,7 +90,7 @@ bool remainder_in_ring(T& r, const T& a, const T& b)
                if (zerop(r[k]))
                        continue;
 
-               const ring_t qk = div(r[k], b_lcoeff);
+               const ring_t qk = truncate1(r[k], b_lcoeff);
 
                // Why C++ is so off-by-one prone?
                for (std::size_t j = k, i = b.size(); i-- != 0; --j) {