Hi, Does sage have an implementation of Bivariate polynomial Euclid's division algorithm?
In particular, I want to divide f(x) = x^p - 1 by g(x,y) = (x-y)^2 - c. Here, p is a large prime. The division occur in F[y] / (y^7 - 1) where F is a finite field(Z mod p).That is while applying division I don't want to allow the power of y to increse beyond 7. I am new to sage. Any help would be great. Thanks, Kundan -- 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 [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support. For more options, visit https://groups.google.com/d/optout.
