version 1.19, 2001/10/30 07:25:58 |
version 1.25, 2002/10/23 07:54:58 |
|
|
/* $OpenXM: OpenXM_contrib2/asir2000/engine/Hgfs.c,v 1.18 2001/10/09 01:36:10 noro Exp $ */ |
/* $OpenXM: OpenXM_contrib2/asir2000/engine/Hgfs.c,v 1.24 2002/09/30 06:13:07 noro Exp $ */ |
|
|
#include "ca.h" |
#include "ca.h" |
|
#include "inline.h" |
|
|
void lnfsf(int n,UM p0,UM p1,struct p_pair *list,UM np0,UM np1); |
void lnfsf(int n,UM p0,UM p1,struct p_pair *list,UM np0,UM np1); |
|
void extractcoefbm(BM f,int dx,UM r); |
|
|
int comp_dum(DUM a,DUM b) |
int comp_dum(DUM a,DUM b) |
{ |
{ |
Line 14 int comp_dum(DUM a,DUM b) |
|
Line 16 int comp_dum(DUM a,DUM b) |
|
return 0; |
return 0; |
} |
} |
|
|
void fctrsf(P p,DCP *dcp) |
void ufctrsf(P p,DCP *dcp) |
{ |
{ |
int n,i,j,k; |
int n,i,j,k; |
DCP dc,dc0; |
DCP dc,dc0; |
Line 26 void fctrsf(P p,DCP *dcp) |
|
Line 28 void fctrsf(P p,DCP *dcp) |
|
|
|
simp_ff((Obj)p,&obj); p = (P)obj; |
simp_ff((Obj)p,&obj); p = (P)obj; |
if ( !p ) { |
if ( !p ) { |
*dcp = 0; return; |
NEWDC(dc); COEF(dc) = 0; DEG(dc) = ONE; |
|
NEXT(dc) = 0; *dcp = dc; |
|
return; |
} |
} |
mp = W_UMALLOC(UDEG(p)); |
mp = W_UMALLOC(UDEG(p)); |
ptosfum(p,mp); |
ptosfum(p,mp); |
Line 509 void ptosfbm(int,P,BM); |
|
Line 513 void ptosfbm(int,P,BM); |
|
|
|
/* f = f(x,y) */ |
/* f = f(x,y) */ |
|
|
void sfhensel(int count,P f,V x,GFS *evp,P *sfp,ML *listp) |
void sfhensel(int count,P f,V x,int degbound,GFS *evp,P *sfp,ML *listp) |
{ |
{ |
int i; |
int i; |
int fn; |
int fn; |
Line 520 void sfhensel(int count,P f,V x,GFS *evp,P *sfp,ML *li |
|
Line 524 void sfhensel(int count,P f,V x,GFS *evp,P *sfp,ML *li |
|
int dx,dy,bound; |
int dx,dy,bound; |
GFS ev; |
GFS ev; |
P f1,t,c,sf; |
P f1,t,c,sf; |
DCP dc; |
DCP dc,dct,dc0; |
UM q,fm,hm; |
UM q,fm,hm; |
UM *gm; |
UM *gm; |
struct oEGT tmp0,tmp1,eg_hensel,eg_hensel_t; |
struct oEGT tmp0,tmp1,eg_hensel,eg_hensel_t; |
Line 543 void sfhensel(int count,P f,V x,GFS *evp,P *sfp,ML *li |
|
Line 547 void sfhensel(int count,P f,V x,GFS *evp,P *sfp,ML *li |
|
*listp = rlist = MLALLOC(1); rlist->n = fn; rlist->c[0] = 0; |
*listp = rlist = MLALLOC(1); rlist->n = fn; rlist->c[0] = 0; |
return; |
return; |
} |
} |
/* pass the the leading coeff. to the first element */ |
if ( degbound >= 0 ) { |
c = dc->c; dc = NEXT(dc); |
/* |
mulp(vl,dc->c,c,&t); dc->c = t; |
* reconstruct dc so that |
|
* dc[1],... : factors satisfy degree bound |
|
* dc[0] : product of others |
|
*/ |
|
c = dc->c; dc = NEXT(dc); |
|
dc0 = 0; |
|
fn = 0; |
|
while ( dc ) { |
|
if ( getdeg(x,COEF(dc)) <= degbound ) { |
|
dct = NEXT(dc); NEXT(dc) = dc0; dc0 = dc; dc = dct; |
|
fn++; |
|
} else { |
|
mulp(vl,COEF(dc),c,&t); c = t; |
|
dc = NEXT(dc); |
|
} |
|
} |
|
if ( OID(c) == O_P ) { |
|
NEWDC(dc); COEF(dc) = c; DEG(dc) = ONE; NEXT(dc) = dc0; |
|
fn++; |
|
} else { |
|
mulp(vl,dc0->c,c,&t); dc0->c = t; dc = dc0; |
|
} |
|
} else { |
|
/* pass the the leading coeff. to the first element */ |
|
c = dc->c; dc = NEXT(dc); |
|
mulp(vl,dc->c,c,&t); dc->c = t; |
|
} |
|
|
/* convert mod y-a factors into UM */ |
/* convert mod y-a factors into UM */ |
gm = (UM *)ALLOCA(fn*sizeof(UM)); |
gm = (UM *)ALLOCA(fn*sizeof(UM)); |
Line 555 void sfhensel(int count,P f,V x,GFS *evp,P *sfp,ML *li |
|
Line 585 void sfhensel(int count,P f,V x,GFS *evp,P *sfp,ML *li |
|
} |
} |
|
|
/* set bound */ |
/* set bound */ |
|
/* g | f, lc_y(g) = lc_y(f) => deg_y(g) <= deg_y(f) */ |
|
/* so, bound = dy is sufficient, but we use slightly large value */ |
bound = dy+2; |
bound = dy+2; |
|
|
/* f(x,y) -> f(x,y+ev) */ |
/* f(x,y) -> f(x,y+ev) */ |
Line 618 int sfberle(VL vl,P f,int count,GFS *ev,DCP *dcp) |
|
Line 650 int sfberle(VL vl,P f,int count,GFS *ev,DCP *dcp) |
|
V x,y; |
V x,y; |
P lc,lc0,f0; |
P lc,lc0,f0; |
Obj obj; |
Obj obj; |
int j,q1,index,i; |
int j,q,index,i; |
|
|
clctv(vl,f,&nvl); vl = nvl; |
clctv(vl,f,&nvl); vl = nvl; |
x = vl->v; y = vl->next->v; |
x = vl->v; y = vl->next->v; |
Line 626 int sfberle(VL vl,P f,int count,GFS *ev,DCP *dcp) |
|
Line 658 int sfberle(VL vl,P f,int count,GFS *ev,DCP *dcp) |
|
n = QTOS(DEG(DC(f))); |
n = QTOS(DEG(DC(f))); |
wf = W_UMALLOC(n); wf1 = W_UMALLOC(n); wf2 = W_UMALLOC(n); |
wf = W_UMALLOC(n); wf1 = W_UMALLOC(n); wf2 = W_UMALLOC(n); |
wfs = W_UMALLOC(n); gcd = W_UMALLOC(n); |
wfs = W_UMALLOC(n); gcd = W_UMALLOC(n); |
q1 = field_order_sf()-1; |
q = field_order_sf(); |
lc = DC(f)->c; |
lc = DC(f)->c; |
for ( j = 0, fn = n + 1, index = 0; |
for ( j = 0, fn = n + 1, index = 0; |
index < q1 && j < count && fn > 1; index++ ) { |
index < q && j < count && fn > 1; index++ ) { |
MKGFS(index,m); |
indextogfs(index,&m); |
substp(vl,lc,y,(P)m,&lc0); |
substp(vl,lc,y,(P)m,&lc0); |
if ( lc0 ) { |
if ( lc0 ) { |
substp(vl,f,y,(P)m,&f0); |
substp(vl,f,y,(P)m,&f0); |
ptosfum(f0,wf); cpyum(wf,wf1); |
ptosfum(f0,wf); cpyum(wf,wf1); |
diffsfum(wf1,wf2); gcdsfum(wf1,wf2,gcd); |
diffsfum(wf1,wf2); gcdsfum(wf1,wf2,gcd); |
if ( DEG(gcd) == 0 ) { |
if ( DEG(gcd) == 0 ) { |
fctrsf(f0,&dc); |
ufctrsf(f0,&dc); |
for ( dct = NEXT(dc), i = 0; dct; dct = NEXT(dct), i++ ); |
for ( dct = NEXT(dc), i = 0; dct; dct = NEXT(dct), i++ ); |
if ( i < fn ) { |
if ( i < fn ) { |
dc0 = dc; fn = i; fm = m; |
dc0 = dc; fn = i; fm = m; |
Line 646 int sfberle(VL vl,P f,int count,GFS *ev,DCP *dcp) |
|
Line 678 int sfberle(VL vl,P f,int count,GFS *ev,DCP *dcp) |
|
} |
} |
} |
} |
} |
} |
if ( index == q1 ) |
if ( index == q ) |
return 0; |
return 0; |
else if ( fn == 1 ) |
else if ( fn == 1 ) |
return 1; |
return 1; |
Line 833 void sfbmtop(BM f,V x,V y,P *fp) |
|
Line 865 void sfbmtop(BM f,V x,V y,P *fp) |
|
if ( DEG(c[j]) >= i && (a = COEF(c[j])[i]) ) { |
if ( DEG(c[j]) >= i && (a = COEF(c[j])[i]) ) { |
NEWDC(dct); |
NEWDC(dct); |
STOQ(j,DEG(dct)); |
STOQ(j,DEG(dct)); |
MKGFS(IFTOF(a),b); |
iftogfs(a,&b); |
COEF(dct) = (P)b; |
COEF(dct) = (P)b; |
NEXT(dct) = dc; |
NEXT(dct) = dc; |
dc = dct; |
dc = dct; |
Line 866 void sfsqfr(P f,DCP *dcp) |
|
Line 898 void sfsqfr(P f,DCP *dcp) |
|
NEWDC(dc); DEG(dc) = ONE; COEF(dc) = f; NEXT(dc) = 0; *dcp = dc; |
NEWDC(dc); DEG(dc) = ONE; COEF(dc) = f; NEXT(dc) = 0; *dcp = dc; |
} else if ( !NEXT(vl) ) |
} else if ( !NEXT(vl) ) |
sfusqfr(f,dcp); |
sfusqfr(f,dcp); |
else if ( !NEXT(NEXT(vl)) ) |
|
sfbsqfr(f,vl->v,NEXT(vl)->v,dcp); |
|
else |
else |
error("sfsqfr : not implemented yet"); |
sqfrsf(f,dcp); |
} |
} |
|
|
void sfusqfr(P f,DCP *dcp) |
void sfusqfr(P f,DCP *dcp) |
Line 900 void sfusqfr(P f,DCP *dcp) |
|
Line 930 void sfusqfr(P f,DCP *dcp) |
|
*dcp = dct; |
*dcp = dct; |
} |
} |
|
|
|
#if 0 |
|
void sfbsqfrmain(P f,V x,V y,DCP *dcp) |
|
{ |
|
/* XXX*/ |
|
} |
|
|
|
/* f is bivariate */ |
|
|
void sfbsqfr(P f,V x,V y,DCP *dcp) |
void sfbsqfr(P f,V x,V y,DCP *dcp) |
{ |
{ |
P t,rf,cx,cy; |
P t,rf,cx,cy; |
VL vl,rvl; |
VL vl,rvl; |
DCP dcx,dcy; |
DCP dcx,dcy,dct,dc; |
struct oVL vl0,vl1; |
struct oVL vl0,vl1; |
|
|
/* vl = [x,y] */ |
/* cy(y) = cont(f,x), f /= cy */ |
vl0.v = x; vl0.next = &vl1; vl1.v = y; vl1.next = 0; vl = &vl0; |
|
/* cy(y) = cont(f,x), f /= cx */ |
|
cont_pp_sfp(vl,f,&cy,&t); f = t; |
cont_pp_sfp(vl,f,&cy,&t); f = t; |
/* rvl = [y,x] */ |
/* rvl = [y,x] */ |
reordvar(vl,y,&rvl); reorderp(rvl,vl,f,&rf); |
reordvar(vl,y,&rvl); reorderp(rvl,vl,f,&rf); |
Line 918 void sfbsqfr(P f,V x,V y,DCP *dcp) |
|
Line 954 void sfbsqfr(P f,V x,V y,DCP *dcp) |
|
reorderp(vl,rvl,rf,&f); |
reorderp(vl,rvl,rf,&f); |
|
|
/* f -> cx*cy*f */ |
/* f -> cx*cy*f */ |
sfusqfr(cx,&dcx); |
sfsqfr(cx,&dcx); dcx = NEXT(dcx); |
sfusqfr(cy,&dcy); |
sfsqfr(cy,&dcy); dcy = NEXT(dcy); |
|
if ( dcx ) { |
|
for ( dct = dcx; NEXT(dct); dct = NEXT(dct) ); |
|
NEXT(dct) = dcy; |
|
} else |
|
dcx = dcy; |
|
if ( OID(f) == O_N ) |
|
*dcp = dcx; |
|
else { |
|
/* f must be bivariate */ |
|
sfbsqfrmain(f,x,y,&dc); |
|
if ( dcx ) { |
|
for ( dct = dcx; NEXT(dct); dct = NEXT(dct) ); |
|
NEXT(dct) = dc; |
|
} else |
|
dcx = dc; |
|
*dcp = dcx; |
|
} |
} |
} |
|
#endif |
|
|
void sfdtest(P,ML,V,V,DCP *); |
void sfdtest(P,ML,V,V,DCP *); |
|
|
void sfbfctr(P f,V x,V y,DCP *dcp) |
/* if degbound >= 0 find factor s.t. deg_x(factor) <= degbound */ |
|
|
|
void sfbfctr(P f,V x,V y,int degbound,DCP *dcp) |
{ |
{ |
ML list; |
ML list; |
P sf; |
P sf; |
Line 934 void sfbfctr(P f,V x,V y,DCP *dcp) |
|
Line 990 void sfbfctr(P f,V x,V y,DCP *dcp) |
|
int dx,dy; |
int dx,dy; |
|
|
/* sf(x) = f(x+ev) = list->c[0]*list->c[1]*... */ |
/* sf(x) = f(x+ev) = list->c[0]*list->c[1]*... */ |
sfhensel(5,f,x,&ev,&sf,&list); |
sfhensel(5,f,x,degbound,&ev,&sf,&list); |
if ( list->n == 0 ) |
if ( list->n == 0 ) |
error("sfbfctr : short of evaluation points"); |
error("sfbfctr : short of evaluation points"); |
else if ( list->n == 1 ) { |
else if ( list->n == 1 ) { |
Line 962 void sfbfctr(P f,V x,V y,DCP *dcp) |
|
Line 1018 void sfbfctr(P f,V x,V y,DCP *dcp) |
|
void sfdtest(P f,ML list,V x,V y,DCP *dcp) |
void sfdtest(P f,ML list,V x,V y,DCP *dcp) |
{ |
{ |
int np,dx,dy; |
int np,dx,dy; |
int i,j,k; |
int i,j,k,bound; |
int *win; |
int *win; |
P g,lcg,factor,cofactor,lcyx; |
P g,lcg,factor,cofactor,lcyx; |
P csum; |
P csum; |
DCP dcf,dcf0,dc; |
DCP dcf,dcf0,dc; |
BM *c; |
BM *c; |
BM lcy; |
BM lcy; |
UM lcg0; |
UM lcg0,lcy0,w; |
|
UM *d1c; |
ML wlist; |
ML wlist; |
struct oVL vl1,vl0; |
struct oVL vl1,vl0; |
VL vl; |
VL vl; |
Line 985 void sfdtest(P f,ML list,V x,V y,DCP *dcp) |
|
Line 1042 void sfdtest(P f,ML list,V x,V y,DCP *dcp) |
|
win = W_ALLOC(np+1); |
win = W_ALLOC(np+1); |
wlist = W_MLALLOC(np); |
wlist = W_MLALLOC(np); |
wlist->n = list->n; |
wlist->n = list->n; |
wlist->bound = list->bound; |
bound = wlist->bound = list->bound; |
c = (BM *)COEF(wlist); |
c = (BM *)COEF(wlist); |
bcopy((char *)COEF(list),(char *)c,(int)(sizeof(BM)*np)); |
bcopy((char *)COEF(list),(char *)c,(int)(sizeof(BM)*np)); |
|
|
Line 1009 void sfdtest(P f,ML list,V x,V y,DCP *dcp) |
|
Line 1066 void sfdtest(P f,ML list,V x,V y,DCP *dcp) |
|
NEWP(lcyx); VR(lcyx) = x; DC(lcyx) = dc; |
NEWP(lcyx); VR(lcyx) = x; DC(lcyx) = dc; |
ptosfbm(dy,lcyx,lcy); |
ptosfbm(dy,lcyx,lcy); |
|
|
|
/* initialize lcy0 by LC(f) */ |
|
lcy0 = W_UMALLOC(bound); |
|
ptosfum(COEF(DC(g)),lcy0); |
|
|
|
/* ((d-1 coefs)*lcy0 */ |
|
d1c = (UM *)W_ALLOC(np*sizeof(UM)); |
|
w = W_UMALLOC(2*bound); |
|
for ( i = 1; i < np; i++ ) { |
|
extractcoefbm(c[i],degbm(c[i])-1,w); |
|
d1c[i] = W_UMALLOC(2*bound); |
|
mulsfum(w,lcy0,d1c[i]); |
|
/* d1c[i] = d1c[i] mod y^(bound+1) */ |
|
if ( DEG(d1c[i]) > bound ) { |
|
for ( j = DEG(d1c[i]); j > bound; j-- ) |
|
COEF(d1c[i])[j] = 0; |
|
degum(d1c[i],bound); |
|
} |
|
} |
|
|
fprintf(stderr,"np = %d\n",np); |
fprintf(stderr,"np = %d\n",np); |
dtok = 0; |
dtok = 0; |
for ( g = f, k = 1, dcf = dcf0 = 0, win[0] = 1, --np, z = 0; ; z++ ) { |
for ( g = f, k = 1, dcf = dcf0 = 0, win[0] = 1, --np, z = 0; ; z++ ) { |
if ( !(z % 1000) ) fprintf(stderr,"."); |
if ( !(z % 1000) ) fprintf(stderr,"."); |
dt = sfdegtest(dy,wlist,k,win); |
dt = sfdegtest(dy,bound,d1c,k,win); |
if ( dt ) |
if ( dt ) |
dtok++; |
dtok++; |
if ( dt && sfdtestmain(vl,lcg,lcg0,lcy,csum,wlist, |
if ( dt && sfdtestmain(vl,lcg,lcg0,lcy,csum,wlist, |
Line 1054 void sfdtest(P f,ML list,V x,V y,DCP *dcp) |
|
Line 1130 void sfdtest(P f,ML list,V x,V y,DCP *dcp) |
|
else |
else |
for ( i = 1; i < k; i++ ) |
for ( i = 1; i < k; i++ ) |
win[i] = win[0] + i; |
win[i] = win[0] + i; |
|
|
|
|
|
/* update lcy0 */ |
|
ptosfum(COEF(DC(g)),lcy0); |
|
|
|
/* update d-1 coeffs */ |
|
for ( i = 1; i <= np; i++ ) { |
|
extractcoefbm(c[i],degbm(c[i])-1,w); |
|
mulsfum(w,lcy0,d1c[i]); |
|
/* d1c[i] = d1c[1] mod y^(bound+1) */ |
|
if ( DEG(d1c[i]) > bound ) { |
|
for ( j = DEG(d1c[i]); j > bound; j-- ) |
|
COEF(d1c[i])[j] = 0; |
|
degum(d1c[i],bound); |
|
} |
|
} |
} else if ( !ncombi(1,np,k,win) ) |
} else if ( !ncombi(1,np,k,win) ) |
if ( k == np ) |
if ( k == np ) |
break; |
break; |
Line 1066 void sfdtest(P f,ML list,V x,V y,DCP *dcp) |
|
Line 1158 void sfdtest(P f,ML list,V x,V y,DCP *dcp) |
|
DEG(dcf) = ONE; NEXT(dcf) = 0; *dcp = dcf0; |
DEG(dcf) = ONE; NEXT(dcf) = 0; *dcp = dcf0; |
} |
} |
|
|
void extractcoefbm(BM f,int d,UM r) |
void extractcoefbm(BM f,int dx,UM r) |
{ |
{ |
int j; |
int j; |
UM fj; |
UM fj; |
|
|
for ( j = DEG(f); j >= 0; j-- ) { |
for ( j = DEG(f); j >= 0; j-- ) { |
fj = COEF(f)[j]; |
fj = COEF(f)[j]; |
if ( fj && DEG(fj) >= d ) { |
if ( fj && DEG(fj) >= dx ) { |
COEF(r)[j] = COEF(fj)[d]; |
COEF(r)[j] = COEF(fj)[dx]; |
} else |
} else |
COEF(r)[j] = 0; |
COEF(r)[j] = 0; |
} |
} |
Line 1083 void extractcoefbm(BM f,int d,UM r) |
|
Line 1175 void extractcoefbm(BM f,int d,UM r) |
|
|
|
/* deg_y(prod mod y^(bound+1)) <= dy ? */ |
/* deg_y(prod mod y^(bound+1)) <= dy ? */ |
|
|
int sfdegtest(int dy,ML list,int k,int *in) |
int sfdegtest(int dy,int bound,UM *d1c,int k,int *in) |
{ |
{ |
int bound,dx,dx1,i,j; |
int i,j; |
UM w,w1,w2,wt; |
UM w,w1,wt; |
BM t; |
BM t; |
|
|
bound = list->bound; |
|
w = W_UMALLOC(bound); |
w = W_UMALLOC(bound); |
w1 = W_UMALLOC(bound); |
w1 = W_UMALLOC(bound); |
w2 = W_UMALLOC(bound); |
|
clearum(w,bound); |
clearum(w,bound); |
for ( i = 0; i < k; i++ ) { |
for ( i = 0; i < k; i++ ) { |
t = (BM)list->c[in[i]]; |
addsfum(w,d1c[in[i]],w1); wt = w; w = w1; w1 = wt; |
dx = degbm(t); |
|
dx1 = dx-1; |
|
/* t = t->c[0] + t->c[1]*y + ... + t->c[j]*y^j + ... */ |
|
/* extract coef. of x^dx1 and add it to w */ |
|
extractcoefbm(t,dx1,w1); |
|
addsfum(w,w1,w2); wt = w; w = w2; w2 = wt; |
|
} |
} |
for ( j = bound; j >= dy; j-- ) |
return DEG(w) <= dy ? 1 : 0; |
if ( COEF(w)[j] ) |
|
break; |
|
return j <= dy ? 1 : 0; |
|
} |
} |
|
|
/* lcy = LC(g), lcg = lcy*g, lcg0 = const part of lcg */ |
/* lcy = LC(g), lcg = lcy*g, lcg0 = const part of lcg */ |
Line 1239 void cont_pp_sfp(VL vl,P f,P *cp,P *fp) |
|
Line 1320 void cont_pp_sfp(VL vl,P f,P *cp,P *fp) |
|
y = vl->next->v; |
y = vl->next->v; |
d = getdeg(y,f); |
d = getdeg(y,f); |
if ( d == 0 ) { |
if ( d == 0 ) { |
MKGFS(0,g); |
itogfs(1,&g); |
*cp = (P)g; |
*cp = (P)g; |
*fp = f; /* XXX */ |
*fp = f; /* XXX */ |
} else { |
} else { |
Line 1305 int divtp_by_sfbm(VL vl,P f,P g,P *qp) |
|
Line 1386 int divtp_by_sfbm(VL vl,P f,P g,P *qp) |
|
/* XXX generate an irreducible poly of degree n */ |
/* XXX generate an irreducible poly of degree n */ |
|
|
extern int current_gfs_q1; |
extern int current_gfs_q1; |
|
extern int *current_gfs_ntoi; |
|
|
void generate_defpoly_sfum(int n,UM *dp) |
void generate_defpoly_sfum(int n,UM *dp) |
{ |
{ |
Line 1332 void generate_defpoly_sfum(int n,UM *dp) |
|
Line 1414 void generate_defpoly_sfum(int n,UM *dp) |
|
for ( j = 0; j < i; j++ ) |
for ( j = 0; j < i; j++ ) |
w[j] = 0; |
w[j] = 0; |
w[i]++; |
w[i]++; |
for ( i = 0; i < n; i++ ) |
if ( !current_gfs_ntoi ) |
c[i] = w[i]?FTOIF(w[i]-1):0; |
for ( i = 0; i < n; i++ ) |
|
c[i] = w[i]?FTOIF(w[i]):0; |
|
else |
|
for ( i = 0; i < n; i++ ) |
|
c[i] = w[i]?FTOIF(w[i]-1):0; |
if ( !c[0] ) |
if ( !c[0] ) |
continue; |
continue; |
diffsfum(r,dr); cpyum(r,t); gcdsfum(t,dr,g); |
diffsfum(r,dr); cpyum(r,t); gcdsfum(t,dr,g); |