**Date of postage.**- Thursday 12 of February.
**Due format.**- A porgram in AXIOM, ALDOR or MAPLE. The language must be the same as for the project.
**Date for submission.**- Thursday 11 of March.
**Description.**- You have the write a function that takes as input
two polynomials
*f*_{1},*f*_{2}in [*x*,*y*] and returns their common roots in a similar form as TRIADE (that is, a list of triangular sets). Assume that*x*<*y*holds. This means that we want to compute univariate conditions in*x*rather than in*y*. Then, you can call an existing function for computing the resultant of*f*_{1},*f*_{2}w.r.t.*x*. Let*r*be the square-free part of this resultant and let be the product of fields [*x*]/*r*. The next and last step is the computation of the gcd of*f*_{1},*f*_{2}regarded as univariate polynomials in [*y*]. You must implement this step yourself, without callling any gcd function from TRIADE.

2005-02-04