Changeset 1f9a84 in git

Timestamp:

May 5, 2011, 2:19:42 PM (12 years ago)

Author:

Hans Schoenemann <hannes@…>

Branches:

(u'spielwiese', '0d6b7fcd9813a1ca1ed4220cfa2b104b97a0a003')

Children:

750e704356a16e0d46bd540f5fe07a831a40cded

Parents:

d44974deb309558594f4d26a7d11c490304c77cf

Message:

more int division from the manual

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

Location:

Singular/LIB

Files:

• atkins.lib (modified) (5 diffs)
• bfun.lib (modified) (2 diffs)
• cisimplicial.lib (modified) (10 diffs)
• crypto.lib (modified) (3 diffs)
• dmodapp.lib (modified) (12 diffs)
• freegb.lib (modified) (2 diffs)
• grobcov.lib (modified) (12 diffs)
• hyperel.lib (modified) (1 diff)
• multigrading.lib (modified) (27 diffs)
• ncalg.lib (modified) (1 diff)
• nctools.lib (modified) (2 diffs)
• ntsolve.lib (modified) (1 diff)
• perron.lib (modified) (1 diff)
• poly.lib (modified) (2 diffs)
• presolve.lib (modified) (3 diffs)
• qhmoduli.lib (modified) (5 diffs)
• random.lib (modified) (2 diffs)
• reszeta.lib (modified) (5 diffs)
• rootsur.lib (modified) (1 diff)
• standard.lib (modified) (1 diff)

Singular/LIB/atkins.lib

@@ -372 +372 @@
   ring R=(real,k),var(1),dp;
   poly f=imap(S,f);
-  ideal I=nt_solve(f,1.1,list(k,int(intPart(k/5))));
+  ideal I=nt_solve(f,1.1,list(k,k div 5));
   number c=leadcoef(I[1]);
   setring S;
@@ -427 +427 @@
   ti=impart(t);
   if(tr==-1/2){qr1=-1;}
