Suppose given polynomials $e,q,h,r$ in $R[x]$, $p \in R$ (R a ring), how can I use Sage to find $f$ in $R[x]$ so $f e = q h + r (\text{mod } p)$?
Similarly, given $f,g$ in $R[x]$ with $\text{gcd}(f,g)=1$, what function can I use to compute $s,t$ in $R[x]$ so $s f + g h = 1 (\text{mod } p)$ ?
p=7 R=PolynomialRing(IntegerModRing(7),'x') x=R.gen()
I'm not sure if f exist
Maybe f=(q*h+r)//e
Or you want something like this? q=f//g r=f.mod(g)
As for the next question:
f=x^14 + 4*x^7 + 7
g=x^3+1
xgcd(f,g)
Thanks!
and is there a way to work around the use of the integermodring? I'm writing an algorithm in which I have to succesively compute different functions e.g.
s_j g_j + t_j h_j = 1 modulo p^2^j
s_j g_j + t_j h_j = 1 modulo p^2^(j+1)
Would it be best to redefine
R=PolynomialRing(IntegerModRing(p^2^j),'x') every time?
Asked: 2014-01-03 19:31:55 +0100
Seen: 1,441 times
Last updated: Jan 09 '14
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.