Thread: Euclidean Algorithm

Originally Posted by TexasLinda

Kind of new to this but I was seeing if someone could help me wit this problem.

Use the Euclidean Algorithm to find the greatest common divisor g of
x^4 + 3x^3 +2x^2 + 3x + 1 and x^4 - x^3 + 3x^2 - x + 2

Thanks
TexasLinda

Hello,

1. The gcd is

2. Look here: http://en.wikipedia.org/wiki/Euclidean_algorithm

You'll find there a similar example completely done.

Hope that this will help you a little bit further on.

Greetings

EB