Erich Prisner
UMUC SG
Spring 2002

Polynomial Division

x7 + x6 + x5 + x4 + x3 + x2 + x +
divided by x6 + x5 + x4 + x3 + x2 + x + equals
with remainder

Euclid's Algorithm applied to Polynomials

Find gcd (greatest common denominator) of the two polynomials

x7 + x6 + x5 + x4 + x3 + x2 + x +
x6 + x5 + x4 + x3 + x2 + x +


The start polynomials have been
and