Lecture 9: Polynomial Remainder Sequences

Date:  Mar. 1

Background Material and Further Resources



  1. Pseudo-remainder and its computing time.
  2. Polynomial Remainder Sequences (PRS) and similarity.
  3. Pseudo-remainder PRS and its computing time.
  4. Determinant polynomials and the pseudo-remainder.
  5. Determinant bound.
  6. Subresultants and the fundamental theorem of PRS.
  7. Primitive PRS and its computing time.
  8. Reduced PRS and Subresultant PRS.
  9. Exercise: A modular polynomial multiplication algorithm.

Maple Worksheet

SACLIB Programs

Created: Feb. 29, 2000 by jjohnson@mcs.drexel.edu