Wednesday, 18 March 2015

gcd and lcm - finding the greatest common divisor of two polynomial, I'm stuck

I'm trying to find the greates common divisor of two polynomials. The polynomials are:
p1=x3+3x+1p2=x4+1
Matlab is telling me that the GCD is 1, and that's also what I was expected.



However when I try to do It by hand it dosn't equal to 1, so what am I doing wrong?(I'm using Long division and writing it as Euclidian algorithm).



x4+1=(x3+3x+1)x(3x2x+1)x3+3x+1=(3x2x+1)(x3+19)+(31x9+89)3x2x+1=(31x9+89)(27x3163961)+101796131x9+89=1017961(29791x9153+76889153)+891017961=8991537688+0



so the GCD should be =89??

No comments:

Post a Comment

real analysis - How to find limhrightarrow0fracsin(ha)h

How to find lim without lhopital rule? I know when I use lhopital I easy get $$ \lim_{h\rightarrow 0}...