Changeset c94e60f in git

Timestamp:

Sep 28, 2010, 12:19:46 PM (13 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'jengelh-datetime', 'ceac47cbc86fe4a15902392bdbb9bd2ae0ea02c6')(u'spielwiese', '0604212ebb110535022efecad887940825b97c3f')

Children:

1b38e5dbbecec05b3fdea59a6b4b159d06d20466

Parents:

4df33b5c9997268b982b1432e0fcc77a23ebe22d

Message:

primecoeffs and new primefactors

git-svn-id: file:///usr/local/Singular/svn/trunk@13296 2c84dea3-7e68-4137-9b89-c4e89433aadc

File:

• Singular/LIB/general.lib (modified) (2 diffs)

Singular/LIB/general.lib

@@ -1175 +1175 @@
          e.g. ideal, matrix, vector, module, int, intvec
          p = integer
-COMPUTE: primefactors <= min(p,32003) of coeffs of J (default p = 32003)
+COMPUTE: primefactors <= p of coeffs of J (default p = 32003)
 RETURN:  a list, say l, of two intvectors:@*
          l[1] : the different primefactors of all coefficients of J@*
          l[2] : the different remaining factors
-NOTE:    the procedure works for small integers only, just by testing all
-         primes (not to be considered as serious prime factorization!)
 EXAMPLE: example primecoeffs; shows an example
 "
@@ -1219 +1217 @@
    {
      l = primefactors(number(id[ii]),q);
-     jd = jd,l[1];
-     rest = rest,l[3];
+     list jdl=l[2];
+     jd = jd,jdl[1..size(jdl)]; 
+     kill jdl;
+     rest=rest, l[1];
    }
    jd = simplify(jd,6);