- Show that is an upper bound for the coefficients of computed in (when regarding and as polynomials of ).
- Describe a modular algorithm for computing
in
**and**give an upper for the number of machine word operations required by this algorithm. - Deduce an algorithm for computing
in
**and**give an upper for the number of machine word operations required by this algorithm.

*
*

2008-03-18