Next: GCD of polynomials with
Up: GCD of polynomials with
Previous: GCD of polynomials with
- we want to calculate
where
- by using the algorithm GCDPQ, we get the following remainders
- so the polynomials
and 
are
co-prime since their greatest common divisor is 
Richard Liska