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

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

diff --git a/ginac/polynomial/normalize.tcc b/ginac/polynomial/normalize.tcc
index e2463075a58586892243210fd453c3e7e746f08a..1f90cc30b32eb591321c9bbd784cc633da1bbc0b 100644 (file)
--- a/ginac/polynomial/normalize.tcc
+++ b/ginac/polynomial/normalize.tcc
@@ -78,8 +78,7 @@ normalize_in_ring(T& x, typename T::value_type* content_ = 0, int* unit_ = 0)
                return something_changed;
        }
        
-       lcoeff(x) = one;
-       for (std::size_t i = x.size() - 1; i-- != 0; )
+       for (std::size_t i = x.size(); i-- != 0; )
                x[i] = exquo(x[i], content);
 
        if (content_)