Problem.
Solve x4+2x3+3x2+1=0 if we know it has a double root.
Useful theorem.
If α is a root to p(x) of multiplicity m, then it's a root to p′ of multiplicity m−1. The multiple roots of p are exactly the roots of the greatest common divisor of p and p′.
Suppose α is a root to the greatest common divisor of p and p′. Then it has multiplicity at least 1 as root for p′ and hence is at least a double root for p. If α is a multiple root for p it is a root for p′ as well by the previous theorem. Let f be the greatest common divisor for p and p′, then there exist polynomials g and h such that f=gp+hp′ and we have f(α)=g(α)p(α)+h(α)p′(α)=0 since p(α)=p′(α)=0.
My attempt:
By the above theorem the problem is reduced to finding the greatest common divisor f for p and p′ using the Euclidean algorithm. I've attempted to compute 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 p and p' should not have any common roots. But I know that's not the case by the above assumption there exists some α such that p(x)=(x−α)2q(x) for some polynomial q(x) and q(α)=0.Then p′(x)=(x−α)(2q(x)+(x−α)q′(x)), and clearly α has multiplicity 1 for p′(x). Using WolframAlpha I see that p(x)=(x2+x+1)2 and p′(x)=2(2x+1)(x2+x+1). Hence f=GCD(p,p′)=x2+x+1. However, I'm not sure how to arrive at that conclusion myself.
Here's my attempt to use the Euclidean algorithm on p and p′. Let p(x)=x4+2x3+3x2+2x+1and p′(x)=4x3+6x2+6x+2
Dividing p(x) by p′(x) we have
p(x)=(4x+81)(4x3+6x2+6x+2)+−41(x2−7x−3)=q1(x)p′(x)+r1(x)p′(x)=(4x+34)(x2−7x−3)+8(32x+13)=q2(x)r1(x)+r2(x)r1(x)=(32x−322237)(32x+13)+3229=q3(x)r2(x)+r3(x)
Here the degree of r3(x) is constant so we can't continue.
Solve x4+2x3+3x2+1=0 if we know it has a double root.
Useful theorem.
If α is a root to p(x) of multiplicity m, then it's a root to p′ of multiplicity m−1. The multiple roots of p are exactly the roots of the greatest common divisor of p and p′.
Suppose α is a root to the greatest common divisor of p and p′. Then it has multiplicity at least 1 as root for p′ and hence is at least a double root for p. If α is a multiple root for p it is a root for p′ as well by the previous theorem. Let f be the greatest common divisor for p and p′, then there exist polynomials g and h such that f=gp+hp′ and we have f(α)=g(α)p(α)+h(α)p′(α)=0 since p(α)=p′(α)=0.
My attempt:
By the above theorem the problem is reduced to finding the greatest common divisor f for p and p′ using the Euclidean algorithm. I've attempted to compute 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 p and p' should not have any common roots. But I know that's not the case by the above assumption there exists some α such that p(x)=(x−α)2q(x) for some polynomial q(x) and q(α)=0.Then p′(x)=(x−α)(2q(x)+(x−α)q′(x)), and clearly α has multiplicity 1 for p′(x). Using WolframAlpha I see that p(x)=(x2+x+1)2 and p′(x)=2(2x+1)(x2+x+1). Hence f=GCD(p,p′)=x2+x+1. However, I'm not sure how to arrive at that conclusion myself.
Here's my attempt to use the Euclidean algorithm on p and p′. Let p(x)=x4+2x3+3x2+2x+1and p′(x)=4x3+6x2+6x+2
Dividing p(x) by p′(x) we have
p(x)=(4x+81)(4x3+6x2+6x+2)+−41(x2−7x−3)=q1(x)p′(x)+r1(x)p′(x)=(4x+34)(x2−7x−3)+8(32x+13)=q2(x)r1(x)+r2(x)r1(x)=(32x−322237)(32x+13)+3229=q3(x)r2(x)+r3(x)
Here the degree of r3(x) is constant so we can't continue.
Last edited: