Changeset 18dd47 in git for Singular/LIB/finvar.lib

Timestamp:

Aug 12, 1997, 4:01:11 PM (26 years ago)

Author:

Hans Schönemann <hannes@…>

Branches:

(u'spielwiese', 'ec94ef7a30b928574c0c3daf41f6804dff5f6b69')

Children:

573ae7acc2dadf68863ca5ee07211c1e9a07b3fb

Parents:

9e76269b6654f6e38d3546d04b318c6693f2f4d9

Message:

* hannes: changed int / into div in
          HNPuiseux.lib finvar.lib general.lib homolog.lib matrix.lib
          poly.lib prim_dec.lib primdec.lib random.lib


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

File:

• Singular/LIB/finvar.lib (modified) (5 diffs)

Singular/LIB/finvar.lib

@@ -1 @@
-// $Header: /exports/cvsroot-2/cvsroot/Singular/LIB/finvar.lib,v 1.3 1997-08-04 14:46:49 Singular Exp $
+// $Header: /exports/cvsroot-2/cvsroot/Singular/LIB/finvar.lib,v 1.4 1997-08-12 14:01:05 Singular Exp $
 ////////////////////////////////////////////////////////////////////////////////
 // send bugs and comments to agnes@math.uni-sb.de
@@ -958 +958 @@
   { if (i<p^j)                         // finding an upper bound on i
     { for (k=0;k<j-1;k=k+1)
-      { out=out+((i/p^k)%p)*a^k;       // finding how often p^k is contained in
+      { out=out+((i div p^k)%p)*a^k;   // finding how often p^k is contained in
       }                                // i
-      out=out+(i/p^(j-1))*a^(j-1);
+      out=out+(i div p^(j-1))*a^(j-1);
       if (defined(bool)=voice)
       { return((-1)*out);
@@ -988 +988 @@
   for (i=2;i<=m;i=i+1)
   { degvec[i]=deg(Q[i]);
-    lcm=lcm*degvec[i]/gcd(lcm,degvec[i]); // lcm is now the least common
+    lcm=lcm*degvec[i] div gcd(lcm,degvec[i]); // lcm is now the least common
   }                                    // multiple of the first i elements of Q
   ideal A(1)=Q;
   for (i=1;i<=m;i=i+1)
-  { A(1)[i]=(A(1)[i])^(lcm/degvec[i]); // now all elements in A(1) are of the
+  { A(1)[i]=(A(1)[i])^(lcm div degvec[i]); // now all elements in A(1) are of the
   }                                    // same degree, they are the elements of
                                        // Q raised to a power -
@@ -1001 +1001 @@
   kill I;
   if ((n%2)==0)                        // H(1) ought to be of the form:
-  { j=int(n)/int(2);                   // 1,0,...,0,0,1,0,...,0
+  { j=n div 2;                         // 1,0,...,0,0,1,0,...,0
   }                                    // 0,0,...,0,1,0,0,...,0
   else                                 //      .           .
-  { j=int(n-1)/int(2);                 //      .           .
+  { j=(n-1) div 2;                     //      .           .
   }                                    //      .           .
   for (i=1;i<=j;i=i+1)                 // 1,0,...,0,0,0,0,...,0
@@ -1143 +1143 @@
   { d=d*deg(P[i]);                     // building the product of the degrees of
   }                                    // primary invariants -
-  int bound=d/g;                       // number of secondary invariants
+  int bound=d div g;                   // number of secondary invariants
   if (v)
   { "  The invariant ring is Cohen-Macaulay.";
-    "  We need to find "+string(d)+"/"+string(g)+"="+string(bound)+" secondary invariants.";
+    "  We need to find "+string(d)+" div "+string(g)+"="+string(bound)+" secondary invariants.";
     "";
   }