Thread: GCD of polynomials

Hello,
could you help me understand the procedure of finding the GCD of two polynomials step by step, using the Euclidean Algorithm?
For example

Thanks.

Originally Posted by drthea

Hello,
could you help me understand the procedure of finding the GCD of two polynomials step by step, using the Euclidean Algorithm?
For example

Thanks.

There is no need to use Euclidean here and besides it does not work since it produces the answer in the first line.
Therefore, it does not give any infromation in this problem.

Just note by long division.
Thus,

Hi and thanks for your answer.
Could you give me an example of where the Euclid's algorithm can be used,
concerning polynomials? Should they be polynomials of higher degree?

Originally Posted by drthea

Hi and thanks for your answer.
Could you give me an example of where the Euclid's algorithm can be used,
concerning polynomials?

When using the Euclidean algorithm you repeating apply the division algorithm in several steps until you get rid of the remainder. The problem here is that first application already produces no remainder. That is why this is not a good example.

Should they be polynomials of higher degree?

Look at this.
It has examples for both numbers and polynomials.
Both are extremely cases similar.