Hi everyone,
Let's suppose that we are working with polynomials modulo n a composite number, for which we know the factorization (n=p*q). If we know that f(x) can be divided by e.g. g(x), what is the most efficient way to calculate f(x)/g(x) in Z_n with Sage?
Thanks for your time
I do not know if this is the best answer but it works
sage: K = Zmod(543) # the ring Z/nZ
sage: R.<x> = PolynomialRing(K,'x')
sage: f = 3*x^5 + 2*x + 1
sage: g = 2*x + 1
sage: f.quo_rem(g)
(273*x^4 + 135*x^3 + 204*x^2 + 441*x + 52, 492)
The method quo_rem returns the 2-tuple made of the quotient and the remainder of the division.
Asked: 2013-06-02 21:37:25 +0200
Seen: 1,955 times
Last updated: Jun 03 '13
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.