# Changeset 18dd47 in git

Ignore:
Timestamp:
Aug 12, 1997, 4:01:11 PM (26 years ago)
Branches:
Children:
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

Location:
Singular/LIB
Files:
7 edited

Unmodified
Removed
• ## Singular/LIB/finvar.lib

 r9e7626 // \$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 { if (i
• ## Singular/LIB/general.lib

 r9e7626 // \$Id: general.lib,v 1.3 1997-07-10 14:02:30 Singular Exp \$ // \$Id: general.lib,v 1.4 1997-08-12 14:01:07 Singular Exp \$ //system("random",787422842); //(GMG, last modified 22.06.96) { s    = e[m]+u[m+1]; u[m] = s/(m+1); u[m] = s div (m+1); e[m] = s%(m+1); } intvec r,p,B,Prelim; string result,prelim; N = (10*n)/3 + 2; N = (10*n) div 3 + 2; p[N+1]=0; p=p+2; r=p; for( i=1; i<=N+1; i=i+1 ) { B[i]=2*i-1; } { r[m] = e%B[m]; q    = e/B[m]; q    = e div B[m]; e    = q*(m-1)+p[m-1]; } r[1] = e%10; q    = e/10; q    = e div 10; if( q!=10 and q!=9 ) { if( q==10 ) { Prelim = (Prelim+1)-((Prelim+1)/10)*10; Prelim = (Prelim+1)-((Prelim+1) div 10)*10; for( m=size(Prelim); m>0; m=m-1) {
• ## Singular/LIB/matrix.lib

 r9e7626 // \$Id: matrix.lib,v 1.2 1997-04-28 19:27:22 obachman Exp \$ // \$Id: matrix.lib,v 1.3 1997-08-12 14:01:08 Singular Exp \$ // (GMG/BM, last modified 22.06.96) /////////////////////////////////////////////////////////////////////////////// print(A); int n=4; ideal i = ideal(randommat(1,n*(n-1)/2,maxideal(1),9)); ideal i = ideal(randommat(1,n*(n-1) div 2,maxideal(1),9)); print(skewmat(n,i));  // skew matrix of generic linear forms kill R1; print(A); int n=3; ideal i = ideal(randommat(1,n*(n+1)/2,maxideal(1),9)); ideal i = ideal(randommat(1,n*(n+1) div 2,maxideal(1),9)); print(symmat(n,i));  // symmetric matrix of generic linear forms kill R1;
• ## Singular/LIB/poly.lib

 r9e7626 // \$Id: poly.lib,v 1.6 1997-08-04 15:14:19 Singular Exp \$ // \$Id: poly.lib,v 1.7 1997-08-12 14:01:08 Singular Exp \$ //system("random",787422842); //(GMG, last modified 22.06.96) while ( c-jet(c,i) != 0 ) { i = 2*(i+1); } int o = i-1; int u = (d != i)*((i/ 2)-1); int u = (d != i)*((i div 2)-1); //----------------------- "quick search" for maxdeg ------------------------ while ( (c-jet(c,i)==0)*(c-jet(c,i-1)!=0) == 0) { i = (o+1+u)/ 2; i = (o+1+u) div 2; if (c-jet(c,i)!=0) { u = i+1; } else { o = i-1; } i = -d; while ( c == jet(c,i,v) ) { i = 2*(i-1); } int o = (d != -i)*((i/ 2)+2) - 1; int o = (d != -i)*((i div 2)+2) - 1; int u = i+1; int e = -1; while ( c != jet(c,i,v) ) { i = 2*(i+1); } int o = i-1; int u = (d != i)*((i/ 2)-1); int u = (d != i)*((i div 2)-1); int e = 1; } while ( ( c==jet(c,i,v) )*( c!=jet(c,i-1,v) ) == 0 ) { i = (o+e+u)/ 2; i = (o+e+u) div 2; if ( c!=jet(c,i,v) ) { u = i+1; } else { o = i-1; } while ( jet(c,i) == 0 ) { i = 2*(i+1); } int o = i-1; int u = (d != i)*((i/ 2)-1); int u = (d != i)*((i div 2)-1); //----------------------- "quick search" for mindeg ------------------------ while ( (jet(c,u)==0)*(jet(c,o)!=0) ) { i = (o+u)/ 2; i = (o+u) div 2; if (jet(c,i)==0) { u = i+1; } else { o = i-1; } i = -d; while ( jet(c,i,v) != 0 ) { i = 2*(i-1); } int o = (d != -i)*((i/ 2)+2) - 1; int o = (d != -i)*((i div 2)+2) - 1; int u = i+1; int e = -1; i=u; while ( jet(c,i,v) == 0 ) { i = 2*(i+1); } int o = i-1; int u = (d != i)*((i/ 2)-1); int u = (d != i)*((i div 2)-1); int e = 1; i=u; } while ( (jet(c,i-1,v)==0)*(jet(c,i,v)!=0) == 0 ) { i = (o+e+u)/ 2; i = (o+e+u) div 2; if (jet(c,i,v)==0) { u = i+1; } else { o = i-1; }