A multiple root satisfies both the polynomial and its derivative; solving the gcd of the polynomial and its derivative gives the repeated root, then evaluating the expression yields the answer.
We are given the polynomial
P(x)=x5−6x4+11x3−2x2−12x+8
and told that α is a multiple root. A multiple root means it is a root of P(x) and also a root of its derivative P′(x) (since the multiplicity is at least 2). The key idea: find the common roots of P and P′ by computing their greatest common divisor (gcd). Then test each candidate in the expression 3α2−2α+1.
- Find the derivative
P′(x)=5x4−24x3+33x2−4x−12
-
Compute the gcd of P and P′
We perform polynomial long division (or Euclidean algorithm). Divide P(x) by P′(x):
- Leading term: x5/5x4=51x. Multiply P′(x) by 51x:
51x⋅P′(x)=x5−524x4+533x3−54x2−512x
- Subtract from P(x):
P(x)−51xP′(x)=(−6+524)x4+(11−533)x3+(−2+54)x2+(−12+512)x+8
Simplify coefficients:
=(−530+524)x4=−56x4
(555−533)x3=522x3
(−510+54)x2=−56x2
(−560+512)x=−548x
Constant: $+8 = \frac{40}{5}$. So remainder is:
R1(x)=−56x4+522x3−56x2−548x+540
Multiply by 5 to clear denominators (gcd is unaffected by scaling):
R1(x)=−6x4+22x3−6x2−48x+40
Factor $-2$ (optional): $R_1(x) = -2(3x^4 - 11x^3 + 3x^2 + 24x - 20)$.
3. Continue the Euclidean algorithm
Now divide P′(x) by this remainder (or its scaled version). Use Q(x)=3x4−11x3+3x2+24x−20 for convenience.
Divide 5x4−24x3+33x2−4x−12 by 3x4−11x3+3x2+24x−20:
Leading term: 5x4/3x4=35. Multiply:
35Q(x)=5x4−355x3+5x2+40x−3100
Subtract from P′(x):
(−24+355)x3=(−372+355)x3=−317x3
(33−5)x2=28x2
(−4−40)x=−44x
(−12+3100)=(−336+3100)=364
So remainder:
R2(x)=−317x3+28x2−44x+364
Multiply by 3:
R2(x)=−17x3+84x2−132x+64
- Next step
Divide Q(x)=3x4−11x3+3x2+24x−20 by R2(x)=−17x3+84x2−132x+64.
Leading term: 3x4/−17x3=−173x. Multiply:
−173x⋅R2(x)=173x4−17252x3+17396x2−17192x
Subtract from Q(x) (write Q with denominator 17):
Q(x)=1751x4−17187x3+1751x2+17408x−17340
Subtract:
x3:(−17187+17252)=1765x3
x2:(1751−17396)=−17345x2
x:(17408+17192)=17600x
Constant: −17340. So remainder:
R3(x)=1765x3−17345x2+17600x−17340
Multiply by 17:
R3(x)=65x3−345x2+600x−340
Factor 5: R3(x)=5(13x3−69x2+120x−68).
- Continue
Divide R2(x)=−17x3+84x2−132x+64 by S(x)=13x3−69x2+120x−68.
Leading term: −17/13. Multiply:
−1317S(x)=−17x3+131173x2−132040x+131156
Subtract from R2 (write R2 with denominator 13):
R2=13−221x3+131092x2−131716x+13832
Subtract:
x2:(131092−131173)=−1381x2
x:(−131716+132040)=13324x
Constant: (13832−131156)=−13324
So remainder:
R4(x)=−1381x2+13324x−13324
Multiply by 13: R4(x)=−81x2+324x−324=−81(x2−4x+4)=−81(x−2)2.
- The gcd
The last nonzero remainder (up to constant factor) is (x−2)2. So the common factor of P and P′ is x−2. Hence the only multiple root is α=2.
Instead of the full Euclidean algorithm, one could test small integer roots of P (like ±1,±2,±4,±8) and check multiplicity by derivative. Here x=2 works: P(2)=0, P′(2)=0, confirming a double root.
- Evaluate the expression
3α2−2α+1=3(2)2−2(2)+1=12−4+1=9
A common mistake is to forget that a multiple root must satisfy both P(x)=0 and P′(x)=0. Checking only P(x)=0 might give extraneous simple roots.
✓Final answer
The correct option is (D).
ANSWER: D