Solve x4+2x3+3x2+1=0x^4+2x^3+3x^2+1=0

Aion

Junior Member
Joined
May 8, 2018
Messages
201
Problem.

Solve x4+2x3+3x2+1=0x^4+2x^3+3x^2+1=0 if we know it has a double root.


Useful theorem.

If α\alpha is a root to p(x)p(x) of multiplicity mm, then it's a root to pp' of multiplicity m1m-1. The multiple roots of pp are exactly the roots of the greatest common divisor of pp and pp'.

Suppose α\alpha is a root to the greatest common divisor of pp and pp'. Then it has multiplicity at least 1 as root for pp' and hence is at least a double root for pp. If α\alpha is a multiple root for pp it is a root for pp' as well by the previous theorem. Let ff be the greatest common divisor for pp and pp', then there exist polynomials gg and hh such that f=gp+hpf=gp+hp' and we have f(α)=g(α)p(α)+h(α)p(α)=0f(\alpha)=g(\alpha)p(\alpha)+h(\alpha)p'(\alpha)=0 since p(α)=p(α)=0.p(\alpha)=p'(\alpha)=0.


My attempt:

By the above theorem the problem is reduced to finding the greatest common divisor ff for pp and pp' using the Euclidean algorithm. I've attempted to compute GCD(p,p)GCD(p,p') but I'm not sure if I'm doing it correctly as it appears as if the remainder is less than degree 1, in which case pp and pp' should not have any common roots. But I know that's not the case by the above assumption there exists some α\alpha such that p(x)=(xα)2q(x)p(x)=(x-\alpha)^2q(x) for some polynomial q(x)q(x) and q(α)0q(\alpha)\neq0.Then p(x)=(xα)(2q(x)+(xα)q(x))p'(x)=(x-\alpha)(2q(x)+(x-\alpha)q'(x)), and clearly α\alpha has multiplicity 1 for p(x)p'(x). Using WolframAlpha I see that p(x)=(x2+x+1)2p(x)=(x^2+x+1)^2 and p(x)=2(2x+1)(x2+x+1)p'(x)=2(2x+1)(x^2+x+1). Hence f=GCD(p,p)=x2+x+1f=GCD(p,p')=x^2+x+1. However, I'm not sure how to arrive at that conclusion myself.

Here's my attempt to use the Euclidean algorithm on pp and pp'. Let p(x)=x4+2x3+3x2+2x+1p(x)=x^4+2x^3+3x^2+2x+1and p(x)=4x3+6x2+6x+2p'(x)=4x^3+6x^2+6x+2
Dividing p(x)p(x) by p(x)p'(x) we have

p(x)=(x4+18)(4x3+6x2+6x+2)+14(x27x3)=q1(x)p(x)+r1(x)p(x)=(\frac{x}{4}+\frac{1}{8})(4x^3+6x^2+6x+2)+-\frac{1}{4}(x^2-7x-3)=q_1(x)p'(x)+r_1(x)p(x)=(4x+34)(x27x3)+8(32x+13)=q2(x)r1(x)+r2(x)p'(x)=(4x+34)(x^2-7x-3)+8(32x+13)=q_2(x)r_1(x)+r_2(x)r1(x)=(x32237322)(32x+13)+9322=q3(x)r2(x)+r3(x)r_1(x)=(\frac{x}{32}-\frac{237}{32^2})(32x+13)+\frac{9}{32^2}=q_3(x)r_2(x)+r_3(x)
Here the degree of r3(x)r_3(x) is constant so we can't continue.
 
Last edited:
Problem.

Solve x4+2x3+3x2+1=0x^4+2x^3+3x^2+1=0 if we know it has a double root.


Useful theorem.

If α\alpha is a root to p(x)p(x) of multiplicity mm, then it's a root to pp' of multiplicity m1m-1. The multiple roots of pp are exactly the roots of the greatest common divisor of pp and pp'.

Suppose α\alpha is a root to the greatest common divisor of pp and pp'. Then it has multiplicity at least 1 as root for pp' and hence is at least a double root for pp. If α\alpha is a multiple root for pp it is a root for pp' as well by the previous theorem. Let ff be the greatest common divisor for pp and pp', then there exist polynomials gg and hh such that f=gp+hpf=gp+hp' and we have f(α)=g(α)p(α)+h(α)p(α)=0f(\alpha)=g(\alpha)p(\alpha)+h(\alpha)p'(\alpha)=0 since p(α)=p(α)=0.p(\alpha)=p'(\alpha)=0.


My attempt:

By the above theorem the problem is reduced to finding the greatest common divisor ff for pp and pp' using the Euclidean algorithm. I've attempted to compute GCD(p,p)GCD(p,p') but I'm not sure if I'm doing it correctly as it appears as if the remainder is less than degree 1, in which case pp and pp' should not have any common roots. But I know that's not the case by the above assumption there exists some α\alpha such that p(x)=(xα)2q(x)p(x)=(x-\alpha)^2q(x) for some polynomial q(x)q(x) and q(α)0q(\alpha)\neq0.Then p(x)=(xα)(2q(x)+(xα)q(x))p'(x)=(x-\alpha)(2q(x)+(x-\alpha)q'(x)), and clearly α\alpha has multiplicity 1 for p(x)p'(x). Using WolframAlpha I see that p(x)=(x2+x+1)2p(x)=(x^2+x+1)^2 and p(x)=2(2x+1)(x2+x+1)p'(x)=2(2x+1)(x^2+x+1). Hence f=GCD(p,p)=x2+x+1f=GCD(p,p')=x^2+x+1. However, I'm not sure how to arrive at that conclusion myself.

Here's my attempt to use the Euclidean algorithm on pp and pp'. Let p(x)=x4+2x3+3x2+2x+1p(x)=x^4+2x^3+3x^2+2x+1and p(x)=4x3+6x2+6x+2p'(x)=4x^3+6x^2+6x+2
Dividing p(x)p(x) by p(x)p'(x) we have

p(x)=(x4+18)(4x3+6x2+6x+2)+14(x27x3)=q1(x)p(x)+r1(x)p(x)=(\frac{x}{4}+\frac{1}{8})(4x^3+6x^2+6x+2)+-\frac{1}{4}(x^2-7x-3)=q_1(x)p'(x)+r_1(x)p(x)=(4x+34)(x27x3)+8(32x+13)=q2(x)r1(x)+r2(x)p'(x)=(4x+34)(x^2-7x-3)+8(32x+13)=q_2(x)r_1(x)+r_2(x)r1(x)=(x32237322)(32x+13)+9322=q3(x)r2(x)+r3(x)r_1(x)=(\frac{x}{32}-\frac{237}{32^2})(32x+13)+\frac{9}{32^2}=q_3(x)r_2(x)+r_3(x)
Here the degree of r3(x)r_3(x) is constant so we can't continue.
I must have been tired yesterday as I realise it's a simple calculation mistake.

p(x)=(x4+18)(4x3+6x2+6x+2)+34(x2+x+1)=q1(x)p(x)+r1(x)p(x)=(\frac{x}{4}+\frac{1}{8})(4x^3+6x^2+6x+2)+\frac{3}{4}(x^2+x+1)=q_1(x)p'(x)+r_1(x)p(x)=(4x+2)(x2+x+1)+0=q2(x)r1(x)p'(x)=(4x+2)(x^2+x+1)+0=q_2(x)r_1(x)
Thus f=gcd(p,p)=x2+x+1f=gcd(p,p')=x^2+x+1. Hence ff roots are α=1±i32\alpha=\frac{-1\pm i\sqrt{3}}{2} both of multiplicity 2 to pp. This is easily verified by dividing p(x)p(x) by x2+x+1x^2+x+1.
 
I think you typed the problem wrong.

Which of these is correct?
Solve x4+2x3+3x2+1=0x^4+2x^3+3x^2+1=0 if we know it has a double root.

Here's my attempt to use the Euclidean algorithm on pp and pp'. Let p(x)=x4+2x3+3x2+2x+1p(x)=x^4+2x^3+3x^2+2x+1
You omitted "+2x", so my attempt to solve it failed, and my check of your work failed because I didn't notice the change in p.
 
I think you typed the problem wrong.

Which of these is correct?



You omitted "+2x", so my attempt to solve it failed, and my check of your work failed because I didn't notice the change in p.
Yes, sorry I noticed this error today. The problem was to solve x4+2x3+3x2+2x+1=0x^4+2x^3+3x^2+2x+1=0, not x4+2x3+3x2+1=0x^4+2x^3+3x^2+1=0
 
Hint: show that if pp and pp^\prime have common root then q=pmod  pq = p \mod p^\prime would have the same root too.
 
Top