The algorithm computing the subresultant sequence with pseudo-remainders is given below. In this algorithm, the input is a pair of polynomials in "Z"The are the successive pseudo remainders in "Z"[X, the variables "i" and are non negative integers, and the Greek letters denote elements in "Z". The functions codice_1 and codice_2 denote the degree of a polynomial and the remainder of the Euclidean division. In the algorithm, this remainder is always in "Z"Finally the divisions denoted / are always exact and have their result either in "Z"[X or in "Z".