Erich Prisner
UMUC SG
Spring 2002
Polynomial Division
x
7
+
x
6
+
x
5
+
x
4
+
x
3
+
x
2
+
x +
divided by
x
6
+
x
5
+
x
4
+
x
3
+
x
2
+
x +
equals
with remainder
Euclid's Algorithm applied to Polynomials
Find gcd (greatest common denominator) of the two polynomials
x
7
+
x
6
+
x
5
+
x
4
+
x
3
+
x
2
+
x +
x
6
+
x
5
+
x
4
+
x
3
+
x
2
+
x +
The start polynomials have been
and