## [Maxima-commits] CVS: maxima/share/affine aquotient.lisp, 1.10, 1.11

 [Maxima-commits] CVS: maxima/share/affine aquotient.lisp, 1.10, 1.11 From: Volker van Nek - 2008-03-31 15:07:24 ```Update of /cvsroot/maxima/maxima/share/affine In directory sc8-pr-cvs16.sourceforge.net:/tmp/cvs-serv16889/share/affine Modified Files: aquotient.lisp Log Message: commented out *small-primes*, which overrides *small-primes* in src/ifactor.lisp Index: aquotient.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/share/affine/aquotient.lisp,v retrieving revision 1.10 retrieving revision 1.11 diff -u -d -r1.10 -r1.11 --- aquotient.lisp 26 Mar 2007 14:33:17 -0000 1.10 +++ aquotient.lisp 31 Mar 2008 15:07:07 -0000 1.11 @@ -1620,7 +1620,8 @@ appending(sloop for pol1 in (integer-univariate-factor1 pol) collecting pol1 collecting deg)))) -(defvar *small-primes* '(3 5 7 11 13 17 19)) +;;(defvar *small-primes* '(3 5 7 11 13 17 19)) ; overrides *small-primes* in src/ifactor.lisp; not used + (defun find-small-prime-so-square-free (poly &optional (variable (p-var poly)) (prime-start 13)&aux deriv cof the-gcd) "finds a small prime P so that the roots of poly with respect to variable VARIABLE are distinct and so that poly has the same degree reduced modulo P. It will continue for ever if the input is not square free over ```

 [Maxima-commits] CVS: maxima/share/affine aquotient.lisp, 1.10, 1.11 From: Volker van Nek - 2008-03-31 15:07:24 ```Update of /cvsroot/maxima/maxima/share/affine In directory sc8-pr-cvs16.sourceforge.net:/tmp/cvs-serv16889/share/affine Modified Files: aquotient.lisp Log Message: commented out *small-primes*, which overrides *small-primes* in src/ifactor.lisp Index: aquotient.lisp =================================================================== RCS file: /cvsroot/maxima/maxima/share/affine/aquotient.lisp,v retrieving revision 1.10 retrieving revision 1.11 diff -u -d -r1.10 -r1.11 --- aquotient.lisp 26 Mar 2007 14:33:17 -0000 1.10 +++ aquotient.lisp 31 Mar 2008 15:07:07 -0000 1.11 @@ -1620,7 +1620,8 @@ appending(sloop for pol1 in (integer-univariate-factor1 pol) collecting pol1 collecting deg)))) -(defvar *small-primes* '(3 5 7 11 13 17 19)) +;;(defvar *small-primes* '(3 5 7 11 13 17 19)) ; overrides *small-primes* in src/ifactor.lisp; not used + (defun find-small-prime-so-square-free (poly &optional (variable (p-var poly)) (prime-start 13)&aux deriv cof the-gcd) "finds a small prime P so that the roots of poly with respect to variable VARIABLE are distinct and so that poly has the same degree reduced modulo P. It will continue for ever if the input is not square free over ```