Avoid x^0 and Order(x^0) terms together in series expansion.

[ginac.git] / ginac / polynomial / mgcd.cpp

diff --git a/ginac/polynomial/mgcd.cpp b/ginac/polynomial/mgcd.cpp
index b031f6ef193220a6e944ecdde06deab45be8feb7..d66369eeba8b4e40e6bb57633967e483d2916fa7 100644 (file)
--- a/ginac/polynomial/mgcd.cpp
+++ b/ginac/polynomial/mgcd.cpp
@@ -3,7 +3,7 @@
  *  Chinese remainder algorithm. */
 
 /*
- *  GiNaC Copyright (C) 1999-2014 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2016 Johannes Gutenberg University Mainz, Germany
  *
  *  This program is free software; you can redistribute it and/or modify
  *  it under the terms of the GNU General Public License as published by
@@ -69,7 +69,6 @@ ex chinrem_gcd(const ex& A_, const ex& B_, const exvector& vars)
        const cln::cl_I b_lc = integer_lcoeff(B, vars);
        const cln::cl_I g_lc = cln::gcd(a_lc, b_lc);
 
-       const ex& x(vars.back());
        exp_vector_t n = std::min(degree_vector(A, vars), degree_vector(B, vars));
        const int nTot = std::accumulate(n.begin(), n.end(), 0);
        const cln::cl_I A_max_coeff = to_cl_I(A.max_coefficient());