On Monday, March 24, 2014 7:56:33 AM UTC-7, martin....@gmx.net wrote: > > Working in a stack of multivariate polynomial rings, how can I compute the > quotient of two polynomials in those cases where I know the remainder to be > zero? > > Reading the docs I found two likely approaches, but neither seems to work > as I'd have hoped. See below for error messages. > > Example: > > sage: PR1.<a,b>=QQ[] > sage: PR2.<x,y>=PR1[] > sage: n=(x-y)*(x+3*y) > sage: d=(x-y) > You can do this by manually converting into a singular-compatible ring and back:
sage: S=QQ['a,b,x,y'] sage: PR2(S(n)//S(d)) x + 3*y This is one place where the fact that sage considers variable names as significant, comes in handy: it can figure out how to map PR2 to S and back. -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-support+unsubscr...@googlegroups.com. To post to this group, send email to sage-support@googlegroups.com. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
