2017-11-25 17:27:34 +0100 | received badge | ● Famous Question (source) |
2017-03-02 12:59:03 +0100 | received badge | ● Notable Question (source) |
2016-11-08 19:27:57 +0100 | received badge | ● Popular Question (source) |
2014-01-09 18:12:26 +0100 | received badge | ● Editor (source) |
2014-01-09 18:12:05 +0100 | answered a question | Extended Euclid with polynomials 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. Would it be best to redefine R=PolynomialRing(IntegerModRing(p^2^j),'x') every time? |
2014-01-07 18:07:23 +0100 | received badge | ● Supporter (source) |
2014-01-03 19:31:55 +0100 | asked a question | Extended Euclid with polynomials 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)$ ? |