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.
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.
Look at this.Should they be polynomials of higher degree?
It has examples for both numbers and polynomials.
Both are extremely cases similar.