X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Fpolynomial%2Fpgcd.cpp;h=fac3735e10333390ea42c91a5e229bfd4e5c11df;hp=ef3748dcd49139a0d384c1a4f87ae4169a5bb647;hb=f28f24cf1228f0fa9cb0889d87a3f4039587ff92;hpb=630e59f66af9fcebb56a442f3aef433b0cc1c0e0

diff --git a/ginac/polynomial/pgcd.cpp b/ginac/polynomial/pgcd.cpp
index ef3748dc..fac3735e 100644
--- a/ginac/polynomial/pgcd.cpp
+++ b/ginac/polynomial/pgcd.cpp
@@ -3,7 +3,7 @@
  *  GCD for polynomials in prime field. */
 
 /*
- *  GiNaC Copyright (C) 1999-2009 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2010 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
@@ -134,8 +134,6 @@ ex pgcd(const ex& A, const ex& B, const exvector& vars, const long p)
 		const ex H_lcoeff = lcoeff_wrt(H, restvars);
 
 		if (H_lcoeff.is_equal(lc_gcd)) {
-			if ((Hprev-H).expand().smod(pn).is_zero())
-				continue;
 			ex C /* primitive part of H */, contH /* dummy */;
 			primpart_content(C, contH, H, vars, p);
 			// Normalize GCD so that leading coefficient is 1