Go to the first, previous, next, last section, table of contents.


sdiv, sdivm, srem, sremm, sqr, sqrm

sdiv(poly1,poly2[,v])
sdivm(poly1,poly2,mod[,v])
:: poly1poly2 で割る除算が最後まで実行できる場合に商を求める.
srem(poly1,poly2[,v])
sremm(poly1,poly2,mod[,v])
:: poly1poly2 で割る除算が最後まで実行できる場合に剰余を求める.
sqr(poly1,poly2[,v])
sqrm(poly1,poly2,mod[,v])
:: poly1poly2 で割る除算が最後まで実行できる場合に商, 剰余を 求める.
return
sdiv(), sdivm(), srem(), sremm() : 多項式, sqr(), sqrm() : [商,剰余] なるリスト
poly1 poly2
多項式
v
不定元
mod
素数
[0] sdiv((x+y+z)^3,x^2+y+a);    
x+3*y+3*z
[1] srem((x+y+z)^2,x^2+y+a);
(2*y+2*z)*x+y^2+(2*z-1)*y+z^2-a
[2] X=(x+y+z)*(x-y-z)^2;
x^3+(-y-z)*x^2+(-y^2-2*z*y-z^2)*x+y^3+3*z*y^2+3*z^2*y+z^3
[3] Y=(x+y+z)^2*(x-y-z);  
x^3+(y+z)*x^2+(-y^2-2*z*y-z^2)*x-y^3-3*z*y^2-3*z^2*y-z^3
[4] G=gcd(X,Y);
x^2-y^2-2*z*y-z^2
[5] sqr(X,G);
[x-y-z,0]
[6] sqr(Y,G);
[x+y+z,0]
[7] sdiv(y*x^3+x+1,y*x+1);  
divsp: cannot happen
return to toplevel
参照
section idiv, irem, section %.


Go to the first, previous, next, last section, table of contents.