On Euclid's Algorithm and the Theory of Subresultants

Abstract

This paper presents an elementary treatment of the theory of subresultants, and examines the relationship of the subresultants of a given pair of polynomials to their polynomial remainder sequence as determined by Euclid's algorithm. Two important versions of Euclid's algorithm are discussed. The results are essentially the same as those of Collins, but the presentation is briefer, simpler, and somewhat more general. © 1971, ACM. All rights reserved.