Thread: Highest common factor, Polynomial division

Hi, think this is the correct forum, apologies if not.

Find the highest common factor of the polynomials
and .

Hence factorise into irreducible polynomials in .

First I started off by factorising, by long division I got the following:



Not sure where to go from here. I'm ok with the Euclidean algorithm but not sure how to apply it here?

Thanks in advance

Edit just seen that I've not fully completed the algorithm yet! Think I can manage this..

I wondered about that- because what you wrote involved neither factoring nor long division!

Yeh sorry about that. Posted the question and then realised that I'd only done the first bit... oops.

It's often also wise before you start to do a rational root test:

Let

Suppose has rational roots then it either has to be .

I checked for you and notice that ! This means you can allready factor out .

For the other function we have . This means that you only have to check whether the roots of are roots of g(x) and you're done.

Edit: I can better put it like this. It now follows that gcd gcd(

Your first step was the first step in Euclidean factorization:



Now you have to do this again, but with the polynomials:


Keep going until the remainder is 0.

Your first step was the first step in Euclidean factorization:



Now you have to do this again, but with the polynomials:


Keep going until the remainder is 0.

That is clearly impossible: Only possible when For some linear factor . This is not the case here, there will allways be a remainder.