Next: GCD of polynomials with
Up: GCD of polynomials with
Previous: GCD of polynomials with
- we want to calculate
where
![displaymath10878](img109.gif)
![displaymath10879](img110.gif)
- by using the algorithm GCDPQ, we get the following remainders
![eqnarray354](img112.gif)
- so the polynomials
and
are
co-prime since their greatest common divisor is ![math967](img113.gif)
Richard Liska