Next:
Exercise 1.
Up:
Quiz6
Previous:
Notations.
Formulas.
Let
be a commutative ring with 1. We recall the algorithm for computing the inverse of a polynomial
modulo a power of
.
Next:
Exercise 1.
Up:
Quiz6
Previous:
Notations.
Marc Moreno Maza
2008-01-31
be a commutative ring with 1.
We recall the algorithm for computing the inverse of a
polynomial
![$ f \in R[x]$](img15.png)
modulo a power of 
.
![\fbox{
\begin{minipage}{10 cm}
\begin{description}
\item[{\bf Input:}] $f \in R[...
... \mod{ \ x^{2^i}} $\ \\
\> {\bf return} $g_r$\ \\
\end{tabbing}\end{minipage}}](img16.png)