-  if(tr==0){qr1=1;}
-  if((tr!=-1/2)&&(tr!=0))
-  {
-    tr=tr-round(tr);
-    qr1=expo(2*i*pi*tr,10*k);
+  else
+  {
+    if(tr==0){qr1=1;}
+    else
+    {
+      tr=tr-round(tr);
+      qr1=expo(2*i*pi*tr,10*k);
+    }
   }
 
@@ -441 +444 @@
   while(n<=k)
   {
-    m1=m1+(-1)^n*(q1^(n*(3*n-1)/2)+q1^(n*(3*n+1)/2));
-    m2=m2+(-1)^n*(q2^(n*(3*n-1)/2)+q2^(n*(3*n+1)/2));
+    m1=m1+(-1)^n*(q1^(n*(3*n-1) div 2)+q1^(n*(3*n+1) div 2));
+    m2=m2+(-1)^n*(q2^(n*(3*n-1) div 2)+q2^(n*(3*n+1) div 2));
     n++;
   }
@@ -725 +728 @@
     {
       a=random(0,p-1);
-      B=gcd((var(1)+a)^((p-1)/2)-1,A);
+      B=gcd((var(1)+a)^((p-1) div 2)-1,A);
       C=A/B;
     }
@@ -820 +823 @@
 
     if(printlevel>=1) {"List H of possibly suitable discriminants will be calculated.";}
-    H=disc(N,K/2);
+    H=disc(N,K div 2);
     if(printlevel>=1) {"H = "+string(H);pause();"";}
 

Singular/LIB/bfun.lib

@@ -106 +106 @@
   int i;
   def save = basering;
-  int n = nvars(save)/2;
+  int n = nvars(save) div 2;
   if (nrows(u)<>n || nrows(v)<>n)
   {
@@ -1638 +1638 @@
   int i;
   def save = basering;
-  int n = nvars(save)/2;
+  int n = nvars(save) div 2;
   int whichengine = 0; // default
   int methodord   = 0; // default

Singular/LIB/cisimplicial.lib

@@ -51 +51 @@
    {
       answer[1] = 1;
-          answer[2] = 0;
-          return (answer);
+      answer[2] = 0;
+      return (answer);
    }
 
@@ -70 +70 @@
    {
       s = 0;
-          for (i = 1; i <= nrows(A); i++)
+      for (i = 1; i <= nrows(A); i++)
       {
           if ((v[i] == 0)&&(A[i,j] != 0))
           {
              // it is not multiple of A_j
-                         break;
-                  }
-                  if (v[i] != 0)
-                  {
-                     if (A[i,j] == 0)
-                         {
-                            // it is not multiple of A_j
-                            break;
-                         }
-                         if (s == 0)
-                         {
-                            s = v[i] / A[i,j];
-                         }
-                         if (v[i] != s * A[i,j])
-                         {
-                            break;
-                         }
-                  }
-                  if (i == nrows(A))
-                  {
-                     answer[1] = j;
-                     answer[2] = s;
-                     // v = s * A_j
-                     return (answer);
-                  }
+            break;
           }
+          if (v[i] != 0)
+          {
+            if (A[i,j] == 0)
+            {
+              // it is not multiple of A_j
+              break;
+            }
+            if (s == 0)
+            {
+              s = v[i] div A[i,j];
+            }
+            if (v[i] != s * A[i,j])
+            {
+              break;
+            }
+      }
+      if (i == nrows(A))
+      {
+        answer[1] = j;
+        answer[2] = s;
+        // v = s * A_j
+        return (answer);
+      }
+    }
    }
 
@@ -149 +149 @@
       {
          // ---- n is multiple of v[i]
-         belong[i] = n / v[i];
+         belong[i] = n div v[i];
          return (belong);
       }
@@ -173 +173 @@
          {
             // ---- n belongs to the semigroup generated by v,
-            belong[cambio[1]] = (n - PartialSum) / w[1];
+            belong[cambio[1]] = (n - PartialSum) div w[1];
             for (j = 2; j <= num; j++)
             {
@@ -269 +269 @@
       for (j = 1; j <= nrows(v); j++)
       {
-         counters[j] = v[j] / d[j];
+         counters[j] = v[j] div d[j];
       }
       return(counters);
@@ -329 +329 @@
          if (A[j,i] > 0)
          {
-            order[i] = lcm(order[i], d[j] / gcd(A[j,i],d[j]));
+            order[i] = lcm(order[i], d[j] div gcd(A[j,i],d[j]));
          }
       }
@@ -390 +390 @@
                for (k = 1; k <= nrows(v); k++)
                {
-                  counters[k] = v[k] / d[k];
+                  counters[k] = v[k] div d[k];
                }
                for (k = nrows(v) + 1; k <= nrows(counters2); k++)
@@ -620 +620 @@
          {
             gcdiv = extgcd(A[i,i],A[i,k]);
-            coef1 = A[i,k] / gcdiv[1];
-            coef2 = A[i,i] / gcdiv[1];
+            coef1 = A[i,k] div gcdiv[1];
+            coef2 = A[i,i] div gcdiv[1];
             for (l = i; l <= nrows(A); l++)
             {
@@ -965 +965 @@
           if (A[j,i] > 0)
           {
-             order[i] = lcm(order[i], d[j] / gcd(A[j,i],d[j]));
+             order[i] = lcm(order[i], d[j] div gcd(A[j,i],d[j]));
           }
        }
@@ -1606 +1606 @@
                      int dp;
                      dp = gcd(B[k,i], B[k,j]);
-                     int factor = B[k,i] / dp;
+                     int factor = B[k,i] div dp;
                      B[k,i] = dp;
                      k++;

Singular/LIB/crypto.lib

@@ -1088 +1088 @@
       for(l=1;l<=k;l++)
       {
-         y=y*B[l]^(v[l]/2) mod n;
+         y=y*B[l]^(v[l] div 2) mod n;
       }
       d=gcdN(x-y,n);
@@ -1584 +1584 @@
 "
 {
-   poly f;
-   if(m==0){return(f);}
-   if(m==1){return(1);}
-   if(m==2){f=2*var(1);return(f);}
-   if(m==3){f=3*var(2)^4+6*a*var(2)^2+12*b*var(2)-a^2;return(f);}
+   if(m==0){return(poly(0));}
+   if(m==1){return(poly(1));}
+   if(m==2){return(2*var(1));}
+   if(m==3){return(3*var(2)^4+6*a*var(2)^2+12*b*var(2)-a^2);}
    if(m==4)
    {
-      f=4*var(1)*(var(2)^6+5*a*var(2)^4+20*b*var(2)^3-5*a^2*var(2)^2
-        -4*a*b*var(2)-8*b^2-a^3);
-      return(f);
+      return(4*var(1)*(var(2)^6+5*a*var(2)^4+20*b*var(2)^3-5*a^2*var(2)^2
+        -4*a*b*var(2)-8*b^2-a^3));
    }
    if((m mod 2)==0)
    {
-      f=(generateG(a,b,m/2+2)*generateG(a,b,m/2-1)^2
-        -generateG(a,b,m/2-2)*generateG(a,b,m/2+1)^2)
-        *generateG(a,b,m/2)/(2*var(1));
-      return(f);
-   }
-   f=generateG(a,b,(m-1)/2+2)*generateG(a,b,(m-1)/2)^3
-     -generateG(a,b,(m-1)/2-1)*generateG(a,b,(m-1)/2+1)^3;
-   return(f);
+      return((generateG(a,b,m div 2+2)*generateG(a,b,m div 2-1)^2
+        -generateG(a,b,m div 2-2)*generateG(a,b,m div 2+1)^2)
+        *generateG(a,b,m div 2)/(2*var(1)));
+   }
+   return(generateG(a,b,(m-1) div 2+2)*generateG(a,b,(m-1) div 2)^3
+     -generateG(a,b,(m-1) div 2-1)*generateG(a,b,(m-1) div 2+1)^3);
 }
 example
@@ -1784 +1780 @@
       pause();
    }
-   while(t<(l-1)/2)
+   while(t<(l-1) div 2)
    {
       t++;

Singular/LIB/dmodapp.lib

@@ -210 +210 @@
   // wrong sequence of vars
   int i,n;
-  n = nvars(basering)/2;
+  n = nvars(basering) div 2;
   for (i=1; i<=n; i++)
   {
@@ -920 +920 @@
   setring @R2;
   // now supply with Weyl algebra relations
-  int N = nvars(@R2)/2;
+  int N = nvars(@R2) div 2;
   matrix @D[2*N][2*N];
   for(i=1; i<=N; i++)
@@ -1259 +1259 @@
     def @R4@ = ring(L);
     setring @R4@;
-    int N = Nnew/2;
+    int N = Nnew div 2;
     matrix @D[Nnew][Nnew];
     for (i=1; i<=N; i++)
@@ -1570 +1570 @@
   int ppl = printlevel - voice +2;
   def save = basering;
-  int n = nvars(save)/2;
+  int n = nvars(save) div 2;
   int whichengine = 0;           // default
   int methodord   = 0;           // default
@@ -1992 +1992 @@
   int ppl = printlevel;
   int i,j,k;
-  int n = nvars(basering)/2;
+  int n = nvars(basering) div 2;
   if (w == 0:size(w))
   {
@@ -2122 +2122 @@
 // returns ring, which contains module "str"
 {
-  int n = nvars(basering)/2;
+  int n = nvars(basering) div 2;
   int i,j;
   def save = basering;
@@ -2379 +2379 @@
     }
   }
-  int n = nvars(basering)/2;
+  int n = nvars(basering) div 2;
   int i;
   if(v <> 0:size(v))
@@ -2448 +2448 @@
     }
   }
-  int n = nvars(basering)/2;
+  int n = nvars(basering) div 2;
   int i;
   if(v <> 0:size(v))
@@ -2551 +2551 @@
   int ppl = printlevel;
   int i;
-  int n = nvars(basering)/2;
+  int n = nvars(basering) div 2;
   intvec v;
   for (i=1; i<=n; i++)
@@ -2690 +2690 @@
 "
 {
-  intvec w = 1:(nvars(basering)/2);
+  intvec w = 1:(nvars(basering) div 2);
   int l0,l0set,Gset;
   ideal G;
@@ -2734 +2734 @@
   int ppl = printlevel;
   int i,j;
-  int n = nvars(basering)/2;
+  int n = nvars(basering) div 2;
   intvec v;
   for (i=1; i<=n; i++)
@@ -3050 +3050 @@
   int ppl = printlevel - voice + 2;
   def save = basering;
-  int n = nvars(save)/2;
+  int n = nvars(save) div 2;
   intvec u = 0:n;
   intvec v = 1:n;

Singular/LIB/freegb.lib

@@ -3265 +3265 @@
 {int i,j,k,r1,r2; intvec D;
  int n = attrib(basering,"lV");
- k = size(V)/n; r1 = 0; r2 = 0;
+ k = size(V) div n; r1 = 0; r2 = 0;
  for (i=1; i<= k; i++)
   {for (j=(1+((i-1)*n)); j <= (i*n); j++)
@@ -3372 +3372 @@
  }
 
- d = size(cq)/n;
+ d = size(cq) div n;
  for (i = 1; i<= d; i++)
  {bla = cq[((i-1)*n+1)..(i*n)];

Singular/LIB/grobcov.lib

@@ -1377 +1377 @@
   int comment=0;
   list L=#;
-  for(i=1;i<=size(L)/2;i++)
+  for(i=1;i<=size(L) div 2;i++)
   {
     if(L[2*i-1]=="null"){N=L[2*i];}
@@ -2259 +2259 @@
     {
       comp0=compos0[r1];
-      if (comp0[1]<=bound/2)
+      if (comp0[1]<=bound div 2)
       {
         compos1=comp(comp0[1],ncols(PW1));
@@ -2265 +2265 @@
         while ((s1<=size(compos1)) and not(t))
         {
-          if (comp0[2]<=bound/2)
+          if (comp0[2]<=bound div 2)
           {
             compos2=comp(comp0[2],ncols(PW2));
@@ -3541 +3541 @@
   def W=ideal(1);
   list L=#;
-  for(i=1;i<=size(L)/2;i++)
+  for(i=1;i<=size(L) div 2;i++)
   {
     if(L[2*i-1]=="null"){N=L[2*i];}
@@ -3906 +3906 @@
   def W=ideal(1);
   list L=#;
-  for(i=1;i<=size(L)/2;i++)
+  for(i=1;i<=size(L) div 2;i++)
   {
     if(L[2*i-1]=="null"){N=L[2*i];}
@@ -4116 +4116 @@
 //  def W=ideal(1);
 //  list L=#;
-//  for(i=1;i<=size(L)/2;i++)
+//  for(i=1;i<=size(L) div 2;i++)
 //  {
 //    if(L[2*i-1]=="null"){N=L[2*i];}
@@ -4975 +4975 @@
   int comment=0;
   list L=#;
-  for(i=1;i<=size(L)/2;i++)
+  for(i=1;i<=size(L) div 2;i++)
   {
     if(L[2*i-1]=="null"){N=L[2*i];}
@@ -5820 +5820 @@
   CGS=1;   // CGS=1 if cgsdr is to be used (default)
            // CGS=0 if buildtree is to be used instead
-  for(i=1;i<=size(L)/2;i++)
+  for(i=1;i<=size(L) div 2;i++)
   {
     if(L[2*i-1]=="can"){canop=L[2*i];}
@@ -7066 +7066 @@
   def RR=basering; list empty; int i;
   setglobalrings();
-  for(i=1;i<=size(L)/2;i++)
+  for(i=1;i<=size(L) div 2;i++)
   {
     if(L[2*i-1]=="compbas"){compbas=L[2*i];}
@@ -7193 +7193 @@
   int i; int comment=1; list L=#; ideal N; list gc; list GC; list GCA;
   int start=timer; int ni; int nw;
-  for(i=1;i<=size(L)/2;i++)
+  for(i=1;i<=size(L) div 2;i++)
   {
     if (L[2*i-1]=="comment"){comment=L[2*i];}
@@ -7349 +7349 @@
 {
   int i; list L=#; int oldop=1;
-  for(i=1;i<=size(L)/2;i++)
+  for(i=1;i<=size(L) div 2;i++)
   {
     if(L[2*i-1]=="old"){oldop=L[2*i];}
@@ -7531 +7531 @@
            // outop=1 for an output as in the old library redcgs.lib
            //         in form of tree that can be transformed into Maple.
-  for(i=1;i<=size(LL)/2;i++)
+  for(i=1;i<=size(LL) div 2;i++)
   {
     if(LL[2*i-1]=="can"){canop=LL[2*i];}

Singular/LIB/hyperel.lib

@@ -826 +826 @@
      }
      bas=double(bas,h,f);
-     exp=exp/2;
+     exp=exp div 2;
    }
    if ( m < 0 )

Singular/LIB/multigrading.lib

@@ -15 +15 @@
 
 OVERVIEW: This library allows one to virtually add multigradings to Singular:
-grade multivariate polynomial rings with arbitrary (fin. gen. Abelian) groups. 
+grade multivariate polynomial rings with arbitrary (fin. gen. Abelian) groups.
 For more see http://code.google.com/p/convex-singular/wiki/Multigrading
 For theoretical references see:
@@ -425 +425 @@
   // And now a quick-and-dirty fix of Singular inability to handle attribs of attribs:
   // For the use of a group as an attribute for multigraded rings
-  G[3] = attrib(L, attrGroupHNF); 
+  G[3] = attrib(L, attrGroupHNF);
   G[4] = attrib(L, attrGroupSNF);
-  
+
 
   attrib(G, isGroup, (1==1)); // mark it "a group"
@@ -584 +584 @@
 
   isGroup(G);
-  
+
   printGroup(G);
 
@@ -960 +960 @@
 
 
-  def T = G[2]; 
+  def T = G[2];
 
   if( size(#) >= i )
@@ -970 +970 @@
       ERROR("Sorry wrong arguments!");
     }
-    
+
     if( a == "hermite" )
     {
@@ -1107 +1107 @@
                   0,1,3,4;
   setBaseMultigrading(MM);
-  
+
   module M = ideal(  xw-yz, x2z-y3, xz2-y2w, yw2-z3);
 
@@ -1131 +1131 @@
   print(v);
   print(setModuleGrading(v));
-  
+
   isHomogeneous(v);
 
@@ -1573 +1573 @@
   while(av[1]*bv[1] != 0)
   {
-    bv = bv - (bv[1] - bv[1]%av[1])/av[1] * av;
+    bv = bv - (bv[1] - bv[1]%av[1]) div av[1] * av;
     save = bv;
     bv = av;
@@ -1664 +1664 @@
                   -46,32,37,42,15;
   lll(m);
-  
+
   list l =
       intvec(13,25,37, 83, 294),
@@ -1698 +1698 @@
   // D;
   intvec v;
-  if((cc==1)||(rr==1)){
+  if((cc==1)||(rr==1))
+  {
     if(size(#)==0)
     {
       return(D);
-    } else
+    }
+    else
     {
       return(list(P,D,Q));
     }
   }
-  while(D[k+1,k+1] !=0){
-    if(D[k+1,k+1]%D[k,k]!=0){
+  while(D[k+1,k+1] !=0)
+  {
+    if(D[k+1,k+1]%D[k,k]!=0)
+    {
       b = D[k, k]; c = D[k+1, k+1];
       v = gcdcomb(D[k,k],D[k+1,k+1]);
       transform = unitMatrix(cc);
       transform[k+1,k] = 1;
-      a = -v[3]*D[k+1,k+1]/v[1];
+      a = -v[3]*D[k+1,k+1] div v[1];
       transform[k, k+1] = a;
       transform[k+1, k+1] = a+1;
@@ -1723 +1727 @@
       transform[k,k] = v[2];
       transform[k,k+1] = v[3];
-      transform[k+1,k] = -c/v[1];
-      transform[k+1,k+1] = b/v[1];
+      transform[k+1,k] = -c div v[1];
+      transform[k+1,k+1] = b div v[1];
       D = transform * D;
       P = transform * P;
@@ -1734 +1738 @@
     }
     k++;
-    if((k==rr) || (k==cc)){
+    if((k==rr) || (k==cc))
+    {
       break;
     }
   }
   //"here is the size ",size(#);
-  if(size(#) == 0){
+  if(size(#) == 0)
+  {
     return(D);
-  } else {
+  }
+  else
+  {
     return(list(P, D, Q));
   }
@@ -1821 +1829 @@
               v2 = A[1..rr,j];
               transform = unitMatrix(cc);
-              transform[j,j] = v1[row]/gcdvec[1];
+              transform[j,j] = v1[row] div gcdvec[1];
               transform[column, column] = gcdvec[2];
-              transform[column,j] = -v2[row]/gcdvec[1];
+              transform[column,j] = -v2[row] div gcdvec[1];
               transform[j,column] = gcdvec[3];
               q = q*transform;
@@ -1840 +1848 @@
         if(A[row, j]!=0){
           transform = unitMatrix(cc);
-          transform[column, j] = (-A[row,j]+A[row, j]%A[row, column])/A[row, column];
+          transform[column, j] = (-A[row,j]+A[row, j]%A[row, column]) div A[row, column];
           if(A[row,j]<0){
             transform[column,j]=transform[column,j]+1;}
@@ -1930 +1938 @@
   ideal I = a, b;
   print(multiDeg(I));
-  
+
   intmat m[5][2]=multiDeg(a),multiDeg(b); m=transpose(m);
 
@@ -1937 +1945 @@
 
   print(m);
- 
+
   areZeroElements(m);
 
@@ -1974 +1982 @@
     kill a;
   }
-  
+
   if( i == 1 )
   {
@@ -2001 +2009 @@
       {
         v = H[1..r,i];
-        mdeg = mdeg-(mdeg[row]-mdeg[row]%v[row])/v[row]*v;
+        mdeg = mdeg-(mdeg[row]-mdeg[row]%v[row]) div v[row]*v;
       }
     }
@@ -2198 +2206 @@
   intmat newgrad[pp][np];
 
-  //This will set the finest grading on the image ring. We will proceed by coarsening this grading until f becomes homogeneous. 
+  //This will set the finest grading on the image ring. We will proceed by coarsening this grading until f becomes homogeneous.
   for(i=1;i<=np;i++){ newgrad[p+i,i]=1;}
 
@@ -2216 +2224 @@
     for(j=1;j<=n;j++){ toadd1[i,j]=oldgrad[i,j];}
   }
-  
+
   // This will make the images of homogeneous elements homogeneous, namely the variables of the preimage ring.
   for(i=1;i<=n;i++){
@@ -2263 +2271 @@
     columns=columns+ncols(newlat[k]);
   }
-  
+
   //The following is just for reducing the size of the matrices.
   gragr=hermiteNormalForm(gragr);
@@ -4762 +4770 @@
     3,6,12;
 
-  intmat B = latticeBasis(L); 
+  intmat B = latticeBasis(L);
   print(B); // should result in a matrix whose columns generate the same lattice as  [1,2,3] and [0,3,6]:
 
@@ -4843 +4851 @@
   // generate the same lattice as [-1,2,-1,0],[2,-3,0,1]
   intmat B = kernelLattice(LL);
-  
+
   print(B);
 
@@ -5071 +5079 @@
       // we want a matrix with column operations so we transpose
       intmat BB = transpose(B);
-      list L = hermiteNormalForm(BB, "transform"); 
+      list L = hermiteNormalForm(BB, "transform");
       intmat U = transpose(L[2]);
 
- 
+
       // delete rows 1 to r
       intmat Udel[nrows(U) - r][ncols(U)];
@@ -5298 +5306 @@
     2,1,
     3,2;
-  
+
   intmat D  = intInverse(C);
 
@@ -5601 +5609 @@
 
   // should return a (3x2)-matrix whose columns
-  // generate the same lattice as [1, 2, 3] and [0, 1, 2] 
+  // generate the same lattice as [1, 2, 3] and [0, 1, 2]
   intmat R = primitiveSpan(V);
   print(R);
@@ -5611 +5619 @@
 
   // should return a (2x2)-matrix whose columns
-  // generate the same lattice as [1, 0] and [0, 1] 
+  // generate the same lattice as [1, 0] and [0, 1]
   intmat S = primitiveSpan(W);
   print(S);

Singular/LIB/ncalg.lib

@@ -324 +324 @@
   for( k=1; k<=N; k++)
   {
-    ik = 1 + ((k-1)/n);
+    ik = 1 + ((k-1) div n);
     jk = k -  n*(ik-1);
 
     for( l=k+1; l<=N; l++)
     {
-        il = 1 + ((l-1)/n);
+        il = 1 + ((l-1) div n);
         jl = l -  n*(il-1);
         p = 0;

Singular/LIB/nctools.lib

@@ -209 +209 @@
   {
     N=N[2..size(N)]; // Deleting the zero added in the definition of N
-    M=intmat(N,size(N)/nc,nc); // Conversion from vector to matrix
+    M=intmat(N,size(N) div nc,nc); // Conversion from vector to matrix
   }
   else
@@ -252 +252 @@
   {
     T=T[2..size(T)]; // Deleting the zero added in the definition of T
-    intmat C = intmat(T,size(T)/k,k); // Conversion from vector to matrix
+    intmat C = intmat(T,size(T) div k,k); // Conversion from vector to matrix
   }
   return (C);

Singular/LIB/ntsolve.lib

@@ -55 +55 @@
     int prot = printlevel-voice+2;  // prot=printlevel (default:prot=0)
     if (i1 < 1){itmax = 100;}else{itmax = ipar[1];}
-    if (i1 < 2){acc = prec/2;}else{acc = ipar[2];}
+    if (i1 < 2){acc = prec div 2;}else{acc = ipar[2];}
     if ((acc <= 0)||(acc > prec-1)){acc = prec-1;}
 

Singular/LIB/perron.lib

@@ -77 +77 @@
       ERROR( "Wrong set of polynomials!" );
     }
-    D = D / min;
+    D = D div min;
   }
   ////////////////////////////////////////////////////////////////////////

Singular/LIB/poly.lib

@@ -809 +809 @@
         {
            q=gcd(p,i[k]);
-           p=p/q;
+           p=p div q;
            p=p*i[k];
         }
@@ -1188 +1188 @@
   }
   N = N[2..size(N)]; // Deletes the zero added in the definition of T
-  intmat M=intmat(N,(size(N)/n),n); // Conversion from vector to matrix
+  intmat M=intmat(N,(size(N) div n),n); // Conversion from vector to matrix
   return (M);
 }

Singular/LIB/presolve.lib

@@ -1090 +1090 @@
    {
       @L2=@L2+list("dp",0);
-      if ( @L2[@ii/2] != 0)
+      if ( @L2[@ii div 2] != 0)
       {
          @v = @l[@ii];
          for ( @jj=1; @jj<=size(@v); @jj++ )
          {
-           @o = @o+@L2[@ii/2 -1]+"("+string(@v[@jj])+"),";
+           @o = @o+@L2[@ii div 2 -1]+"("+string(@v[@jj])+"),";
          }
       }
       else
       {
-         @o = @o+@L2[@ii/2 -1]+"("+string(size(@l[@ii/2]))+"),";
+         @o = @o+@L2[@ii div 2 -1]+"("+string(size(@l[@ii div 2]))+"),";
       }
    }
@@ -1264 +1264 @@
       if ( size(m)!=0 )
       {
-         l = 2*(l/2)+2;
+         l = 2*(l div 2)+2;
          ideal a(l) = simplify(m,2);
          intvec v(l) = compress(v);
@@ -1314 +1314 @@
       vec = sort(L)[2];
       if ( n(kk) != 0 ) { vec = vec[size(vec)..1]; }
-      blockvec[kk/2] = vec;
+      blockvec[kk div 2] = vec;
       vec = sort(v(kk),vec)[1];
       varvec = varvec,vec;

Singular/LIB/qhmoduli.lib

@@ -55 +55 @@
   if(size(#) > 0) { opt = #[1]; }
   else { opt = 7; }
-  if(opt / 4 > 0) { imageQ = 1; opt = opt - 4;}
+  if(opt div 4 > 0) { imageQ = 1; opt = opt - 4;}
   else { imageQ = 0; }
 
@@ -215 +215 @@
   else { opt = 3; }
 
-  if(opt / 2 > 0) { primaryDec = 1; opt = opt - 2; }
+  if(opt div 2 > 0) { primaryDec = 1; opt = opt - 2; }
   else { primaryDec = 0; }
   if(opt > 0) { relationsQ = 1;}
@@ -879 +879 @@
     maxSIZE = SUBSMAXSIZE / size(h);
     //print(" SUBSMAXSIZE = "+string(SUBSMAXSIZE)+" exceeded by "+string(size(g)*size(h)) + ", maxSIZE = ", string(maxSIZE));
-    nrParts = size(g) / maxSIZE + 1;
-    partSize = size(g) / nrParts;
+    nrParts = size(g) div maxSIZE + 1;
+    partSize = size(g) div nrParts;
     gxh = 0;  // 'g times h'
     for(i = 1; i <= nrParts; i++)
@@ -1356 +1356 @@
 
     parts = parts + restP;
-    for(i = 1; i <= n / nr[1]; i = i + 1)
+    for(i = 1; i <= n div nr[1]; i = i + 1)
     {
       temp = Table(string(nr[1]), "i", 1, i);
@@ -1383 +1383 @@
 "
 {
-  int c = int(b/a);
+  int c = b div a;
   if(c*a == b) { return(c); }
   else {return(0)}

Singular/LIB/random.lib

@@ -433 +433 @@
        r2 = random(-b,b);
        r2 = r2 + (r2==0)*random(-b,-1);
-       i = i,r1*m[random(1,s/2)] + r1*m[random(s/2+1,s)];
+       i = i,r1*m[random(1,s div 2)] + r1*m[random(s div 2+1,s)];
        if ( ii < c+u )
        {  r1 = random(-b,b);
@@ -439 +439 @@
           r2 = random(-b,b);
           r2 = r2 + (r2==0)*random(-b,-1);
-          i = i,r1*m[random(1,s/2)] + r2*m[random(s/2+1,s)];
+          i = i,r1*m[random(1,s div 2)] + r2*m[random(s div 2+1,s)];
        }
      }

Singular/LIB/reszeta.lib

@@ -1840 +1840 @@
    for(i=1;i<=size(ast_list[1]);i++)
    {
-      if((((Nvec[ast_list[1][i][1][1]]/d)*d)-Nvec[ast_list[1][i][1][1]]==0)&&
+      if((((Nvec[ast_list[1][i][1][1]] div d)*d)-Nvec[ast_list[1][i][1][1]]==0)&&
          (ast_list[1][i][2]!=0))
       {
@@ -1854 +1854 @@
    for(i=1;i<=size(ast_list[2]);i++)
    {
-      if((((Nvec[ast_list[2][i][1][1]]/d)*d)-Nvec[ast_list[2][i][1][1]]==0)&&
-         (((Nvec[ast_list[2][i][1][2]]/d)*d)-Nvec[ast_list[2][i][1][2]]==0)&&
+      if((((Nvec[ast_list[2][i][1][1]] div d)*d)-Nvec[ast_list[2][i][1][1]]==0)&&
+         (((Nvec[ast_list[2][i][1][2]] div d)*d)-Nvec[ast_list[2][i][1][2]]==0)&&
           (ast_list[2][i][2]!=0))
       {
@@ -1867 +1867 @@
    for(i=1;i<=size(ast_list[3]);i++)
    {
-      if((((Nvec[ast_list[3][i][1][1]]/d)*d)-Nvec[ast_list[3][i][1][1]]==0)&&
-         (((Nvec[ast_list[3][i][1][2]]/d)*d)-Nvec[ast_list[3][i][1][2]]==0)&&
-         (((Nvec[ast_list[3][i][1][3]]/d)*d)-Nvec[ast_list[3][i][1][3]]==0)&&
+      if((((Nvec[ast_list[3][i][1][1]] div d)*d)-Nvec[ast_list[3][i][1][1]]==0)&&
+         (((Nvec[ast_list[3][i][1][2]] div d)*d)-Nvec[ast_list[3][i][1][2]]==0)&&
+         (((Nvec[ast_list[3][i][1][3]] div d)*d)-Nvec[ast_list[3][i][1][3]]==0)&&
          (ast_list[3][i][2]!=0))
       {
@@ -2592 +2592 @@
    {
       k=L[2][i] mod d;
-      s=1/number((L[1][i])^(L[2][i]/d));
+      s=1/number((L[1][i])^(L[2][i] div d));
       if(!k){p=subst(p,t,s*t);}
    }
@@ -2601 +2601 @@
    {
       k=L[2][i] mod d;
-      s=(L[1][i])^(L[2][i]/d);
+      s=(L[1][i])^(L[2][i] div d);
       if(!k){p=subst(p,t,s*t);}
    }

Singular/LIB/rootsur.lib

@@ -970 +970 @@
       }
       nofzeros = 0;
-      lastsign = temp/lastsign;
+      lastsign = temp div lastsign;
     }
     i++;

Singular/LIB/standard.lib

@@ -2117 +2117 @@
   if(va==1)
   {
-    m2=drest/wwtop[1];
+    m2=drest div wwtop[1];
     if((m2*wwtop[1])==drest)
     {