Hi all,
I have two multivariate polynomials A and B over the integer ring. I know that B divides exactly A. I need to perform this division using the monomial ordering that I choose. I can't find in the documentation any exact division function.
The following code does not work : int degre=4; ring r=integer,(x,y,z,t),lp; poly s1=(1+x+y+z+t)^5; poly s2=s1+1; poly p=s2*s1; poly q=p/s2;
I obtain the following message. ? division over a coefficient domain only implemented for terms ? error occurred in or before STDIN line 6: `poly q=p/s2;` ….
If I replace r by the following definition, it works : ring r=0,(x,y,z,t),lp;
Does it exist a function for exact division?
Mickaël
Hi all,
I have two multivariate polynomials A and B over the integer ring. I know that B divides exactly A. I need to perform this division using the monomial ordering that I choose. I can't find in the documentation any exact division function.
The following code does not work : int degre=4; ring r=integer,(x,y,z,t),lp; poly s1=(1+x+y+z+t)^5; poly s2=s1+1; poly p=s2*s1; poly q=p/s2;
I obtain the following message. ? division over a coefficient domain only implemented for terms ? error occurred in or before STDIN line 6: `poly q=p/s2;` ….
If I replace r by the following definition, it works : ring r=0,(x,y,z,t),lp;
Does it exist a function for exact division?
Mickaël
